20.16/8.94 NO 20.16/8.94 20.16/8.94 Ultimate: Cannot open display: 20.16/8.94 This is Ultimate 0.1.24-8dc7c08-m 20.16/8.94 [2019-03-28 12:39:30,472 INFO L170 SettingsManager]: Resetting all preferences to default values... 20.16/8.94 [2019-03-28 12:39:30,474 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 20.16/8.94 [2019-03-28 12:39:30,486 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 20.16/8.94 [2019-03-28 12:39:30,486 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 20.16/8.94 [2019-03-28 12:39:30,487 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 20.16/8.94 [2019-03-28 12:39:30,488 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 20.16/8.94 [2019-03-28 12:39:30,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 20.16/8.94 [2019-03-28 12:39:30,491 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 20.16/8.94 [2019-03-28 12:39:30,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 20.16/8.94 [2019-03-28 12:39:30,493 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 20.16/8.94 [2019-03-28 12:39:30,493 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 20.16/8.94 [2019-03-28 12:39:30,494 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 20.16/8.94 [2019-03-28 12:39:30,495 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 20.16/8.94 [2019-03-28 12:39:30,496 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 20.16/8.94 [2019-03-28 12:39:30,497 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 20.16/8.94 [2019-03-28 12:39:30,498 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 20.16/8.94 [2019-03-28 12:39:30,499 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 20.16/8.94 [2019-03-28 12:39:30,501 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 20.16/8.94 [2019-03-28 12:39:30,502 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 20.16/8.94 [2019-03-28 12:39:30,503 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 20.16/8.94 [2019-03-28 12:39:30,505 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 20.16/8.94 [2019-03-28 12:39:30,507 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 20.16/8.94 [2019-03-28 12:39:30,507 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 20.16/8.94 [2019-03-28 12:39:30,507 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 20.16/8.94 [2019-03-28 12:39:30,508 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 20.16/8.94 [2019-03-28 12:39:30,509 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 20.16/8.94 [2019-03-28 12:39:30,510 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 20.16/8.94 [2019-03-28 12:39:30,510 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 20.16/8.94 [2019-03-28 12:39:30,510 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 20.16/8.94 [2019-03-28 12:39:30,511 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 20.16/8.94 [2019-03-28 12:39:30,512 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 20.16/8.94 [2019-03-28 12:39:30,513 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 20.16/8.94 [2019-03-28 12:39:30,513 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 20.16/8.94 [2019-03-28 12:39:30,514 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 20.16/8.94 [2019-03-28 12:39:30,514 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 20.16/8.94 [2019-03-28 12:39:30,514 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 20.16/8.94 [2019-03-28 12:39:30,515 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 20.16/8.94 [2019-03-28 12:39:30,516 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 20.16/8.94 [2019-03-28 12:39:30,516 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 20.16/8.94 [2019-03-28 12:39:30,531 INFO L110 SettingsManager]: Loading preferences was successful 20.16/8.94 [2019-03-28 12:39:30,531 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 20.16/8.94 [2019-03-28 12:39:30,532 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 20.16/8.94 [2019-03-28 12:39:30,532 INFO L133 SettingsManager]: * Rewrite not-equals=true 20.16/8.94 [2019-03-28 12:39:30,532 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 20.16/8.94 [2019-03-28 12:39:30,533 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 20.16/8.94 [2019-03-28 12:39:30,533 INFO L133 SettingsManager]: * Use SBE=true 20.16/8.94 [2019-03-28 12:39:30,533 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 20.16/8.94 [2019-03-28 12:39:30,533 INFO L133 SettingsManager]: * Use old map elimination=false 20.16/8.94 [2019-03-28 12:39:30,533 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 20.16/8.94 [2019-03-28 12:39:30,533 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 20.16/8.94 [2019-03-28 12:39:30,534 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 20.16/8.94 [2019-03-28 12:39:30,534 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 20.16/8.94 [2019-03-28 12:39:30,534 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 20.16/8.94 [2019-03-28 12:39:30,534 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.16/8.94 [2019-03-28 12:39:30,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 20.16/8.94 [2019-03-28 12:39:30,534 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 20.16/8.94 [2019-03-28 12:39:30,535 INFO L133 SettingsManager]: * Check division by zero=IGNORE 20.16/8.94 [2019-03-28 12:39:30,535 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 20.16/8.94 [2019-03-28 12:39:30,535 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 20.16/8.94 [2019-03-28 12:39:30,535 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 20.16/8.94 [2019-03-28 12:39:30,535 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 20.16/8.94 [2019-03-28 12:39:30,536 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 20.16/8.94 [2019-03-28 12:39:30,536 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 20.16/8.94 [2019-03-28 12:39:30,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.16/8.94 [2019-03-28 12:39:30,536 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 20.16/8.94 [2019-03-28 12:39:30,536 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 20.16/8.94 [2019-03-28 12:39:30,536 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 20.16/8.94 [2019-03-28 12:39:30,537 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 20.16/8.94 [2019-03-28 12:39:30,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 20.16/8.94 [2019-03-28 12:39:30,575 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 20.16/8.94 [2019-03-28 12:39:30,579 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 20.16/8.94 [2019-03-28 12:39:30,581 INFO L271 PluginConnector]: Initializing CDTParser... 20.16/8.94 [2019-03-28 12:39:30,581 INFO L276 PluginConnector]: CDTParser initialized 20.16/8.94 [2019-03-28 12:39:30,582 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 20.16/8.94 [2019-03-28 12:39:30,685 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/cf5bf27429024cb9965a9d5ed4d47397/FLAG604b87e93 20.16/8.94 [2019-03-28 12:39:31,032 INFO L307 CDTParser]: Found 1 translation units. 20.16/8.94 [2019-03-28 12:39:31,033 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 20.16/8.94 [2019-03-28 12:39:31,033 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 20.16/8.94 [2019-03-28 12:39:31,040 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/cf5bf27429024cb9965a9d5ed4d47397/FLAG604b87e93 20.16/8.94 [2019-03-28 12:39:31,437 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/cf5bf27429024cb9965a9d5ed4d47397 20.16/8.94 [2019-03-28 12:39:31,449 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 20.16/8.94 [2019-03-28 12:39:31,451 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 20.16/8.94 [2019-03-28 12:39:31,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 20.16/8.94 [2019-03-28 12:39:31,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 20.16/8.94 [2019-03-28 12:39:31,456 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 20.16/8.94 [2019-03-28 12:39:31,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:39:31" (1/1) ... 20.16/8.94 [2019-03-28 12:39:31,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59fc7960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:31, skipping insertion in model container 20.16/8.94 [2019-03-28 12:39:31,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:39:31" (1/1) ... 20.16/8.94 [2019-03-28 12:39:31,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 20.16/8.94 [2019-03-28 12:39:31,485 INFO L176 MainTranslator]: Built tables and reachable declarations 20.16/8.94 [2019-03-28 12:39:31,652 INFO L206 PostProcessor]: Analyzing one entry point: main 20.16/8.94 [2019-03-28 12:39:31,664 INFO L191 MainTranslator]: Completed pre-run 20.16/8.94 [2019-03-28 12:39:31,746 INFO L206 PostProcessor]: Analyzing one entry point: main 20.16/8.94 [2019-03-28 12:39:31,763 INFO L195 MainTranslator]: Completed translation 20.16/8.94 [2019-03-28 12:39:31,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:31 WrapperNode 20.16/8.94 [2019-03-28 12:39:31,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 20.16/8.94 [2019-03-28 12:39:31,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 20.16/8.94 [2019-03-28 12:39:31,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 20.16/8.94 [2019-03-28 12:39:31,765 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 20.16/8.94 [2019-03-28 12:39:31,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:31" (1/1) ... 20.16/8.94 [2019-03-28 12:39:31,785 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:31" (1/1) ... 20.16/8.94 [2019-03-28 12:39:31,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 20.16/8.94 [2019-03-28 12:39:31,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 20.16/8.94 [2019-03-28 12:39:31,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 20.16/8.94 [2019-03-28 12:39:31,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized 20.16/8.94 [2019-03-28 12:39:31,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:31" (1/1) ... 20.16/8.94 [2019-03-28 12:39:31,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:31" (1/1) ... 20.16/8.94 [2019-03-28 12:39:31,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:31" (1/1) ... 20.16/8.94 [2019-03-28 12:39:31,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:31" (1/1) ... 20.16/8.94 [2019-03-28 12:39:31,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:31" (1/1) ... 20.16/8.94 [2019-03-28 12:39:31,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:31" (1/1) ... 20.16/8.94 [2019-03-28 12:39:31,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:31" (1/1) ... 20.16/8.94 [2019-03-28 12:39:31,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 20.16/8.94 [2019-03-28 12:39:31,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 20.16/8.94 [2019-03-28 12:39:31,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... 20.16/8.94 [2019-03-28 12:39:31,836 INFO L276 PluginConnector]: RCFGBuilder initialized 20.16/8.94 [2019-03-28 12:39:31,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:31" (1/1) ... 20.16/8.94 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.16/8.94 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 20.16/8.94 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.16/8.94 [2019-03-28 12:39:31,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 20.16/8.94 [2019-03-28 12:39:31,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 20.16/8.94 [2019-03-28 12:39:31,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 20.16/8.94 [2019-03-28 12:39:31,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 20.16/8.94 [2019-03-28 12:39:31,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 20.16/8.94 [2019-03-28 12:39:31,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 20.16/8.94 [2019-03-28 12:39:32,225 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 20.16/8.94 [2019-03-28 12:39:32,225 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 20.16/8.94 [2019-03-28 12:39:32,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:32 BoogieIcfgContainer 20.16/8.94 [2019-03-28 12:39:32,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 20.16/8.94 [2019-03-28 12:39:32,228 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 20.16/8.94 [2019-03-28 12:39:32,228 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 20.16/8.94 [2019-03-28 12:39:32,230 INFO L276 PluginConnector]: BlockEncodingV2 initialized 20.16/8.94 [2019-03-28 12:39:32,231 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:32" (1/1) ... 20.16/8.94 [2019-03-28 12:39:32,252 INFO L313 BlockEncoder]: Initial Icfg 63 locations, 67 edges 20.16/8.94 [2019-03-28 12:39:32,254 INFO L258 BlockEncoder]: Using Remove infeasible edges 20.16/8.94 [2019-03-28 12:39:32,254 INFO L263 BlockEncoder]: Using Maximize final states 20.16/8.94 [2019-03-28 12:39:32,255 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 20.16/8.94 [2019-03-28 12:39:32,255 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 20.16/8.94 [2019-03-28 12:39:32,257 INFO L296 BlockEncoder]: Using Remove sink states 20.16/8.94 [2019-03-28 12:39:32,258 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 20.16/8.94 [2019-03-28 12:39:32,258 INFO L179 BlockEncoder]: Using Rewrite not-equals 20.16/8.94 [2019-03-28 12:39:32,290 INFO L185 BlockEncoder]: Using Use SBE 20.16/8.94 [2019-03-28 12:39:32,326 INFO L200 BlockEncoder]: SBE split 34 edges 20.16/8.94 [2019-03-28 12:39:32,332 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 20.16/8.94 [2019-03-28 12:39:32,333 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.16/8.94 [2019-03-28 12:39:32,382 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding 20.16/8.94 [2019-03-28 12:39:32,385 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 20.16/8.94 [2019-03-28 12:39:32,387 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 20.16/8.94 [2019-03-28 12:39:32,387 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.16/8.94 [2019-03-28 12:39:32,387 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 20.16/8.94 [2019-03-28 12:39:32,388 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 20.16/8.94 [2019-03-28 12:39:32,389 INFO L313 BlockEncoder]: Encoded RCFG 53 locations, 91 edges 20.16/8.94 [2019-03-28 12:39:32,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:39:32 BasicIcfg 20.16/8.94 [2019-03-28 12:39:32,389 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 20.16/8.94 [2019-03-28 12:39:32,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 20.16/8.94 [2019-03-28 12:39:32,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... 20.16/8.94 [2019-03-28 12:39:32,394 INFO L276 PluginConnector]: TraceAbstraction initialized 20.16/8.94 [2019-03-28 12:39:32,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:39:31" (1/4) ... 20.16/8.94 [2019-03-28 12:39:32,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d7502e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:39:32, skipping insertion in model container 20.16/8.94 [2019-03-28 12:39:32,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:31" (2/4) ... 20.16/8.94 [2019-03-28 12:39:32,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d7502e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:39:32, skipping insertion in model container 20.16/8.94 [2019-03-28 12:39:32,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:32" (3/4) ... 20.16/8.94 [2019-03-28 12:39:32,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d7502e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:32, skipping insertion in model container 20.16/8.94 [2019-03-28 12:39:32,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:39:32" (4/4) ... 20.16/8.94 [2019-03-28 12:39:32,398 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.16/8.94 [2019-03-28 12:39:32,408 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 20.16/8.94 [2019-03-28 12:39:32,417 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. 20.16/8.94 [2019-03-28 12:39:32,434 INFO L257 AbstractCegarLoop]: Starting to check reachability of 30 error locations. 20.16/8.94 [2019-03-28 12:39:32,463 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.16/8.95 [2019-03-28 12:39:32,464 INFO L382 AbstractCegarLoop]: Interprodecural is true 20.16/8.95 [2019-03-28 12:39:32,464 INFO L383 AbstractCegarLoop]: Hoare is true 20.16/8.95 [2019-03-28 12:39:32,465 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 20.16/8.95 [2019-03-28 12:39:32,465 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 20.16/8.95 [2019-03-28 12:39:32,465 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.16/8.95 [2019-03-28 12:39:32,465 INFO L387 AbstractCegarLoop]: Difference is false 20.16/8.95 [2019-03-28 12:39:32,465 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 20.16/8.95 [2019-03-28 12:39:32,465 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 20.16/8.95 [2019-03-28 12:39:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. 20.16/8.95 [2019-03-28 12:39:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 20.16/8.95 [2019-03-28 12:39:32,487 INFO L394 BasicCegarLoop]: Found error trace 20.16/8.95 [2019-03-28 12:39:32,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 20.16/8.95 [2019-03-28 12:39:32,488 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 20.16/8.95 [2019-03-28 12:39:32,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:32,494 INFO L82 PathProgramCache]: Analyzing trace with hash 166667, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:32,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:32,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:32,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:32,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:32,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.16/8.95 [2019-03-28 12:39:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.16/8.95 [2019-03-28 12:39:32,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.16/8.95 [2019-03-28 12:39:32,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.16/8.95 [2019-03-28 12:39:32,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 20.16/8.95 [2019-03-28 12:39:32,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.16/8.95 [2019-03-28 12:39:32,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.16/8.95 [2019-03-28 12:39:32,694 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. 20.16/8.95 [2019-03-28 12:39:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.16/8.95 [2019-03-28 12:39:32,893 INFO L93 Difference]: Finished difference Result 53 states and 91 transitions. 20.16/8.95 [2019-03-28 12:39:32,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.16/8.95 [2019-03-28 12:39:32,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 20.16/8.95 [2019-03-28 12:39:32,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.16/8.95 [2019-03-28 12:39:32,910 INFO L225 Difference]: With dead ends: 53 20.16/8.95 [2019-03-28 12:39:32,911 INFO L226 Difference]: Without dead ends: 51 20.16/8.95 [2019-03-28 12:39:32,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.16/8.95 [2019-03-28 12:39:32,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. 20.16/8.95 [2019-03-28 12:39:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. 20.16/8.95 [2019-03-28 12:39:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. 20.16/8.95 [2019-03-28 12:39:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 87 transitions. 20.16/8.95 [2019-03-28 12:39:32,965 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 87 transitions. Word has length 3 20.16/8.95 [2019-03-28 12:39:32,966 INFO L84 Accepts]: Finished accepts. word is rejected. 20.16/8.95 [2019-03-28 12:39:32,966 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 87 transitions. 20.16/8.95 [2019-03-28 12:39:32,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 20.16/8.95 [2019-03-28 12:39:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 87 transitions. 20.16/8.95 [2019-03-28 12:39:32,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 20.16/8.95 [2019-03-28 12:39:32,967 INFO L394 BasicCegarLoop]: Found error trace 20.16/8.95 [2019-03-28 12:39:32,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 20.16/8.95 [2019-03-28 12:39:32,968 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 20.16/8.95 [2019-03-28 12:39:32,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:32,968 INFO L82 PathProgramCache]: Analyzing trace with hash 166669, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:32,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:32,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:32,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:32,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:32,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.16/8.95 [2019-03-28 12:39:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.16/8.95 [2019-03-28 12:39:33,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.16/8.95 [2019-03-28 12:39:33,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.16/8.95 [2019-03-28 12:39:33,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 20.16/8.95 [2019-03-28 12:39:33,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.16/8.95 [2019-03-28 12:39:33,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.16/8.95 [2019-03-28 12:39:33,008 INFO L87 Difference]: Start difference. First operand 51 states and 87 transitions. Second operand 3 states. 20.16/8.95 [2019-03-28 12:39:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.16/8.95 [2019-03-28 12:39:33,148 INFO L93 Difference]: Finished difference Result 51 states and 87 transitions. 20.16/8.95 [2019-03-28 12:39:33,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.16/8.95 [2019-03-28 12:39:33,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 20.16/8.95 [2019-03-28 12:39:33,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.16/8.95 [2019-03-28 12:39:33,150 INFO L225 Difference]: With dead ends: 51 20.16/8.95 [2019-03-28 12:39:33,150 INFO L226 Difference]: Without dead ends: 49 20.16/8.95 [2019-03-28 12:39:33,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.16/8.95 [2019-03-28 12:39:33,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. 20.16/8.95 [2019-03-28 12:39:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. 20.16/8.95 [2019-03-28 12:39:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. 20.16/8.95 [2019-03-28 12:39:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 83 transitions. 20.16/8.95 [2019-03-28 12:39:33,158 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 83 transitions. Word has length 3 20.16/8.95 [2019-03-28 12:39:33,158 INFO L84 Accepts]: Finished accepts. word is rejected. 20.16/8.95 [2019-03-28 12:39:33,158 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 83 transitions. 20.16/8.95 [2019-03-28 12:39:33,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 20.16/8.95 [2019-03-28 12:39:33,158 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 83 transitions. 20.16/8.95 [2019-03-28 12:39:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 20.16/8.95 [2019-03-28 12:39:33,159 INFO L394 BasicCegarLoop]: Found error trace 20.16/8.95 [2019-03-28 12:39:33,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:33,159 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 20.16/8.95 [2019-03-28 12:39:33,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash 5168924, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:33,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:33,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:33,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.16/8.95 [2019-03-28 12:39:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.16/8.95 [2019-03-28 12:39:33,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.16/8.95 [2019-03-28 12:39:33,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.16/8.95 [2019-03-28 12:39:33,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 20.16/8.95 [2019-03-28 12:39:33,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.16/8.95 [2019-03-28 12:39:33,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.16/8.95 [2019-03-28 12:39:33,189 INFO L87 Difference]: Start difference. First operand 49 states and 83 transitions. Second operand 3 states. 20.16/8.95 [2019-03-28 12:39:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.16/8.95 [2019-03-28 12:39:33,317 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. 20.16/8.95 [2019-03-28 12:39:33,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.16/8.95 [2019-03-28 12:39:33,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 20.16/8.95 [2019-03-28 12:39:33,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.16/8.95 [2019-03-28 12:39:33,318 INFO L225 Difference]: With dead ends: 49 20.16/8.95 [2019-03-28 12:39:33,319 INFO L226 Difference]: Without dead ends: 47 20.16/8.95 [2019-03-28 12:39:33,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.16/8.95 [2019-03-28 12:39:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. 20.16/8.95 [2019-03-28 12:39:33,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. 20.16/8.95 [2019-03-28 12:39:33,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 20.16/8.95 [2019-03-28 12:39:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 79 transitions. 20.16/8.95 [2019-03-28 12:39:33,325 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 79 transitions. Word has length 4 20.16/8.95 [2019-03-28 12:39:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. 20.16/8.95 [2019-03-28 12:39:33,325 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 79 transitions. 20.16/8.95 [2019-03-28 12:39:33,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 20.16/8.95 [2019-03-28 12:39:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 79 transitions. 20.16/8.95 [2019-03-28 12:39:33,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 20.16/8.95 [2019-03-28 12:39:33,326 INFO L394 BasicCegarLoop]: Found error trace 20.16/8.95 [2019-03-28 12:39:33,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:33,327 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 20.16/8.95 [2019-03-28 12:39:33,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:33,327 INFO L82 PathProgramCache]: Analyzing trace with hash 5168926, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:33,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:33,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:33,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.16/8.95 [2019-03-28 12:39:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.16/8.95 [2019-03-28 12:39:33,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.16/8.95 [2019-03-28 12:39:33,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.16/8.95 [2019-03-28 12:39:33,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 20.16/8.95 [2019-03-28 12:39:33,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.16/8.95 [2019-03-28 12:39:33,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.16/8.95 [2019-03-28 12:39:33,356 INFO L87 Difference]: Start difference. First operand 47 states and 79 transitions. Second operand 3 states. 20.16/8.95 [2019-03-28 12:39:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.16/8.95 [2019-03-28 12:39:33,455 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. 20.16/8.95 [2019-03-28 12:39:33,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.16/8.95 [2019-03-28 12:39:33,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 20.16/8.95 [2019-03-28 12:39:33,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.16/8.95 [2019-03-28 12:39:33,457 INFO L225 Difference]: With dead ends: 49 20.16/8.95 [2019-03-28 12:39:33,457 INFO L226 Difference]: Without dead ends: 47 20.16/8.95 [2019-03-28 12:39:33,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.16/8.95 [2019-03-28 12:39:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. 20.16/8.95 [2019-03-28 12:39:33,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. 20.16/8.95 [2019-03-28 12:39:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 20.16/8.95 [2019-03-28 12:39:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 77 transitions. 20.16/8.95 [2019-03-28 12:39:33,463 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 77 transitions. Word has length 4 20.16/8.95 [2019-03-28 12:39:33,463 INFO L84 Accepts]: Finished accepts. word is rejected. 20.16/8.95 [2019-03-28 12:39:33,464 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 77 transitions. 20.16/8.95 [2019-03-28 12:39:33,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 20.16/8.95 [2019-03-28 12:39:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 77 transitions. 20.16/8.95 [2019-03-28 12:39:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 20.16/8.95 [2019-03-28 12:39:33,464 INFO L394 BasicCegarLoop]: Found error trace 20.16/8.95 [2019-03-28 12:39:33,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:33,465 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 20.16/8.95 [2019-03-28 12:39:33,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:33,465 INFO L82 PathProgramCache]: Analyzing trace with hash 5168927, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:33,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:33,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:33,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.16/8.95 [2019-03-28 12:39:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.16/8.95 [2019-03-28 12:39:33,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.16/8.95 [2019-03-28 12:39:33,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.16/8.95 [2019-03-28 12:39:33,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 20.16/8.95 [2019-03-28 12:39:33,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.16/8.95 [2019-03-28 12:39:33,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.16/8.95 [2019-03-28 12:39:33,500 INFO L87 Difference]: Start difference. First operand 47 states and 77 transitions. Second operand 3 states. 20.16/8.95 [2019-03-28 12:39:33,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.16/8.95 [2019-03-28 12:39:33,624 INFO L93 Difference]: Finished difference Result 47 states and 77 transitions. 20.16/8.95 [2019-03-28 12:39:33,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.16/8.95 [2019-03-28 12:39:33,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 20.16/8.95 [2019-03-28 12:39:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.16/8.95 [2019-03-28 12:39:33,625 INFO L225 Difference]: With dead ends: 47 20.16/8.95 [2019-03-28 12:39:33,626 INFO L226 Difference]: Without dead ends: 45 20.16/8.95 [2019-03-28 12:39:33,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.16/8.95 [2019-03-28 12:39:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 20.16/8.95 [2019-03-28 12:39:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. 20.16/8.95 [2019-03-28 12:39:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 20.16/8.95 [2019-03-28 12:39:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. 20.16/8.95 [2019-03-28 12:39:33,631 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 4 20.16/8.95 [2019-03-28 12:39:33,632 INFO L84 Accepts]: Finished accepts. word is rejected. 20.16/8.95 [2019-03-28 12:39:33,632 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. 20.16/8.95 [2019-03-28 12:39:33,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 20.16/8.95 [2019-03-28 12:39:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. 20.16/8.95 [2019-03-28 12:39:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 20.16/8.95 [2019-03-28 12:39:33,632 INFO L394 BasicCegarLoop]: Found error trace 20.16/8.95 [2019-03-28 12:39:33,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:33,633 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 20.16/8.95 [2019-03-28 12:39:33,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:33,633 INFO L82 PathProgramCache]: Analyzing trace with hash 747729089, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:33,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:33,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:33,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.16/8.95 [2019-03-28 12:39:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.16/8.95 [2019-03-28 12:39:33,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.16/8.95 [2019-03-28 12:39:33,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.16/8.95 [2019-03-28 12:39:33,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 20.16/8.95 [2019-03-28 12:39:33,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.16/8.95 [2019-03-28 12:39:33,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.16/8.95 [2019-03-28 12:39:33,665 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand 3 states. 20.16/8.95 [2019-03-28 12:39:33,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.16/8.95 [2019-03-28 12:39:33,773 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. 20.16/8.95 [2019-03-28 12:39:33,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.16/8.95 [2019-03-28 12:39:33,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 20.16/8.95 [2019-03-28 12:39:33,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.16/8.95 [2019-03-28 12:39:33,774 INFO L225 Difference]: With dead ends: 83 20.16/8.95 [2019-03-28 12:39:33,774 INFO L226 Difference]: Without dead ends: 47 20.16/8.95 [2019-03-28 12:39:33,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.16/8.95 [2019-03-28 12:39:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. 20.16/8.95 [2019-03-28 12:39:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. 20.16/8.95 [2019-03-28 12:39:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. 20.16/8.95 [2019-03-28 12:39:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 76 transitions. 20.16/8.95 [2019-03-28 12:39:33,781 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 76 transitions. Word has length 9 20.16/8.95 [2019-03-28 12:39:33,781 INFO L84 Accepts]: Finished accepts. word is rejected. 20.16/8.95 [2019-03-28 12:39:33,781 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 76 transitions. 20.16/8.95 [2019-03-28 12:39:33,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 20.16/8.95 [2019-03-28 12:39:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 76 transitions. 20.16/8.95 [2019-03-28 12:39:33,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 20.16/8.95 [2019-03-28 12:39:33,782 INFO L394 BasicCegarLoop]: Found error trace 20.16/8.95 [2019-03-28 12:39:33,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:33,783 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 20.16/8.95 [2019-03-28 12:39:33,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:33,783 INFO L82 PathProgramCache]: Analyzing trace with hash 747758880, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:33,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:33,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:33,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.16/8.95 [2019-03-28 12:39:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.16/8.95 [2019-03-28 12:39:33,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.16/8.95 [2019-03-28 12:39:33,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.16/8.95 [2019-03-28 12:39:33,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 20.16/8.95 [2019-03-28 12:39:33,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.16/8.95 [2019-03-28 12:39:33,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.16/8.95 [2019-03-28 12:39:33,811 INFO L87 Difference]: Start difference. First operand 46 states and 76 transitions. Second operand 3 states. 20.16/8.95 [2019-03-28 12:39:33,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.16/8.95 [2019-03-28 12:39:33,901 INFO L93 Difference]: Finished difference Result 85 states and 140 transitions. 20.16/8.95 [2019-03-28 12:39:33,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.16/8.95 [2019-03-28 12:39:33,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 20.16/8.95 [2019-03-28 12:39:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.16/8.95 [2019-03-28 12:39:33,903 INFO L225 Difference]: With dead ends: 85 20.16/8.95 [2019-03-28 12:39:33,903 INFO L226 Difference]: Without dead ends: 45 20.16/8.95 [2019-03-28 12:39:33,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.16/8.95 [2019-03-28 12:39:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 20.16/8.95 [2019-03-28 12:39:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. 20.16/8.95 [2019-03-28 12:39:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 20.16/8.95 [2019-03-28 12:39:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. 20.16/8.95 [2019-03-28 12:39:33,909 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 9 20.16/8.95 [2019-03-28 12:39:33,909 INFO L84 Accepts]: Finished accepts. word is rejected. 20.16/8.95 [2019-03-28 12:39:33,909 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. 20.16/8.95 [2019-03-28 12:39:33,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 20.16/8.95 [2019-03-28 12:39:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. 20.16/8.95 [2019-03-28 12:39:33,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 20.16/8.95 [2019-03-28 12:39:33,910 INFO L394 BasicCegarLoop]: Found error trace 20.16/8.95 [2019-03-28 12:39:33,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:33,910 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 20.16/8.95 [2019-03-28 12:39:33,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:33,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1307403252, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:33,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:33,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:33,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.16/8.95 [2019-03-28 12:39:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.16/8.95 [2019-03-28 12:39:33,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.16/8.95 [2019-03-28 12:39:33,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.16/8.95 [2019-03-28 12:39:33,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 20.16/8.95 [2019-03-28 12:39:33,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 20.16/8.95 [2019-03-28 12:39:33,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 20.16/8.95 [2019-03-28 12:39:33,950 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 4 states. 20.16/8.95 [2019-03-28 12:39:34,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.16/8.95 [2019-03-28 12:39:34,046 INFO L93 Difference]: Finished difference Result 45 states and 72 transitions. 20.16/8.95 [2019-03-28 12:39:34,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 20.16/8.95 [2019-03-28 12:39:34,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 20.16/8.95 [2019-03-28 12:39:34,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.16/8.95 [2019-03-28 12:39:34,047 INFO L225 Difference]: With dead ends: 45 20.16/8.95 [2019-03-28 12:39:34,047 INFO L226 Difference]: Without dead ends: 39 20.16/8.95 [2019-03-28 12:39:34,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 20.16/8.95 [2019-03-28 12:39:34,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. 20.16/8.95 [2019-03-28 12:39:34,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. 20.16/8.95 [2019-03-28 12:39:34,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 20.16/8.95 [2019-03-28 12:39:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 60 transitions. 20.16/8.95 [2019-03-28 12:39:34,052 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 60 transitions. Word has length 11 20.16/8.95 [2019-03-28 12:39:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. 20.16/8.95 [2019-03-28 12:39:34,052 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 60 transitions. 20.16/8.95 [2019-03-28 12:39:34,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 20.16/8.95 [2019-03-28 12:39:34,053 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 60 transitions. 20.16/8.95 [2019-03-28 12:39:34,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 20.16/8.95 [2019-03-28 12:39:34,053 INFO L394 BasicCegarLoop]: Found error trace 20.16/8.95 [2019-03-28 12:39:34,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:34,053 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 20.16/8.95 [2019-03-28 12:39:34,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:34,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1307403254, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:34,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:34,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:34,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.16/8.95 [2019-03-28 12:39:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.16/8.95 [2019-03-28 12:39:34,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.16/8.95 [2019-03-28 12:39:34,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.16/8.95 [2019-03-28 12:39:34,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 20.16/8.95 [2019-03-28 12:39:34,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 20.16/8.95 [2019-03-28 12:39:34,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 20.16/8.95 [2019-03-28 12:39:34,105 INFO L87 Difference]: Start difference. First operand 39 states and 60 transitions. Second operand 4 states. 20.16/8.95 [2019-03-28 12:39:34,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.16/8.95 [2019-03-28 12:39:34,205 INFO L93 Difference]: Finished difference Result 39 states and 60 transitions. 20.16/8.95 [2019-03-28 12:39:34,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 20.16/8.95 [2019-03-28 12:39:34,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 20.16/8.95 [2019-03-28 12:39:34,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.16/8.95 [2019-03-28 12:39:34,206 INFO L225 Difference]: With dead ends: 39 20.16/8.95 [2019-03-28 12:39:34,206 INFO L226 Difference]: Without dead ends: 32 20.16/8.95 [2019-03-28 12:39:34,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 20.16/8.95 [2019-03-28 12:39:34,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 20.16/8.95 [2019-03-28 12:39:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 20.16/8.95 [2019-03-28 12:39:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 20.16/8.95 [2019-03-28 12:39:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. 20.16/8.95 [2019-03-28 12:39:34,210 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 11 20.16/8.95 [2019-03-28 12:39:34,210 INFO L84 Accepts]: Finished accepts. word is rejected. 20.16/8.95 [2019-03-28 12:39:34,210 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. 20.16/8.95 [2019-03-28 12:39:34,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 20.16/8.95 [2019-03-28 12:39:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. 20.16/8.95 [2019-03-28 12:39:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 20.16/8.95 [2019-03-28 12:39:34,211 INFO L394 BasicCegarLoop]: Found error trace 20.16/8.95 [2019-03-28 12:39:34,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:34,211 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 20.16/8.95 [2019-03-28 12:39:34,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:34,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1874792366, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:34,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:34,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:34,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.16/8.95 [2019-03-28 12:39:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.16/8.95 [2019-03-28 12:39:34,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.16/8.95 [2019-03-28 12:39:34,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.16/8.95 [2019-03-28 12:39:34,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 20.16/8.95 [2019-03-28 12:39:34,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 20.16/8.95 [2019-03-28 12:39:34,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 20.16/8.95 [2019-03-28 12:39:34,246 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 4 states. 20.16/8.95 [2019-03-28 12:39:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.16/8.95 [2019-03-28 12:39:34,313 INFO L93 Difference]: Finished difference Result 32 states and 47 transitions. 20.16/8.95 [2019-03-28 12:39:34,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 20.16/8.95 [2019-03-28 12:39:34,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 20.16/8.95 [2019-03-28 12:39:34,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.16/8.95 [2019-03-28 12:39:34,314 INFO L225 Difference]: With dead ends: 32 20.16/8.95 [2019-03-28 12:39:34,314 INFO L226 Difference]: Without dead ends: 27 20.16/8.95 [2019-03-28 12:39:34,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 20.16/8.95 [2019-03-28 12:39:34,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 20.16/8.95 [2019-03-28 12:39:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 20.16/8.95 [2019-03-28 12:39:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 20.16/8.95 [2019-03-28 12:39:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. 20.16/8.95 [2019-03-28 12:39:34,318 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 12 20.16/8.95 [2019-03-28 12:39:34,318 INFO L84 Accepts]: Finished accepts. word is rejected. 20.16/8.95 [2019-03-28 12:39:34,318 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. 20.16/8.95 [2019-03-28 12:39:34,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 20.16/8.95 [2019-03-28 12:39:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. 20.16/8.95 [2019-03-28 12:39:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 20.16/8.95 [2019-03-28 12:39:34,319 INFO L394 BasicCegarLoop]: Found error trace 20.16/8.95 [2019-03-28 12:39:34,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:34,319 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 20.16/8.95 [2019-03-28 12:39:34,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:34,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1874792368, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:34,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:34,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:34,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.16/8.95 [2019-03-28 12:39:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.16/8.95 [2019-03-28 12:39:34,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.16/8.95 [2019-03-28 12:39:34,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.16/8.95 [2019-03-28 12:39:34,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 20.16/8.95 [2019-03-28 12:39:34,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 20.16/8.95 [2019-03-28 12:39:34,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 20.16/8.95 [2019-03-28 12:39:34,367 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. 20.16/8.95 [2019-03-28 12:39:34,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.16/8.95 [2019-03-28 12:39:34,430 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. 20.16/8.95 [2019-03-28 12:39:34,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 20.16/8.95 [2019-03-28 12:39:34,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 20.16/8.95 [2019-03-28 12:39:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.16/8.95 [2019-03-28 12:39:34,445 INFO L225 Difference]: With dead ends: 27 20.16/8.95 [2019-03-28 12:39:34,445 INFO L226 Difference]: Without dead ends: 0 20.16/8.95 [2019-03-28 12:39:34,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 20.16/8.95 [2019-03-28 12:39:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 20.16/8.95 [2019-03-28 12:39:34,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 20.16/8.95 [2019-03-28 12:39:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 20.16/8.95 [2019-03-28 12:39:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 20.16/8.95 [2019-03-28 12:39:34,447 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 20.16/8.95 [2019-03-28 12:39:34,447 INFO L84 Accepts]: Finished accepts. word is rejected. 20.16/8.95 [2019-03-28 12:39:34,447 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 20.16/8.95 [2019-03-28 12:39:34,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 20.16/8.95 [2019-03-28 12:39:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 20.16/8.95 [2019-03-28 12:39:34,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 20.16/8.95 [2019-03-28 12:39:34,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 20.16/8.95 [2019-03-28 12:39:34,527 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,528 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,528 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,528 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 23) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,528 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,528 INFO L444 ceAbstractionStarter]: At program point L19-4(lines 18 24) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_main_~y1~0.base)) (= 1 (select |#valid| ULTIMATE.start_gcd_~y2.base)) (= 4 (select |#length| ULTIMATE.start_gcd_~y2.base)) (= (select |#length| ULTIMATE.start_main_~y1~0.base) 4) (= 0 ULTIMATE.start_main_~y2~0.offset) (= 4 (select |#length| ULTIMATE.start_gcd_~y1.base)) (= 0 ULTIMATE.start_gcd_~y1.offset) (= (select |#valid| ULTIMATE.start_gcd_~y1.base) 1) (= 0 ULTIMATE.start_main_~y1~0.offset) (= ULTIMATE.start_gcd_~y2.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~y2~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~y2~0.base))) 20.16/8.95 [2019-03-28 12:39:34,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,530 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,530 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,530 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,530 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,530 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,530 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,530 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,530 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,531 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,531 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,531 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,531 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,531 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,531 INFO L448 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,531 INFO L448 ceAbstractionStarter]: For program point L33-2(line 33) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,531 INFO L448 ceAbstractionStarter]: For program point L33-3(line 33) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,532 INFO L448 ceAbstractionStarter]: For program point L33-4(line 33) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,532 INFO L448 ceAbstractionStarter]: For program point L33-6(lines 33 35) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,532 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,532 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,532 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,532 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,532 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,532 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,533 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,533 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,533 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,533 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,533 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,533 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,533 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,533 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,533 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,534 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,534 INFO L448 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,534 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,534 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,534 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 18 24) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,534 INFO L448 ceAbstractionStarter]: For program point L18-4(lines 18 24) no Hoare annotation was computed. 20.16/8.95 [2019-03-28 12:39:34,535 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 20.16/8.95 [2019-03-28 12:39:34,549 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 [2019-03-28 12:39:34,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 [2019-03-28 12:39:34,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 [2019-03-28 12:39:34,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 [2019-03-28 12:39:34,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 [2019-03-28 12:39:34,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 [2019-03-28 12:39:34,558 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 [2019-03-28 12:39:34,558 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 [2019-03-28 12:39:34,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:34 BasicIcfg 20.16/8.95 [2019-03-28 12:39:34,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 20.16/8.95 [2019-03-28 12:39:34,561 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 20.16/8.95 [2019-03-28 12:39:34,562 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 20.16/8.95 [2019-03-28 12:39:34,565 INFO L276 PluginConnector]: BuchiAutomizer initialized 20.16/8.95 [2019-03-28 12:39:34,566 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.16/8.95 [2019-03-28 12:39:34,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:39:31" (1/5) ... 20.16/8.95 [2019-03-28 12:39:34,567 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f0b3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:39:34, skipping insertion in model container 20.16/8.95 [2019-03-28 12:39:34,567 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.16/8.95 [2019-03-28 12:39:34,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:31" (2/5) ... 20.16/8.95 [2019-03-28 12:39:34,567 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f0b3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:39:34, skipping insertion in model container 20.16/8.95 [2019-03-28 12:39:34,567 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.16/8.95 [2019-03-28 12:39:34,568 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:32" (3/5) ... 20.16/8.95 [2019-03-28 12:39:34,568 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f0b3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:34, skipping insertion in model container 20.16/8.95 [2019-03-28 12:39:34,568 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.16/8.95 [2019-03-28 12:39:34,568 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:39:32" (4/5) ... 20.16/8.95 [2019-03-28 12:39:34,568 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f0b3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:34, skipping insertion in model container 20.16/8.95 [2019-03-28 12:39:34,568 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.16/8.95 [2019-03-28 12:39:34,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:34" (5/5) ... 20.16/8.95 [2019-03-28 12:39:34,570 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.16/8.95 [2019-03-28 12:39:34,592 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.16/8.95 [2019-03-28 12:39:34,593 INFO L374 BuchiCegarLoop]: Interprodecural is true 20.16/8.95 [2019-03-28 12:39:34,593 INFO L375 BuchiCegarLoop]: Hoare is true 20.16/8.95 [2019-03-28 12:39:34,593 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 20.16/8.95 [2019-03-28 12:39:34,593 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 20.16/8.95 [2019-03-28 12:39:34,593 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.16/8.95 [2019-03-28 12:39:34,593 INFO L379 BuchiCegarLoop]: Difference is false 20.16/8.95 [2019-03-28 12:39:34,593 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 20.16/8.95 [2019-03-28 12:39:34,593 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 20.16/8.95 [2019-03-28 12:39:34,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. 20.16/8.95 [2019-03-28 12:39:34,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 20.16/8.95 [2019-03-28 12:39:34,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.16/8.95 [2019-03-28 12:39:34,604 INFO L119 BuchiIsEmpty]: Starting construction of run 20.16/8.95 [2019-03-28 12:39:34,608 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:34,609 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:34,609 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 20.16/8.95 [2019-03-28 12:39:34,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. 20.16/8.95 [2019-03-28 12:39:34,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 20.16/8.95 [2019-03-28 12:39:34,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.16/8.95 [2019-03-28 12:39:34,611 INFO L119 BuchiIsEmpty]: Starting construction of run 20.16/8.95 [2019-03-28 12:39:34,612 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:34,612 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:34,617 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue [136] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 11#L-1true [196] L-1-->L31: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc10.base_1| 0) (< |v_ULTIMATE.start_main_#t~malloc9.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc9.base_1| 4) |v_ULTIMATE.start_main_#t~malloc10.base_1| 4)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1|) 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1|) 0) (= |v_ULTIMATE.start_main_#t~malloc9.offset_1| 0) (= v_ULTIMATE.start_main_~y2~0.offset_1 |v_ULTIMATE.start_main_#t~malloc10.offset_1|) (= v_ULTIMATE.start_main_~y1~0.offset_1 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (= v_ULTIMATE.start_main_~y1~0.base_1 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= v_ULTIMATE.start_main_~y2~0.base_1 |v_ULTIMATE.start_main_#t~malloc10.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_1, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_1|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_1, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~y2~0.base, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_~y1~0.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_~y1~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~short15, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~y2~0.offset, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~malloc10.offset] 52#L31true [263] L31-->L32: Formula: (and (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y1~0.base_11 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y1~0.base_11) v_ULTIMATE.start_main_~y1~0.offset_9 |v_ULTIMATE.start_main_#t~nondet11_5|)) |v_#memory_int_20|) (<= 0 v_ULTIMATE.start_main_~y1~0.offset_9) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~y1~0.base_11)) (<= (+ v_ULTIMATE.start_main_~y1~0.offset_9 4) (select |v_#length_34| v_ULTIMATE.start_main_~y1~0.base_11))) InVars {ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_9, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_11, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_9, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_11, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, #memory_int] 13#L32true [264] L32-->L33: Formula: (and (<= 0 v_ULTIMATE.start_main_~y2~0.offset_9) (<= (+ v_ULTIMATE.start_main_~y2~0.offset_9 4) (select |v_#length_35| v_ULTIMATE.start_main_~y2~0.base_11)) (= 1 (select |v_#valid_40| v_ULTIMATE.start_main_~y2~0.base_11)) (= (store |v_#memory_int_23| v_ULTIMATE.start_main_~y2~0.base_11 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~y2~0.base_11) v_ULTIMATE.start_main_~y2~0.offset_9 |v_ULTIMATE.start_main_#t~nondet12_5|)) |v_#memory_int_22|)) InVars {ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_11, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_9} OutVars{ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_11, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12, #memory_int] 32#L33true [141] L33-->L33-1: Formula: (and (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~y1~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y1~0.base_7) v_ULTIMATE.start_main_~y1~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y1~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y1~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~y1~0.base_7))) InVars {ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_7, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_6, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_6, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, #valid=|v_#valid_10|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_7, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 30#L33-1true [210] L33-1-->L33-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~mem13_3|) (not |v_ULTIMATE.start_main_#t~short15_2|)) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short15] 27#L33-2true [132] L33-2-->L33-6: Formula: (not |v_ULTIMATE.start_main_#t~short15_5|) InVars {ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_5|} OutVars{ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_5|} AuxVars[] AssignedVars[] 5#L33-6true [93] L33-6-->L19-4: Formula: (and |v_ULTIMATE.start_main_#t~short15_7| (= |v_ULTIMATE.start_gcd_#in~y1.base_1| v_ULTIMATE.start_main_~y1~0.base_10) (= |v_ULTIMATE.start_gcd_#in~y1.offset_1| v_ULTIMATE.start_main_~y1~0.offset_8) (= v_ULTIMATE.start_gcd_~y1.offset_1 |v_ULTIMATE.start_gcd_#in~y1.offset_1|) (= v_ULTIMATE.start_gcd_~y2.offset_1 |v_ULTIMATE.start_gcd_#in~y2.offset_1|) (= v_ULTIMATE.start_gcd_~y2.base_1 |v_ULTIMATE.start_gcd_#in~y2.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2.offset_1| v_ULTIMATE.start_main_~y2~0.offset_8) (= v_ULTIMATE.start_gcd_~y1.base_1 |v_ULTIMATE.start_gcd_#in~y1.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2.base_1| v_ULTIMATE.start_main_~y2~0.base_10)) InVars {ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_10, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_8, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_8, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_10, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_7|} OutVars{ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_10, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_1, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_1, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_8, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_1|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_1|, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_1|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_6|, ULTIMATE.start_gcd_#in~y2.offset=|v_ULTIMATE.start_gcd_#in~y2.offset_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_gcd_#in~y1.base=|v_ULTIMATE.start_gcd_#in~y1.base_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|, ULTIMATE.start_gcd_#in~y1.offset=|v_ULTIMATE.start_gcd_#in~y1.offset_1|, ULTIMATE.start_gcd_#in~y2.base=|v_ULTIMATE.start_gcd_#in~y2.base_1|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_10, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_1, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_1, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#in~y1.base, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_gcd_#in~y1.offset, ULTIMATE.start_gcd_#in~y2.base, ULTIMATE.start_gcd_~y2.base, ULTIMATE.start_gcd_~y1.base, ULTIMATE.start_gcd_~y1.offset, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~mem1, ULTIMATE.start_gcd_#t~mem0, ULTIMATE.start_gcd_#res, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_~y2.offset, ULTIMATE.start_gcd_#t~mem2, ULTIMATE.start_main_#t~short15, ULTIMATE.start_gcd_#in~y2.offset, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_main_#t~mem14] 20#L19-4true 20.16/8.95 [2019-03-28 12:39:34,618 INFO L796 eck$LassoCheckResult]: Loop: 20#L19-4true [120] L19-4-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1.offset_3) (= 1 (select |v_#valid_14| v_ULTIMATE.start_gcd_~y1.base_3)) (= |v_ULTIMATE.start_gcd_#t~mem0_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_gcd_~y1.base_3) v_ULTIMATE.start_gcd_~y1.offset_3)) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_gcd_~y1.base_3))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_3, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_3, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_3, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem0] 6#L18-1true [95] L18-1-->L18-2: Formula: (and (= (select |v_#valid_16| v_ULTIMATE.start_gcd_~y2.base_3) 1) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_3 4) (select |v_#length_14| v_ULTIMATE.start_gcd_~y2.base_3)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_3) (= |v_ULTIMATE.start_gcd_#t~mem1_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_gcd_~y2.base_3) v_ULTIMATE.start_gcd_~y2.offset_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_3, #length=|v_#length_14|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_3, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_3, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_3, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem1] 4#L18-2true [229] L18-2-->L19: Formula: (< |v_ULTIMATE.start_gcd_#t~mem1_6| |v_ULTIMATE.start_gcd_#t~mem0_6|) InVars {ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_6|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_6|} OutVars{ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_5|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem1, ULTIMATE.start_gcd_#t~mem0] 25#L19true [128] L19-->L19-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y1.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_gcd_~y1.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem2_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_gcd_~y1.base_6) v_ULTIMATE.start_gcd_~y1.offset_5)) (<= 0 v_ULTIMATE.start_gcd_~y1.offset_5) (= (select |v_#valid_18| v_ULTIMATE.start_gcd_~y1.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_6, #length=|v_#length_16|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_5, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_6, #length=|v_#length_16|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem2] 24#L19-1true [125] L19-1-->L19-2: Formula: (and (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_gcd_~y2.base_6) v_ULTIMATE.start_gcd_~y2.offset_5)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_5) (= 1 (select |v_#valid_20| v_ULTIMATE.start_gcd_~y2.base_6)) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_gcd_~y2.base_6))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_6, #length=|v_#length_18|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_5, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_5, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_6, #length=|v_#length_18|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 22#L19-2true [123] L19-2-->L20: Formula: (< |v_ULTIMATE.start_gcd_#t~mem3_4| |v_ULTIMATE.start_gcd_#t~mem2_4|) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_4|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_4|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_3|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~mem2] 42#L20true [152] L20-->L20-1: Formula: (and (= |v_ULTIMATE.start_gcd_#t~mem4_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_gcd_~y1.base_9) v_ULTIMATE.start_gcd_~y1.offset_7)) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_gcd_~y1.base_9)) (<= 0 v_ULTIMATE.start_gcd_~y1.offset_7) (= (select |v_#valid_22| v_ULTIMATE.start_gcd_~y1.base_9) 1)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_9, #length=|v_#length_20|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_9, #length=|v_#length_20|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem4] 41#L20-1true [148] L20-1-->L20-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y2.offset_7) (= |v_ULTIMATE.start_gcd_#t~mem5_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_gcd_~y2.base_9) v_ULTIMATE.start_gcd_~y2.offset_7)) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_gcd_~y2.base_9)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_gcd_~y2.base_9))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_9, #length=|v_#length_22|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_7, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_7, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_9, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 40#L20-2true [269] L20-2-->L19-4: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1.offset_17) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_17 4) (select |v_#length_38| v_ULTIMATE.start_gcd_~y1.base_23)) (= 1 (select |v_#valid_47| v_ULTIMATE.start_gcd_~y1.base_23)) (= (store |v_#memory_int_27| v_ULTIMATE.start_gcd_~y1.base_23 (store (select |v_#memory_int_27| v_ULTIMATE.start_gcd_~y1.base_23) v_ULTIMATE.start_gcd_~y1.offset_17 (+ (* (- 1) |v_ULTIMATE.start_gcd_#t~mem5_6|) |v_ULTIMATE.start_gcd_#t~mem4_6|))) |v_#memory_int_26|)) InVars {ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_6|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_6|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_23, #length=|v_#length_38|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_17} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_5|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_23, #length=|v_#length_38|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, #memory_int] 20#L19-4true 20.16/8.95 [2019-03-28 12:39:34,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:34,619 INFO L82 PathProgramCache]: Analyzing trace with hash 331327644, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:34,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:34,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.16/8.95 [2019-03-28 12:39:34,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.16/8.95 [2019-03-28 12:39:34,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.16/8.95 [2019-03-28 12:39:34,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.16/8.95 [2019-03-28 12:39:34,644 INFO L799 eck$LassoCheckResult]: stem already infeasible 20.16/8.95 [2019-03-28 12:39:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash 879239728, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:34,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:34,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:34,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.16/8.95 [2019-03-28 12:39:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.16/8.95 [2019-03-28 12:39:34,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.16/8.95 [2019-03-28 12:39:34,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.16/8.95 [2019-03-28 12:39:34,790 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. 20.16/8.95 [2019-03-28 12:39:34,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.16/8.95 [2019-03-28 12:39:34,903 INFO L93 Difference]: Finished difference Result 55 states and 92 transitions. 20.16/8.95 [2019-03-28 12:39:34,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.16/8.95 [2019-03-28 12:39:34,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 92 transitions. 20.16/8.95 [2019-03-28 12:39:34,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 20.16/8.95 [2019-03-28 12:39:34,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 22 states and 27 transitions. 20.16/8.95 [2019-03-28 12:39:34,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 20.16/8.95 [2019-03-28 12:39:34,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 20.16/8.95 [2019-03-28 12:39:34,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. 20.16/8.95 [2019-03-28 12:39:34,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.16/8.95 [2019-03-28 12:39:34,912 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. 20.16/8.95 [2019-03-28 12:39:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. 20.16/8.95 [2019-03-28 12:39:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 20.16/8.95 [2019-03-28 12:39:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 20.16/8.95 [2019-03-28 12:39:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. 20.16/8.95 [2019-03-28 12:39:34,914 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. 20.16/8.95 [2019-03-28 12:39:34,914 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. 20.16/8.95 [2019-03-28 12:39:34,915 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 20.16/8.95 [2019-03-28 12:39:34,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. 20.16/8.95 [2019-03-28 12:39:34,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 20.16/8.95 [2019-03-28 12:39:34,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.16/8.95 [2019-03-28 12:39:34,916 INFO L119 BuchiIsEmpty]: Starting construction of run 20.16/8.95 [2019-03-28 12:39:34,916 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:34,916 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:34,917 INFO L794 eck$LassoCheckResult]: Stem: 138#ULTIMATE.startENTRY [136] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 134#L-1 [196] L-1-->L31: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc10.base_1| 0) (< |v_ULTIMATE.start_main_#t~malloc9.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc9.base_1| 4) |v_ULTIMATE.start_main_#t~malloc10.base_1| 4)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1|) 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1|) 0) (= |v_ULTIMATE.start_main_#t~malloc9.offset_1| 0) (= v_ULTIMATE.start_main_~y2~0.offset_1 |v_ULTIMATE.start_main_#t~malloc10.offset_1|) (= v_ULTIMATE.start_main_~y1~0.offset_1 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (= v_ULTIMATE.start_main_~y1~0.base_1 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= v_ULTIMATE.start_main_~y2~0.base_1 |v_ULTIMATE.start_main_#t~malloc10.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_1, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_1|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_1, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~y2~0.base, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_~y1~0.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_~y1~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~short15, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~y2~0.offset, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~malloc10.offset] 131#L31 [263] L31-->L32: Formula: (and (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y1~0.base_11 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y1~0.base_11) v_ULTIMATE.start_main_~y1~0.offset_9 |v_ULTIMATE.start_main_#t~nondet11_5|)) |v_#memory_int_20|) (<= 0 v_ULTIMATE.start_main_~y1~0.offset_9) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~y1~0.base_11)) (<= (+ v_ULTIMATE.start_main_~y1~0.offset_9 4) (select |v_#length_34| v_ULTIMATE.start_main_~y1~0.base_11))) InVars {ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_9, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_11, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_9, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_11, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, #memory_int] 132#L32 [264] L32-->L33: Formula: (and (<= 0 v_ULTIMATE.start_main_~y2~0.offset_9) (<= (+ v_ULTIMATE.start_main_~y2~0.offset_9 4) (select |v_#length_35| v_ULTIMATE.start_main_~y2~0.base_11)) (= 1 (select |v_#valid_40| v_ULTIMATE.start_main_~y2~0.base_11)) (= (store |v_#memory_int_23| v_ULTIMATE.start_main_~y2~0.base_11 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~y2~0.base_11) v_ULTIMATE.start_main_~y2~0.offset_9 |v_ULTIMATE.start_main_#t~nondet12_5|)) |v_#memory_int_22|)) InVars {ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_11, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_9} OutVars{ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_11, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12, #memory_int] 136#L33 [141] L33-->L33-1: Formula: (and (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~y1~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y1~0.base_7) v_ULTIMATE.start_main_~y1~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y1~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y1~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~y1~0.base_7))) InVars {ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_7, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_6, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_6, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, #valid=|v_#valid_10|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_7, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 137#L33-1 [209] L33-1-->L33-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem13_3|) |v_ULTIMATE.start_main_#t~short15_2|) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short15] 133#L33-2 [131] L33-2-->L33-3: Formula: |v_ULTIMATE.start_main_#t~short15_3| InVars {ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_3|} OutVars{ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_3|} AuxVars[] AssignedVars[] 129#L33-3 [100] L33-3-->L33-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y2~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem14_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~y2~0.base_7) v_ULTIMATE.start_main_~y2~0.offset_6)) (= (select |v_#valid_12| v_ULTIMATE.start_main_~y2~0.base_7) 1) (<= (+ v_ULTIMATE.start_main_~y2~0.offset_6 4) (select |v_#length_10| v_ULTIMATE.start_main_~y2~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_6, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_7, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_7, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_6, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 127#L33-4 [216] L33-4-->L33-6: Formula: (and |v_ULTIMATE.start_main_#t~short15_4| (<= 0 |v_ULTIMATE.start_main_#t~mem14_3|)) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short15] 121#L33-6 [93] L33-6-->L19-4: Formula: (and |v_ULTIMATE.start_main_#t~short15_7| (= |v_ULTIMATE.start_gcd_#in~y1.base_1| v_ULTIMATE.start_main_~y1~0.base_10) (= |v_ULTIMATE.start_gcd_#in~y1.offset_1| v_ULTIMATE.start_main_~y1~0.offset_8) (= v_ULTIMATE.start_gcd_~y1.offset_1 |v_ULTIMATE.start_gcd_#in~y1.offset_1|) (= v_ULTIMATE.start_gcd_~y2.offset_1 |v_ULTIMATE.start_gcd_#in~y2.offset_1|) (= v_ULTIMATE.start_gcd_~y2.base_1 |v_ULTIMATE.start_gcd_#in~y2.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2.offset_1| v_ULTIMATE.start_main_~y2~0.offset_8) (= v_ULTIMATE.start_gcd_~y1.base_1 |v_ULTIMATE.start_gcd_#in~y1.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2.base_1| v_ULTIMATE.start_main_~y2~0.base_10)) InVars {ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_10, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_8, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_8, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_10, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_7|} OutVars{ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_10, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_1, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_1, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_8, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_1|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_1|, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_1|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_6|, ULTIMATE.start_gcd_#in~y2.offset=|v_ULTIMATE.start_gcd_#in~y2.offset_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_gcd_#in~y1.base=|v_ULTIMATE.start_gcd_#in~y1.base_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|, ULTIMATE.start_gcd_#in~y1.offset=|v_ULTIMATE.start_gcd_#in~y1.offset_1|, ULTIMATE.start_gcd_#in~y2.base=|v_ULTIMATE.start_gcd_#in~y2.base_1|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_10, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_1, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_1, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#in~y1.base, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_gcd_#in~y1.offset, ULTIMATE.start_gcd_#in~y2.base, ULTIMATE.start_gcd_~y2.base, ULTIMATE.start_gcd_~y1.base, ULTIMATE.start_gcd_~y1.offset, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~mem1, ULTIMATE.start_gcd_#t~mem0, ULTIMATE.start_gcd_#res, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_~y2.offset, ULTIMATE.start_gcd_#t~mem2, ULTIMATE.start_main_#t~short15, ULTIMATE.start_gcd_#in~y2.offset, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_main_#t~mem14] 117#L19-4 20.16/8.95 [2019-03-28 12:39:34,918 INFO L796 eck$LassoCheckResult]: Loop: 117#L19-4 [120] L19-4-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1.offset_3) (= 1 (select |v_#valid_14| v_ULTIMATE.start_gcd_~y1.base_3)) (= |v_ULTIMATE.start_gcd_#t~mem0_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_gcd_~y1.base_3) v_ULTIMATE.start_gcd_~y1.offset_3)) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_gcd_~y1.base_3))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_3, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_3, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_3, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem0] 118#L18-1 [95] L18-1-->L18-2: Formula: (and (= (select |v_#valid_16| v_ULTIMATE.start_gcd_~y2.base_3) 1) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_3 4) (select |v_#length_14| v_ULTIMATE.start_gcd_~y2.base_3)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_3) (= |v_ULTIMATE.start_gcd_#t~mem1_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_gcd_~y2.base_3) v_ULTIMATE.start_gcd_~y2.offset_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_3, #length=|v_#length_14|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_3, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_3, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_3, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem1] 119#L18-2 [229] L18-2-->L19: Formula: (< |v_ULTIMATE.start_gcd_#t~mem1_6| |v_ULTIMATE.start_gcd_#t~mem0_6|) InVars {ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_6|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_6|} OutVars{ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_5|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem1, ULTIMATE.start_gcd_#t~mem0] 120#L19 [128] L19-->L19-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y1.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_gcd_~y1.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem2_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_gcd_~y1.base_6) v_ULTIMATE.start_gcd_~y1.offset_5)) (<= 0 v_ULTIMATE.start_gcd_~y1.offset_5) (= (select |v_#valid_18| v_ULTIMATE.start_gcd_~y1.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_6, #length=|v_#length_16|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_5, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_6, #length=|v_#length_16|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem2] 126#L19-1 [125] L19-1-->L19-2: Formula: (and (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_gcd_~y2.base_6) v_ULTIMATE.start_gcd_~y2.offset_5)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_5) (= 1 (select |v_#valid_20| v_ULTIMATE.start_gcd_~y2.base_6)) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_gcd_~y2.base_6))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_6, #length=|v_#length_18|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_5, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_5, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_6, #length=|v_#length_18|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 122#L19-2 [180] L19-2-->L22: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem3_6| |v_ULTIMATE.start_gcd_#t~mem2_6|) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_6|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_6|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_5|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~mem2] 123#L22 [138] L22-->L22-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y2.offset_9 4) (select |v_#length_26| v_ULTIMATE.start_gcd_~y2.base_12)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_9) (= (select |v_#valid_28| v_ULTIMATE.start_gcd_~y2.base_12) 1) (= (select (select |v_#memory_int_15| v_ULTIMATE.start_gcd_~y2.base_12) v_ULTIMATE.start_gcd_~y2.offset_9) |v_ULTIMATE.start_gcd_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_12, #length=|v_#length_26|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_9, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_12, #length=|v_#length_26|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem6] 135#L22-1 [133] L22-1-->L22-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1.offset_11) (= |v_ULTIMATE.start_gcd_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_gcd_~y1.base_15) v_ULTIMATE.start_gcd_~y1.offset_11)) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_11 4) (select |v_#length_28| v_ULTIMATE.start_gcd_~y1.base_15)) (= 1 (select |v_#valid_30| v_ULTIMATE.start_gcd_~y1.base_15))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_15, #length=|v_#length_28|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_11, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_2|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_15, #length=|v_#length_28|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 130#L22-2 [270] L22-2-->L19-4: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_gcd_~y2.base_18) 1) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_13) (= (store |v_#memory_int_29| v_ULTIMATE.start_gcd_~y2.base_18 (store (select |v_#memory_int_29| v_ULTIMATE.start_gcd_~y2.base_18) v_ULTIMATE.start_gcd_~y2.offset_13 (+ |v_ULTIMATE.start_gcd_#t~mem6_6| (* (- 1) |v_ULTIMATE.start_gcd_#t~mem7_6|)))) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_13 4) (select |v_#length_39| v_ULTIMATE.start_gcd_~y2.base_18))) InVars {ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_6|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_6|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_13, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_18, #length=|v_#length_39|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_5|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_5|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_13, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_18, #length=|v_#length_39|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, #memory_int] 117#L19-4 20.16/8.95 [2019-03-28 12:39:34,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:34,918 INFO L82 PathProgramCache]: Analyzing trace with hash 577346184, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:34,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:34,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:34,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.16/8.95 [2019-03-28 12:39:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.16/8.95 [2019-03-28 12:39:34,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:34,941 INFO L82 PathProgramCache]: Analyzing trace with hash 880923897, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:34,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:34,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:34,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.16/8.95 [2019-03-28 12:39:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.16/8.95 [2019-03-28 12:39:34,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.16/8.95 [2019-03-28 12:39:34,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 20.16/8.95 [2019-03-28 12:39:34,991 INFO L811 eck$LassoCheckResult]: loop already infeasible 20.16/8.95 [2019-03-28 12:39:34,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 20.16/8.95 [2019-03-28 12:39:34,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 20.16/8.95 [2019-03-28 12:39:34,992 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 6 Second operand 7 states. 20.16/8.95 [2019-03-28 12:39:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.16/8.95 [2019-03-28 12:39:35,114 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. 20.16/8.95 [2019-03-28 12:39:35,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 20.16/8.95 [2019-03-28 12:39:35,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. 20.16/8.95 [2019-03-28 12:39:35,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 20.16/8.95 [2019-03-28 12:39:35,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 33 transitions. 20.16/8.95 [2019-03-28 12:39:35,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 20.16/8.95 [2019-03-28 12:39:35,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 20.16/8.95 [2019-03-28 12:39:35,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. 20.16/8.95 [2019-03-28 12:39:35,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.16/8.95 [2019-03-28 12:39:35,117 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. 20.16/8.95 [2019-03-28 12:39:35,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. 20.16/8.95 [2019-03-28 12:39:35,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. 20.16/8.95 [2019-03-28 12:39:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 20.16/8.95 [2019-03-28 12:39:35,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. 20.16/8.95 [2019-03-28 12:39:35,119 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. 20.16/8.95 [2019-03-28 12:39:35,119 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. 20.16/8.95 [2019-03-28 12:39:35,119 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 20.16/8.95 [2019-03-28 12:39:35,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. 20.16/8.95 [2019-03-28 12:39:35,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 20.16/8.95 [2019-03-28 12:39:35,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.16/8.95 [2019-03-28 12:39:35,120 INFO L119 BuchiIsEmpty]: Starting construction of run 20.16/8.95 [2019-03-28 12:39:35,121 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:35,121 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 20.16/8.95 [2019-03-28 12:39:35,122 INFO L794 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY [136] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 195#L-1 [196] L-1-->L31: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc10.base_1| 0) (< |v_ULTIMATE.start_main_#t~malloc9.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc9.base_1| 4) |v_ULTIMATE.start_main_#t~malloc10.base_1| 4)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1|) 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1|) 0) (= |v_ULTIMATE.start_main_#t~malloc9.offset_1| 0) (= v_ULTIMATE.start_main_~y2~0.offset_1 |v_ULTIMATE.start_main_#t~malloc10.offset_1|) (= v_ULTIMATE.start_main_~y1~0.offset_1 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (= v_ULTIMATE.start_main_~y1~0.base_1 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= v_ULTIMATE.start_main_~y2~0.base_1 |v_ULTIMATE.start_main_#t~malloc10.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_1, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_1|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_1, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~y2~0.base, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_~y1~0.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_~y1~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~short15, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~y2~0.offset, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~malloc10.offset] 196#L31 [263] L31-->L32: Formula: (and (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y1~0.base_11 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y1~0.base_11) v_ULTIMATE.start_main_~y1~0.offset_9 |v_ULTIMATE.start_main_#t~nondet11_5|)) |v_#memory_int_20|) (<= 0 v_ULTIMATE.start_main_~y1~0.offset_9) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~y1~0.base_11)) (<= (+ v_ULTIMATE.start_main_~y1~0.offset_9 4) (select |v_#length_34| v_ULTIMATE.start_main_~y1~0.base_11))) InVars {ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_9, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_11, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_9, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_11, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, #memory_int] 197#L32 [264] L32-->L33: Formula: (and (<= 0 v_ULTIMATE.start_main_~y2~0.offset_9) (<= (+ v_ULTIMATE.start_main_~y2~0.offset_9 4) (select |v_#length_35| v_ULTIMATE.start_main_~y2~0.base_11)) (= 1 (select |v_#valid_40| v_ULTIMATE.start_main_~y2~0.base_11)) (= (store |v_#memory_int_23| v_ULTIMATE.start_main_~y2~0.base_11 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~y2~0.base_11) v_ULTIMATE.start_main_~y2~0.offset_9 |v_ULTIMATE.start_main_#t~nondet12_5|)) |v_#memory_int_22|)) InVars {ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_11, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_9} OutVars{ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_11, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12, #memory_int] 201#L33 [141] L33-->L33-1: Formula: (and (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~y1~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y1~0.base_7) v_ULTIMATE.start_main_~y1~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y1~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y1~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~y1~0.base_7))) InVars {ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_7, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_6, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_6, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, #valid=|v_#valid_10|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_7, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 202#L33-1 [209] L33-1-->L33-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem13_3|) |v_ULTIMATE.start_main_#t~short15_2|) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short15] 198#L33-2 [131] L33-2-->L33-3: Formula: |v_ULTIMATE.start_main_#t~short15_3| InVars {ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_3|} OutVars{ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_3|} AuxVars[] AssignedVars[] 193#L33-3 [100] L33-3-->L33-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y2~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem14_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~y2~0.base_7) v_ULTIMATE.start_main_~y2~0.offset_6)) (= (select |v_#valid_12| v_ULTIMATE.start_main_~y2~0.base_7) 1) (<= (+ v_ULTIMATE.start_main_~y2~0.offset_6 4) (select |v_#length_10| v_ULTIMATE.start_main_~y2~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_6, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_7, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_7, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_6, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 191#L33-4 [216] L33-4-->L33-6: Formula: (and |v_ULTIMATE.start_main_#t~short15_4| (<= 0 |v_ULTIMATE.start_main_#t~mem14_3|)) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short15] 186#L33-6 [93] L33-6-->L19-4: Formula: (and |v_ULTIMATE.start_main_#t~short15_7| (= |v_ULTIMATE.start_gcd_#in~y1.base_1| v_ULTIMATE.start_main_~y1~0.base_10) (= |v_ULTIMATE.start_gcd_#in~y1.offset_1| v_ULTIMATE.start_main_~y1~0.offset_8) (= v_ULTIMATE.start_gcd_~y1.offset_1 |v_ULTIMATE.start_gcd_#in~y1.offset_1|) (= v_ULTIMATE.start_gcd_~y2.offset_1 |v_ULTIMATE.start_gcd_#in~y2.offset_1|) (= v_ULTIMATE.start_gcd_~y2.base_1 |v_ULTIMATE.start_gcd_#in~y2.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2.offset_1| v_ULTIMATE.start_main_~y2~0.offset_8) (= v_ULTIMATE.start_gcd_~y1.base_1 |v_ULTIMATE.start_gcd_#in~y1.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2.base_1| v_ULTIMATE.start_main_~y2~0.base_10)) InVars {ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_10, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_8, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_8, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_10, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_7|} OutVars{ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_10, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_1, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_1, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_8, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_1|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_1|, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_1|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_6|, ULTIMATE.start_gcd_#in~y2.offset=|v_ULTIMATE.start_gcd_#in~y2.offset_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_gcd_#in~y1.base=|v_ULTIMATE.start_gcd_#in~y1.base_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|, ULTIMATE.start_gcd_#in~y1.offset=|v_ULTIMATE.start_gcd_#in~y1.offset_1|, ULTIMATE.start_gcd_#in~y2.base=|v_ULTIMATE.start_gcd_#in~y2.base_1|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_10, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_1, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_1, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#in~y1.base, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_gcd_#in~y1.offset, ULTIMATE.start_gcd_#in~y2.base, ULTIMATE.start_gcd_~y2.base, ULTIMATE.start_gcd_~y1.base, ULTIMATE.start_gcd_~y1.offset, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~mem1, ULTIMATE.start_gcd_#t~mem0, ULTIMATE.start_gcd_#res, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_~y2.offset, ULTIMATE.start_gcd_#t~mem2, ULTIMATE.start_main_#t~short15, ULTIMATE.start_gcd_#in~y2.offset, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_main_#t~mem14] 181#L19-4 20.16/8.95 [2019-03-28 12:39:35,123 INFO L796 eck$LassoCheckResult]: Loop: 181#L19-4 [120] L19-4-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1.offset_3) (= 1 (select |v_#valid_14| v_ULTIMATE.start_gcd_~y1.base_3)) (= |v_ULTIMATE.start_gcd_#t~mem0_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_gcd_~y1.base_3) v_ULTIMATE.start_gcd_~y1.offset_3)) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_gcd_~y1.base_3))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_3, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_3, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_3, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem0] 182#L18-1 [95] L18-1-->L18-2: Formula: (and (= (select |v_#valid_16| v_ULTIMATE.start_gcd_~y2.base_3) 1) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_3 4) (select |v_#length_14| v_ULTIMATE.start_gcd_~y2.base_3)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_3) (= |v_ULTIMATE.start_gcd_#t~mem1_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_gcd_~y2.base_3) v_ULTIMATE.start_gcd_~y2.offset_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_3, #length=|v_#length_14|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_3, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_3, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_3, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem1] 183#L18-2 [229] L18-2-->L19: Formula: (< |v_ULTIMATE.start_gcd_#t~mem1_6| |v_ULTIMATE.start_gcd_#t~mem0_6|) InVars {ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_6|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_6|} OutVars{ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_5|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem1, ULTIMATE.start_gcd_#t~mem0] 184#L19 [128] L19-->L19-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y1.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_gcd_~y1.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem2_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_gcd_~y1.base_6) v_ULTIMATE.start_gcd_~y1.offset_5)) (<= 0 v_ULTIMATE.start_gcd_~y1.offset_5) (= (select |v_#valid_18| v_ULTIMATE.start_gcd_~y1.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_6, #length=|v_#length_16|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_5, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_6, #length=|v_#length_16|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem2] 189#L19-1 [125] L19-1-->L19-2: Formula: (and (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_gcd_~y2.base_6) v_ULTIMATE.start_gcd_~y2.offset_5)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_5) (= 1 (select |v_#valid_20| v_ULTIMATE.start_gcd_~y2.base_6)) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_gcd_~y2.base_6))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_6, #length=|v_#length_18|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_5, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_5, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_6, #length=|v_#length_18|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 187#L19-2 [123] L19-2-->L20: Formula: (< |v_ULTIMATE.start_gcd_#t~mem3_4| |v_ULTIMATE.start_gcd_#t~mem2_4|) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_4|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_4|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_3|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~mem2] 188#L20 [152] L20-->L20-1: Formula: (and (= |v_ULTIMATE.start_gcd_#t~mem4_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_gcd_~y1.base_9) v_ULTIMATE.start_gcd_~y1.offset_7)) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_gcd_~y1.base_9)) (<= 0 v_ULTIMATE.start_gcd_~y1.offset_7) (= (select |v_#valid_22| v_ULTIMATE.start_gcd_~y1.base_9) 1)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_9, #length=|v_#length_20|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_9, #length=|v_#length_20|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem4] 192#L20-1 [148] L20-1-->L20-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y2.offset_7) (= |v_ULTIMATE.start_gcd_#t~mem5_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_gcd_~y2.base_9) v_ULTIMATE.start_gcd_~y2.offset_7)) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_gcd_~y2.base_9)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_gcd_~y2.base_9))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_9, #length=|v_#length_22|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_7, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_7, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_9, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 190#L20-2 [269] L20-2-->L19-4: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1.offset_17) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_17 4) (select |v_#length_38| v_ULTIMATE.start_gcd_~y1.base_23)) (= 1 (select |v_#valid_47| v_ULTIMATE.start_gcd_~y1.base_23)) (= (store |v_#memory_int_27| v_ULTIMATE.start_gcd_~y1.base_23 (store (select |v_#memory_int_27| v_ULTIMATE.start_gcd_~y1.base_23) v_ULTIMATE.start_gcd_~y1.offset_17 (+ (* (- 1) |v_ULTIMATE.start_gcd_#t~mem5_6|) |v_ULTIMATE.start_gcd_#t~mem4_6|))) |v_#memory_int_26|)) InVars {ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_6|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_6|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_23, #length=|v_#length_38|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_17} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_5|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_23, #length=|v_#length_38|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, #memory_int] 181#L19-4 20.16/8.95 [2019-03-28 12:39:35,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:35,123 INFO L82 PathProgramCache]: Analyzing trace with hash 577346184, now seen corresponding path program 2 times 20.16/8.95 [2019-03-28 12:39:35,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:35,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:35,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:35,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:35,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.16/8.95 [2019-03-28 12:39:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.16/8.95 [2019-03-28 12:39:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:35,144 INFO L82 PathProgramCache]: Analyzing trace with hash 879239728, now seen corresponding path program 2 times 20.16/8.95 [2019-03-28 12:39:35,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:35,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:35,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:35,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:35,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.16/8.95 [2019-03-28 12:39:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.16/8.95 [2019-03-28 12:39:35,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.16/8.95 [2019-03-28 12:39:35,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1192857719, now seen corresponding path program 1 times 20.16/8.95 [2019-03-28 12:39:35,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.16/8.95 [2019-03-28 12:39:35,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.16/8.95 [2019-03-28 12:39:35,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:35,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:35,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.16/8.95 [2019-03-28 12:39:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.16/8.95 [2019-03-28 12:39:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.16/8.95 [2019-03-28 12:39:35,586 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 20.16/8.95 [2019-03-28 12:39:35,707 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 80 20.16/8.95 [2019-03-28 12:39:35,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:35 BasicIcfg 20.16/8.95 [2019-03-28 12:39:35,746 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 20.16/8.95 [2019-03-28 12:39:35,747 INFO L168 Benchmark]: Toolchain (without parser) took 4297.52 ms. Allocated memory was 649.6 MB in the beginning and 733.0 MB in the end (delta: 83.4 MB). Free memory was 558.2 MB in the beginning and 446.5 MB in the end (delta: 111.7 MB). Peak memory consumption was 195.1 MB. Max. memory is 50.3 GB. 20.16/8.95 [2019-03-28 12:39:35,748 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.16/8.95 [2019-03-28 12:39:35,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.52 ms. Allocated memory was 649.6 MB in the beginning and 655.9 MB in the end (delta: 6.3 MB). Free memory was 558.2 MB in the beginning and 622.6 MB in the end (delta: -64.4 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 20.16/8.95 [2019-03-28 12:39:35,749 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.02 ms. Allocated memory is still 655.9 MB. Free memory was 622.6 MB in the beginning and 618.7 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 20.16/8.95 [2019-03-28 12:39:35,749 INFO L168 Benchmark]: Boogie Preprocessor took 25.67 ms. Allocated memory is still 655.9 MB. Free memory was 618.7 MB in the beginning and 617.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 20.16/8.95 [2019-03-28 12:39:35,750 INFO L168 Benchmark]: RCFGBuilder took 392.11 ms. Allocated memory is still 655.9 MB. Free memory was 617.6 MB in the beginning and 589.0 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. 20.16/8.95 [2019-03-28 12:39:35,751 INFO L168 Benchmark]: BlockEncodingV2 took 161.62 ms. Allocated memory is still 655.9 MB. Free memory was 589.0 MB in the beginning and 577.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. 20.16/8.95 [2019-03-28 12:39:35,751 INFO L168 Benchmark]: TraceAbstraction took 2170.61 ms. Allocated memory was 655.9 MB in the beginning and 733.0 MB in the end (delta: 77.1 MB). Free memory was 577.1 MB in the beginning and 633.0 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 50.3 GB. 20.16/8.95 [2019-03-28 12:39:35,752 INFO L168 Benchmark]: BuchiAutomizer took 1185.06 ms. Allocated memory is still 733.0 MB. Free memory was 629.0 MB in the beginning and 446.5 MB in the end (delta: 182.5 MB). Peak memory consumption was 182.5 MB. Max. memory is 50.3 GB. 20.16/8.95 [2019-03-28 12:39:35,757 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 20.16/8.95 --- Results --- 20.16/8.95 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 20.16/8.95 - StatisticsResult: Initial Icfg 20.16/8.95 63 locations, 67 edges 20.16/8.95 - StatisticsResult: Encoded RCFG 20.16/8.95 53 locations, 91 edges 20.16/8.95 * Results from de.uni_freiburg.informatik.ultimate.core: 20.16/8.95 - StatisticsResult: Toolchain Benchmarks 20.16/8.95 Benchmark results are: 20.16/8.95 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.16/8.95 * CACSL2BoogieTranslator took 312.52 ms. Allocated memory was 649.6 MB in the beginning and 655.9 MB in the end (delta: 6.3 MB). Free memory was 558.2 MB in the beginning and 622.6 MB in the end (delta: -64.4 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 20.16/8.95 * Boogie Procedure Inliner took 44.02 ms. Allocated memory is still 655.9 MB. Free memory was 622.6 MB in the beginning and 618.7 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 20.16/8.95 * Boogie Preprocessor took 25.67 ms. Allocated memory is still 655.9 MB. Free memory was 618.7 MB in the beginning and 617.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 20.16/8.95 * RCFGBuilder took 392.11 ms. Allocated memory is still 655.9 MB. Free memory was 617.6 MB in the beginning and 589.0 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. 20.16/8.95 * BlockEncodingV2 took 161.62 ms. Allocated memory is still 655.9 MB. Free memory was 589.0 MB in the beginning and 577.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. 20.16/8.95 * TraceAbstraction took 2170.61 ms. Allocated memory was 655.9 MB in the beginning and 733.0 MB in the end (delta: 77.1 MB). Free memory was 577.1 MB in the beginning and 633.0 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 50.3 GB. 20.16/8.95 * BuchiAutomizer took 1185.06 ms. Allocated memory is still 733.0 MB. Free memory was 629.0 MB in the beginning and 446.5 MB in the end (delta: 182.5 MB). Peak memory consumption was 182.5 MB. Max. memory is 50.3 GB. 20.16/8.95 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 20.16/8.95 - GenericResult: Unfinished Backtranslation 20.16/8.95 unknown boogie variable #length 20.16/8.95 - GenericResult: Unfinished Backtranslation 20.16/8.95 unknown boogie variable #length 20.16/8.95 - GenericResult: Unfinished Backtranslation 20.16/8.95 unknown boogie variable #length 20.16/8.95 - GenericResult: Unfinished Backtranslation 20.16/8.95 unknown boogie variable #length 20.16/8.95 - GenericResult: Unfinished Backtranslation 20.16/8.95 unknown boogie variable #length 20.16/8.95 - GenericResult: Unfinished Backtranslation 20.16/8.95 unknown boogie variable #length 20.16/8.95 - GenericResult: Unfinished Backtranslation 20.16/8.95 unknown boogie variable #length 20.16/8.95 - GenericResult: Unfinished Backtranslation 20.16/8.95 unknown boogie variable #length 20.16/8.95 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 20.16/8.95 - PositiveResult [Line: 20]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 20]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 31]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 20]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 20]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 20]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 33]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 22]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 32]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 33]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 22]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 31]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 22]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 22]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 32]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 22]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 18]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 18]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 25]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 33]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 22]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 18]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 25]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 33]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 19]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 20]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 19]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 19]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 18]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - PositiveResult [Line: 19]: pointer dereference always succeeds 20.16/8.95 For all program executions holds that pointer dereference always succeeds at this location 20.16/8.95 - AllSpecificationsHoldResult: All specifications hold 20.16/8.95 30 specifications checked. All of them hold 20.16/8.95 - InvariantResult [Line: 18]: Loop Invariant 20.16/8.95 [2019-03-28 12:39:35,768 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 [2019-03-28 12:39:35,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 [2019-03-28 12:39:35,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 [2019-03-28 12:39:35,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 [2019-03-28 12:39:35,770 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 [2019-03-28 12:39:35,771 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 [2019-03-28 12:39:35,771 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 [2019-03-28 12:39:35,771 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.16/8.95 Derived loop invariant: ((((((((((1 == \valid[y1] && 1 == \valid[y2]) && 4 == unknown-#length-unknown[y2]) && unknown-#length-unknown[y1] == 4) && 0 == y2) && 4 == unknown-#length-unknown[y1]) && 0 == y1) && \valid[y1] == 1) && 0 == y1) && y2 == 0) && 4 == unknown-#length-unknown[y2]) && 1 == \valid[y2] 20.16/8.95 - StatisticsResult: Ultimate Automizer benchmark data 20.16/8.95 CFG has 1 procedures, 53 locations, 30 error locations. SAFE Result, 2.0s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 89 SDtfs, 618 SDslu, 146 SDs, 0 SdLazy, 792 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 53 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 3001 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 20.16/8.95 - StatisticsResult: Constructed decomposition of program 20.16/8.95 Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 25 locations. 20.16/8.95 - StatisticsResult: Timing statistics 20.16/8.95 BüchiAutomizer plugin needed 1.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 6 SDslu, 123 SDs, 0 SdLazy, 248 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 20.16/8.95 - TerminationAnalysisResult: Nontermination possible 20.16/8.95 Buchi Automizer proved that your program is nonterminating for some inputs 20.16/8.95 - FixpointNonTerminationResult [Line: 18]: Nontermination argument in form of an infinite program execution. 20.16/8.95 Nontermination argument in form of an infinite execution 20.16/8.95 State at position 0 is 20.16/8.95 {NULL=4107} 20.16/8.95 State at position 1 is 20.16/8.95 {NULL=0, \result=0, NULL=4107, y2=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23be8e0a=4106, \result=0, y2=0, y1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e58a9a1=0, y2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23be8e0a=0, y2=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33a5955c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@cee29dd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@4c756d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@112e56a1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@13b6febe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@40e437e3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@5ee14141=0, y1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@2db4555a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47e63e2c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@56592fe6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@580253b6=0, y2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@4111d1f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41b6cda0=0, y1=4106, y2=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@33cd68b1=0, y1=4106, y1=4106, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47e63e2c=-1, NULL=0, y1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@1e898299=0} 20.16/8.95 - StatisticsResult: NonterminationArgumentStatistics 20.16/8.95 Fixpoint 20.16/8.95 - NonterminatingLassoResult [Line: 18]: Nonterminating execution 20.16/8.95 Found a nonterminating execution for the following lasso shaped sequence of statements. 20.16/8.95 Stem: 20.16/8.95 [L29] int *y1 = alloca(sizeof(int)); 20.16/8.95 [L30] int *y2 = alloca(sizeof(int)); 20.16/8.95 [L31] *y1 = __VERIFIER_nondet_int() 20.16/8.95 [L32] *y2 = __VERIFIER_nondet_int() 20.16/8.95 [L33] EXPR \read(*y1) 20.16/8.95 [L33] *y1 >= 0 && *y2 >= 0 20.16/8.95 [L33] EXPR \read(*y2) 20.16/8.95 [L33] *y1 >= 0 && *y2 >= 0 20.16/8.95 [L33] COND TRUE *y1 >= 0 && *y2 >= 0 20.16/8.95 Loop: 20.16/8.95 [L18] EXPR \read(*y1) 20.16/8.95 [L18] EXPR \read(*y2) 20.16/8.95 [L18] COND TRUE *y1 != *y2 20.16/8.95 [L19] EXPR \read(*y1) 20.16/8.95 [L19] EXPR \read(*y2) 20.16/8.95 [L19] COND TRUE *y1 > *y2 20.16/8.95 [L20] EXPR \read(*y1) 20.16/8.95 [L20] EXPR \read(*y2) 20.16/8.95 [L20] *y1 = *y1 - *y2 20.16/8.95 End of lasso representation. 20.16/8.95 RESULT: Ultimate proved your program to be incorrect! 20.16/8.95 !SESSION 2019-03-28 12:39:28.122 ----------------------------------------------- 20.16/8.95 eclipse.buildId=unknown 20.16/8.95 java.version=1.8.0_181 20.16/8.95 java.vendor=Oracle Corporation 20.16/8.95 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 20.16/8.95 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 20.16/8.95 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 20.16/8.95 20.16/8.95 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:39:36.006 20.16/8.95 !MESSAGE The workspace will exit with unsaved changes in this session. 20.16/8.95 Received shutdown request... 20.16/8.95 Ultimate: 20.16/8.95 GTK+ Version Check 20.16/8.95 EOF