21.31/9.23 YES 21.31/9.23 21.31/9.23 Ultimate: Cannot open display: 21.31/9.23 This is Ultimate 0.1.24-8dc7c08-m 21.31/9.23 [2019-03-28 12:40:45,203 INFO L170 SettingsManager]: Resetting all preferences to default values... 21.31/9.23 [2019-03-28 12:40:45,205 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 21.31/9.23 [2019-03-28 12:40:45,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 21.31/9.23 [2019-03-28 12:40:45,217 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 21.31/9.23 [2019-03-28 12:40:45,218 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 21.31/9.23 [2019-03-28 12:40:45,219 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 21.31/9.23 [2019-03-28 12:40:45,221 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 21.31/9.23 [2019-03-28 12:40:45,222 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 21.31/9.23 [2019-03-28 12:40:45,223 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 21.31/9.23 [2019-03-28 12:40:45,224 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 21.31/9.23 [2019-03-28 12:40:45,224 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 21.31/9.23 [2019-03-28 12:40:45,225 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 21.31/9.23 [2019-03-28 12:40:45,226 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 21.31/9.23 [2019-03-28 12:40:45,227 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 21.31/9.23 [2019-03-28 12:40:45,227 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 21.31/9.23 [2019-03-28 12:40:45,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 21.31/9.23 [2019-03-28 12:40:45,230 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 21.31/9.23 [2019-03-28 12:40:45,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 21.31/9.23 [2019-03-28 12:40:45,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 21.31/9.23 [2019-03-28 12:40:45,234 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 21.31/9.23 [2019-03-28 12:40:45,235 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 21.31/9.23 [2019-03-28 12:40:45,237 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 21.31/9.23 [2019-03-28 12:40:45,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 21.31/9.23 [2019-03-28 12:40:45,238 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 21.31/9.23 [2019-03-28 12:40:45,239 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 21.31/9.23 [2019-03-28 12:40:45,239 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 21.31/9.23 [2019-03-28 12:40:45,240 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 21.31/9.23 [2019-03-28 12:40:45,240 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 21.31/9.23 [2019-03-28 12:40:45,241 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 21.31/9.23 [2019-03-28 12:40:45,241 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 21.31/9.23 [2019-03-28 12:40:45,242 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 21.31/9.23 [2019-03-28 12:40:45,243 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 21.31/9.23 [2019-03-28 12:40:45,243 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 21.31/9.23 [2019-03-28 12:40:45,244 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 21.31/9.23 [2019-03-28 12:40:45,244 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 21.31/9.23 [2019-03-28 12:40:45,244 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 21.31/9.23 [2019-03-28 12:40:45,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 21.31/9.23 [2019-03-28 12:40:45,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 21.31/9.23 [2019-03-28 12:40:45,246 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 21.31/9.23 [2019-03-28 12:40:45,261 INFO L110 SettingsManager]: Loading preferences was successful 21.31/9.23 [2019-03-28 12:40:45,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 21.31/9.23 [2019-03-28 12:40:45,262 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 21.31/9.23 [2019-03-28 12:40:45,262 INFO L133 SettingsManager]: * Rewrite not-equals=true 21.31/9.23 [2019-03-28 12:40:45,262 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 21.31/9.23 [2019-03-28 12:40:45,262 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 21.31/9.23 [2019-03-28 12:40:45,263 INFO L133 SettingsManager]: * Use SBE=true 21.31/9.23 [2019-03-28 12:40:45,263 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 21.31/9.23 [2019-03-28 12:40:45,263 INFO L133 SettingsManager]: * Use old map elimination=false 21.31/9.23 [2019-03-28 12:40:45,263 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 21.31/9.23 [2019-03-28 12:40:45,263 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 21.31/9.23 [2019-03-28 12:40:45,263 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 21.31/9.23 [2019-03-28 12:40:45,264 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 21.31/9.23 [2019-03-28 12:40:45,264 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 21.31/9.23 [2019-03-28 12:40:45,264 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.31/9.23 [2019-03-28 12:40:45,264 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 21.31/9.23 [2019-03-28 12:40:45,264 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 21.31/9.23 [2019-03-28 12:40:45,264 INFO L133 SettingsManager]: * Check division by zero=IGNORE 21.31/9.23 [2019-03-28 12:40:45,265 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 21.31/9.23 [2019-03-28 12:40:45,265 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 21.31/9.23 [2019-03-28 12:40:45,265 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 21.31/9.23 [2019-03-28 12:40:45,265 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 21.31/9.23 [2019-03-28 12:40:45,265 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 21.31/9.23 [2019-03-28 12:40:45,266 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 21.31/9.23 [2019-03-28 12:40:45,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 21.31/9.23 [2019-03-28 12:40:45,266 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 21.31/9.23 [2019-03-28 12:40:45,266 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 21.31/9.23 [2019-03-28 12:40:45,266 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 21.31/9.23 [2019-03-28 12:40:45,266 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 21.31/9.23 [2019-03-28 12:40:45,293 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 21.31/9.23 [2019-03-28 12:40:45,306 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 21.31/9.23 [2019-03-28 12:40:45,309 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 21.31/9.23 [2019-03-28 12:40:45,311 INFO L271 PluginConnector]: Initializing CDTParser... 21.31/9.23 [2019-03-28 12:40:45,311 INFO L276 PluginConnector]: CDTParser initialized 21.31/9.23 [2019-03-28 12:40:45,312 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 21.31/9.23 [2019-03-28 12:40:45,382 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/28ca4b5a137540f1a471e6c70853743e/FLAG6a88c342f 21.31/9.23 [2019-03-28 12:40:45,725 INFO L307 CDTParser]: Found 1 translation units. 21.31/9.23 [2019-03-28 12:40:45,726 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 21.31/9.23 [2019-03-28 12:40:45,726 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 21.31/9.23 [2019-03-28 12:40:45,733 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/28ca4b5a137540f1a471e6c70853743e/FLAG6a88c342f 21.31/9.23 [2019-03-28 12:40:46,121 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/28ca4b5a137540f1a471e6c70853743e 21.31/9.23 [2019-03-28 12:40:46,133 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 21.31/9.23 [2019-03-28 12:40:46,134 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 21.31/9.23 [2019-03-28 12:40:46,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 21.31/9.23 [2019-03-28 12:40:46,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 21.31/9.23 [2019-03-28 12:40:46,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 21.31/9.23 [2019-03-28 12:40:46,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:40:46" (1/1) ... 21.31/9.23 [2019-03-28 12:40:46,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@525b0348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:46, skipping insertion in model container 21.31/9.23 [2019-03-28 12:40:46,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:40:46" (1/1) ... 21.31/9.23 [2019-03-28 12:40:46,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 21.31/9.23 [2019-03-28 12:40:46,168 INFO L176 MainTranslator]: Built tables and reachable declarations 21.31/9.23 [2019-03-28 12:40:46,335 INFO L206 PostProcessor]: Analyzing one entry point: main 21.31/9.23 [2019-03-28 12:40:46,347 INFO L191 MainTranslator]: Completed pre-run 21.31/9.23 [2019-03-28 12:40:46,427 INFO L206 PostProcessor]: Analyzing one entry point: main 21.31/9.23 [2019-03-28 12:40:46,444 INFO L195 MainTranslator]: Completed translation 21.31/9.23 [2019-03-28 12:40:46,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:46 WrapperNode 21.31/9.23 [2019-03-28 12:40:46,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 21.31/9.23 [2019-03-28 12:40:46,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 21.31/9.23 [2019-03-28 12:40:46,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 21.31/9.23 [2019-03-28 12:40:46,446 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 21.31/9.23 [2019-03-28 12:40:46,456 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:40:46" (1/1) ... 21.31/9.23 [2019-03-28 12:40:46,465 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:40:46" (1/1) ... 21.31/9.23 [2019-03-28 12:40:46,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 21.31/9.23 [2019-03-28 12:40:46,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 21.31/9.23 [2019-03-28 12:40:46,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 21.31/9.23 [2019-03-28 12:40:46,489 INFO L276 PluginConnector]: Boogie Preprocessor initialized 21.31/9.23 [2019-03-28 12:40:46,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:46" (1/1) ... 21.31/9.23 [2019-03-28 12:40:46,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:46" (1/1) ... 21.31/9.23 [2019-03-28 12:40:46,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:46" (1/1) ... 21.31/9.23 [2019-03-28 12:40:46,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:46" (1/1) ... 21.31/9.23 [2019-03-28 12:40:46,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:46" (1/1) ... 21.31/9.23 [2019-03-28 12:40:46,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:46" (1/1) ... 21.31/9.23 [2019-03-28 12:40:46,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:46" (1/1) ... 21.31/9.23 [2019-03-28 12:40:46,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 21.31/9.23 [2019-03-28 12:40:46,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 21.31/9.23 [2019-03-28 12:40:46,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... 21.31/9.23 [2019-03-28 12:40:46,515 INFO L276 PluginConnector]: RCFGBuilder initialized 21.31/9.23 [2019-03-28 12:40:46,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:46" (1/1) ... 21.31/9.23 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.31/9.23 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 21.31/9.23 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 21.31/9.23 [2019-03-28 12:40:46,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 21.31/9.23 [2019-03-28 12:40:46,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 21.31/9.23 [2019-03-28 12:40:46,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 21.31/9.23 [2019-03-28 12:40:46,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 21.31/9.23 [2019-03-28 12:40:46,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 21.31/9.23 [2019-03-28 12:40:46,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 21.31/9.23 [2019-03-28 12:40:46,820 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 21.31/9.23 [2019-03-28 12:40:46,821 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 21.31/9.23 [2019-03-28 12:40:46,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:46 BoogieIcfgContainer 21.31/9.23 [2019-03-28 12:40:46,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 21.31/9.23 [2019-03-28 12:40:46,823 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 21.31/9.23 [2019-03-28 12:40:46,823 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 21.31/9.23 [2019-03-28 12:40:46,825 INFO L276 PluginConnector]: BlockEncodingV2 initialized 21.31/9.23 [2019-03-28 12:40:46,826 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:46" (1/1) ... 21.31/9.23 [2019-03-28 12:40:46,842 INFO L313 BlockEncoder]: Initial Icfg 23 locations, 27 edges 21.31/9.23 [2019-03-28 12:40:46,844 INFO L258 BlockEncoder]: Using Remove infeasible edges 21.31/9.23 [2019-03-28 12:40:46,844 INFO L263 BlockEncoder]: Using Maximize final states 21.31/9.23 [2019-03-28 12:40:46,845 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 21.31/9.23 [2019-03-28 12:40:46,845 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 21.31/9.23 [2019-03-28 12:40:46,847 INFO L296 BlockEncoder]: Using Remove sink states 21.31/9.23 [2019-03-28 12:40:46,848 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 21.31/9.23 [2019-03-28 12:40:46,848 INFO L179 BlockEncoder]: Using Rewrite not-equals 21.31/9.23 [2019-03-28 12:40:46,872 INFO L185 BlockEncoder]: Using Use SBE 21.31/9.23 [2019-03-28 12:40:46,897 INFO L200 BlockEncoder]: SBE split 7 edges 21.31/9.23 [2019-03-28 12:40:46,902 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 21.31/9.23 [2019-03-28 12:40:46,904 INFO L71 MaximizeFinalStates]: 0 new accepting states 21.31/9.23 [2019-03-28 12:40:46,951 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding 21.31/9.23 [2019-03-28 12:40:46,954 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 21.31/9.23 [2019-03-28 12:40:46,956 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 21.31/9.23 [2019-03-28 12:40:46,956 INFO L71 MaximizeFinalStates]: 0 new accepting states 21.31/9.23 [2019-03-28 12:40:46,956 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 21.31/9.23 [2019-03-28 12:40:46,957 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 21.31/9.23 [2019-03-28 12:40:46,957 INFO L313 BlockEncoder]: Encoded RCFG 14 locations, 23 edges 21.31/9.23 [2019-03-28 12:40:46,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:46 BasicIcfg 21.31/9.23 [2019-03-28 12:40:46,958 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 21.31/9.23 [2019-03-28 12:40:46,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 21.31/9.23 [2019-03-28 12:40:46,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... 21.31/9.23 [2019-03-28 12:40:46,962 INFO L276 PluginConnector]: TraceAbstraction initialized 21.31/9.23 [2019-03-28 12:40:46,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:40:46" (1/4) ... 21.31/9.23 [2019-03-28 12:40:46,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266fa23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:40:46, skipping insertion in model container 21.31/9.23 [2019-03-28 12:40:46,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:46" (2/4) ... 21.31/9.23 [2019-03-28 12:40:46,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266fa23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:40:46, skipping insertion in model container 21.31/9.23 [2019-03-28 12:40:46,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:46" (3/4) ... 21.31/9.23 [2019-03-28 12:40:46,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266fa23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:46, skipping insertion in model container 21.31/9.23 [2019-03-28 12:40:46,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:46" (4/4) ... 21.31/9.23 [2019-03-28 12:40:46,966 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 21.31/9.23 [2019-03-28 12:40:46,976 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 21.31/9.23 [2019-03-28 12:40:46,985 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. 21.31/9.23 [2019-03-28 12:40:47,002 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. 21.31/9.23 [2019-03-28 12:40:47,031 INFO L133 ementStrategyFactory]: Using default assertion order modulation 21.31/9.23 [2019-03-28 12:40:47,032 INFO L382 AbstractCegarLoop]: Interprodecural is true 21.31/9.23 [2019-03-28 12:40:47,032 INFO L383 AbstractCegarLoop]: Hoare is true 21.31/9.23 [2019-03-28 12:40:47,032 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 21.31/9.23 [2019-03-28 12:40:47,033 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 21.31/9.23 [2019-03-28 12:40:47,033 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 21.31/9.23 [2019-03-28 12:40:47,033 INFO L387 AbstractCegarLoop]: Difference is false 21.31/9.23 [2019-03-28 12:40:47,033 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 21.31/9.23 [2019-03-28 12:40:47,033 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 21.31/9.23 [2019-03-28 12:40:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. 21.31/9.23 [2019-03-28 12:40:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 21.31/9.23 [2019-03-28 12:40:47,054 INFO L394 BasicCegarLoop]: Found error trace 21.31/9.23 [2019-03-28 12:40:47,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 21.31/9.23 [2019-03-28 12:40:47,055 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 21.31/9.23 [2019-03-28 12:40:47,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.23 [2019-03-28 12:40:47,061 INFO L82 PathProgramCache]: Analyzing trace with hash 125029910, now seen corresponding path program 1 times 21.31/9.23 [2019-03-28 12:40:47,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.31/9.23 [2019-03-28 12:40:47,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.31/9.23 [2019-03-28 12:40:47,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.23 [2019-03-28 12:40:47,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.31/9.23 [2019-03-28 12:40:47,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.23 [2019-03-28 12:40:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.31/9.23 [2019-03-28 12:40:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.31/9.23 [2019-03-28 12:40:47,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.31/9.23 [2019-03-28 12:40:47,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 21.31/9.23 [2019-03-28 12:40:47,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 21.31/9.23 [2019-03-28 12:40:47,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 21.31/9.23 [2019-03-28 12:40:47,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 21.31/9.23 [2019-03-28 12:40:47,263 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 4 states. 21.31/9.23 [2019-03-28 12:40:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.31/9.23 [2019-03-28 12:40:47,358 INFO L93 Difference]: Finished difference Result 15 states and 24 transitions. 21.31/9.23 [2019-03-28 12:40:47,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 21.31/9.23 [2019-03-28 12:40:47,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 21.31/9.23 [2019-03-28 12:40:47,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.31/9.23 [2019-03-28 12:40:47,372 INFO L225 Difference]: With dead ends: 15 21.31/9.23 [2019-03-28 12:40:47,372 INFO L226 Difference]: Without dead ends: 12 21.31/9.23 [2019-03-28 12:40:47,375 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 21.31/9.23 [2019-03-28 12:40:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. 21.31/9.23 [2019-03-28 12:40:47,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. 21.31/9.23 [2019-03-28 12:40:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 21.31/9.23 [2019-03-28 12:40:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. 21.31/9.23 [2019-03-28 12:40:47,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 5 21.31/9.23 [2019-03-28 12:40:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. 21.31/9.23 [2019-03-28 12:40:47,412 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. 21.31/9.23 [2019-03-28 12:40:47,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 21.31/9.23 [2019-03-28 12:40:47,413 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. 21.31/9.23 [2019-03-28 12:40:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 21.31/9.23 [2019-03-28 12:40:47,413 INFO L394 BasicCegarLoop]: Found error trace 21.31/9.23 [2019-03-28 12:40:47,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 21.31/9.23 [2019-03-28 12:40:47,414 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 21.31/9.23 [2019-03-28 12:40:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.23 [2019-03-28 12:40:47,414 INFO L82 PathProgramCache]: Analyzing trace with hash 125029912, now seen corresponding path program 1 times 21.31/9.23 [2019-03-28 12:40:47,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.31/9.23 [2019-03-28 12:40:47,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.31/9.23 [2019-03-28 12:40:47,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.23 [2019-03-28 12:40:47,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.31/9.23 [2019-03-28 12:40:47,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.23 [2019-03-28 12:40:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.31/9.23 [2019-03-28 12:40:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.31/9.23 [2019-03-28 12:40:47,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.31/9.23 [2019-03-28 12:40:47,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 21.31/9.23 [2019-03-28 12:40:47,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 21.31/9.23 [2019-03-28 12:40:47,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 21.31/9.23 [2019-03-28 12:40:47,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 21.31/9.23 [2019-03-28 12:40:47,472 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 4 states. 21.31/9.23 [2019-03-28 12:40:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.31/9.23 [2019-03-28 12:40:47,519 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. 21.31/9.23 [2019-03-28 12:40:47,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 21.31/9.23 [2019-03-28 12:40:47,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 21.31/9.23 [2019-03-28 12:40:47,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.31/9.23 [2019-03-28 12:40:47,521 INFO L225 Difference]: With dead ends: 15 21.31/9.23 [2019-03-28 12:40:47,521 INFO L226 Difference]: Without dead ends: 12 21.31/9.23 [2019-03-28 12:40:47,522 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 21.31/9.23 [2019-03-28 12:40:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. 21.31/9.23 [2019-03-28 12:40:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. 21.31/9.23 [2019-03-28 12:40:47,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 21.31/9.23 [2019-03-28 12:40:47,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. 21.31/9.23 [2019-03-28 12:40:47,525 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 5 21.31/9.23 [2019-03-28 12:40:47,526 INFO L84 Accepts]: Finished accepts. word is rejected. 21.31/9.23 [2019-03-28 12:40:47,526 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. 21.31/9.23 [2019-03-28 12:40:47,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 21.31/9.23 [2019-03-28 12:40:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. 21.31/9.23 [2019-03-28 12:40:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 21.31/9.23 [2019-03-28 12:40:47,526 INFO L394 BasicCegarLoop]: Found error trace 21.31/9.23 [2019-03-28 12:40:47,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 21.31/9.23 [2019-03-28 12:40:47,527 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 21.31/9.23 [2019-03-28 12:40:47,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.23 [2019-03-28 12:40:47,527 INFO L82 PathProgramCache]: Analyzing trace with hash 125029913, now seen corresponding path program 1 times 21.31/9.23 [2019-03-28 12:40:47,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.31/9.23 [2019-03-28 12:40:47,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.31/9.23 [2019-03-28 12:40:47,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.23 [2019-03-28 12:40:47,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.31/9.23 [2019-03-28 12:40:47,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.23 [2019-03-28 12:40:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.31/9.23 [2019-03-28 12:40:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.31/9.23 [2019-03-28 12:40:47,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.31/9.23 [2019-03-28 12:40:47,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 21.31/9.23 [2019-03-28 12:40:47,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 21.31/9.23 [2019-03-28 12:40:47,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 21.31/9.23 [2019-03-28 12:40:47,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 21.31/9.23 [2019-03-28 12:40:47,575 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. 21.31/9.23 [2019-03-28 12:40:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.31/9.23 [2019-03-28 12:40:47,634 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. 21.31/9.23 [2019-03-28 12:40:47,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 21.31/9.23 [2019-03-28 12:40:47,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 21.31/9.23 [2019-03-28 12:40:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.31/9.23 [2019-03-28 12:40:47,635 INFO L225 Difference]: With dead ends: 20 21.31/9.23 [2019-03-28 12:40:47,635 INFO L226 Difference]: Without dead ends: 17 21.31/9.23 [2019-03-28 12:40:47,635 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 21.31/9.23 [2019-03-28 12:40:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 21.31/9.23 [2019-03-28 12:40:47,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. 21.31/9.23 [2019-03-28 12:40:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 21.31/9.23 [2019-03-28 12:40:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. 21.31/9.23 [2019-03-28 12:40:47,641 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 5 21.31/9.23 [2019-03-28 12:40:47,641 INFO L84 Accepts]: Finished accepts. word is rejected. 21.31/9.23 [2019-03-28 12:40:47,641 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. 21.31/9.23 [2019-03-28 12:40:47,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 21.31/9.23 [2019-03-28 12:40:47,642 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. 21.31/9.23 [2019-03-28 12:40:47,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 21.31/9.23 [2019-03-28 12:40:47,642 INFO L394 BasicCegarLoop]: Found error trace 21.31/9.23 [2019-03-28 12:40:47,642 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] 21.31/9.23 [2019-03-28 12:40:47,642 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 21.31/9.23 [2019-03-28 12:40:47,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.23 [2019-03-28 12:40:47,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1028701617, now seen corresponding path program 1 times 21.31/9.23 [2019-03-28 12:40:47,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.31/9.23 [2019-03-28 12:40:47,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.31/9.23 [2019-03-28 12:40:47,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.23 [2019-03-28 12:40:47,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.31/9.23 [2019-03-28 12:40:47,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.23 [2019-03-28 12:40:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.31/9.23 [2019-03-28 12:40:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.31/9.23 [2019-03-28 12:40:47,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 21.31/9.23 [2019-03-28 12:40:47,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 21.31/9.23 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.31/9.23 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 21.31/9.23 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 21.31/9.23 [2019-03-28 12:40:47,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.31/9.23 [2019-03-28 12:40:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.31/9.23 [2019-03-28 12:40:47,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core 21.31/9.23 [2019-03-28 12:40:47,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.31/9.23 [2019-03-28 12:40:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.31/9.23 [2019-03-28 12:40:47,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 21.31/9.23 [2019-03-28 12:40:47,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 21.31/9.23 [2019-03-28 12:40:47,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 21.31/9.23 [2019-03-28 12:40:47,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 21.31/9.23 [2019-03-28 12:40:47,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 21.31/9.23 [2019-03-28 12:40:47,825 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 9 states. 21.31/9.23 [2019-03-28 12:40:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.31/9.23 [2019-03-28 12:40:48,045 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. 21.31/9.23 [2019-03-28 12:40:48,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 21.31/9.23 [2019-03-28 12:40:48,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 21.31/9.23 [2019-03-28 12:40:48,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 21.31/9.23 [2019-03-28 12:40:48,048 INFO L225 Difference]: With dead ends: 29 21.31/9.23 [2019-03-28 12:40:48,048 INFO L226 Difference]: Without dead ends: 0 21.31/9.23 [2019-03-28 12:40:48,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 21.31/9.23 [2019-03-28 12:40:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 21.31/9.23 [2019-03-28 12:40:48,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 21.31/9.23 [2019-03-28 12:40:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 21.31/9.23 [2019-03-28 12:40:48,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 21.31/9.23 [2019-03-28 12:40:48,050 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 21.31/9.23 [2019-03-28 12:40:48,050 INFO L84 Accepts]: Finished accepts. word is rejected. 21.31/9.23 [2019-03-28 12:40:48,050 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 21.31/9.23 [2019-03-28 12:40:48,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 21.31/9.23 [2019-03-28 12:40:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 21.31/9.23 [2019-03-28 12:40:48,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 21.31/9.23 [2019-03-28 12:40:48,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 21.31/9.23 [2019-03-28 12:40:48,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 21.31/9.23 [2019-03-28 12:40:48,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 21.31/9.23 [2019-03-28 12:40:48,216 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 21.31/9.23 [2019-03-28 12:40:48,287 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 21.31/9.23 [2019-03-28 12:40:48,287 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. 21.31/9.23 [2019-03-28 12:40:48,288 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 23 25) no Hoare annotation was computed. 21.31/9.23 [2019-03-28 12:40:48,288 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 21.31/9.23 [2019-03-28 12:40:48,288 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. 21.31/9.23 [2019-03-28 12:40:48,288 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 16) no Hoare annotation was computed. 21.31/9.23 [2019-03-28 12:40:48,289 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 16) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_sumOfThirdBytes_~p~0.offset (+ |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset| (* 4 ULTIMATE.start_sumOfThirdBytes_~i~0) 2))) (.cse1 (<= (* 4 ULTIMATE.start_sumOfThirdBytes_~array_size) (select |#length| |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|))) (.cse2 (<= (+ ULTIMATE.start_sumOfThirdBytes_~p~0.offset 2) (select |#length| ULTIMATE.start_sumOfThirdBytes_~p~0.base))) (.cse3 (= 1 (select |#valid| |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|))) (.cse4 (= 0 |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset|)) (.cse5 (= 1 (select |#valid| ULTIMATE.start_sumOfThirdBytes_~p~0.base)))) (or (and (<= 4 ULTIMATE.start_sumOfThirdBytes_~p~0.offset) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ULTIMATE.start_sumOfThirdBytes_~p~0.offset) .cse5 (= 0 ULTIMATE.start_sumOfThirdBytes_~i~0)))) 21.31/9.23 [2019-03-28 12:40:48,289 INFO L444 ceAbstractionStarter]: At program point L10-3(lines 10 17) the Hoare annotation is: (let ((.cse1 (<= (* 4 ULTIMATE.start_sumOfThirdBytes_~array_size) (select |#length| |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|))) (.cse2 (= 1 (select |#valid| |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|))) (.cse3 (= 0 |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset|))) (or (let ((.cse0 (* 4 ULTIMATE.start_sumOfThirdBytes_~i~0))) (and (<= ULTIMATE.start_sumOfThirdBytes_~p~0.offset (+ |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset| .cse0 2)) .cse1 .cse2 .cse3 (<= 2 (+ |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset| .cse0)))) (and .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_sumOfThirdBytes_~i~0)))) 21.31/9.23 [2019-03-28 12:40:48,289 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 21.31/9.23 [2019-03-28 12:40:48,289 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 21.31/9.23 [2019-03-28 12:40:48,290 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 21.31/9.23 [2019-03-28 12:40:48,290 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 21.31/9.23 [2019-03-28 12:40:48,290 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 21.31/9.23 [2019-03-28 12:40:48,290 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 21.31/9.23 [2019-03-28 12:40:48,291 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 21.31/9.23 [2019-03-28 12:40:48,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.23 [2019-03-28 12:40:48,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.23 [2019-03-28 12:40:48,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.23 [2019-03-28 12:40:48,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.23 [2019-03-28 12:40:48,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.23 [2019-03-28 12:40:48,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.23 [2019-03-28 12:40:48,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.23 [2019-03-28 12:40:48,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.23 [2019-03-28 12:40:48,313 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.23 [2019-03-28 12:40:48,314 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.23 [2019-03-28 12:40:48,315 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.23 [2019-03-28 12:40:48,315 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.23 [2019-03-28 12:40:48,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:48 BasicIcfg 21.31/9.23 [2019-03-28 12:40:48,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 21.31/9.23 [2019-03-28 12:40:48,318 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 21.31/9.23 [2019-03-28 12:40:48,318 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 21.31/9.23 [2019-03-28 12:40:48,321 INFO L276 PluginConnector]: BuchiAutomizer initialized 21.31/9.23 [2019-03-28 12:40:48,322 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.31/9.23 [2019-03-28 12:40:48,322 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:40:46" (1/5) ... 21.31/9.23 [2019-03-28 12:40:48,323 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fdc0f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:40:48, skipping insertion in model container 21.31/9.23 [2019-03-28 12:40:48,323 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.31/9.23 [2019-03-28 12:40:48,323 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:46" (2/5) ... 21.31/9.23 [2019-03-28 12:40:48,324 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fdc0f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:40:48, skipping insertion in model container 21.31/9.23 [2019-03-28 12:40:48,324 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.31/9.23 [2019-03-28 12:40:48,324 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:46" (3/5) ... 21.31/9.23 [2019-03-28 12:40:48,324 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fdc0f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:48, skipping insertion in model container 21.31/9.23 [2019-03-28 12:40:48,324 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.31/9.23 [2019-03-28 12:40:48,325 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:46" (4/5) ... 21.31/9.24 [2019-03-28 12:40:48,325 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fdc0f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:48, skipping insertion in model container 21.31/9.24 [2019-03-28 12:40:48,325 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.31/9.24 [2019-03-28 12:40:48,325 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:48" (5/5) ... 21.31/9.24 [2019-03-28 12:40:48,327 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 21.31/9.24 [2019-03-28 12:40:48,349 INFO L133 ementStrategyFactory]: Using default assertion order modulation 21.31/9.24 [2019-03-28 12:40:48,350 INFO L374 BuchiCegarLoop]: Interprodecural is true 21.31/9.24 [2019-03-28 12:40:48,350 INFO L375 BuchiCegarLoop]: Hoare is true 21.31/9.24 [2019-03-28 12:40:48,350 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 21.31/9.24 [2019-03-28 12:40:48,350 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 21.31/9.24 [2019-03-28 12:40:48,350 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 21.31/9.24 [2019-03-28 12:40:48,350 INFO L379 BuchiCegarLoop]: Difference is false 21.31/9.24 [2019-03-28 12:40:48,351 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 21.31/9.24 [2019-03-28 12:40:48,351 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 21.31/9.24 [2019-03-28 12:40:48,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. 21.31/9.24 [2019-03-28 12:40:48,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 21.31/9.24 [2019-03-28 12:40:48,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.31/9.24 [2019-03-28 12:40:48,361 INFO L119 BuchiIsEmpty]: Starting construction of run 21.31/9.24 [2019-03-28 12:40:48,365 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 21.31/9.24 [2019-03-28 12:40:48,366 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.31/9.24 [2019-03-28 12:40:48,366 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 21.31/9.24 [2019-03-28 12:40:48,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. 21.31/9.24 [2019-03-28 12:40:48,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 21.31/9.24 [2019-03-28 12:40:48,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.31/9.24 [2019-03-28 12:40:48,367 INFO L119 BuchiIsEmpty]: Starting construction of run 21.31/9.24 [2019-03-28 12:40:48,368 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 21.31/9.24 [2019-03-28 12:40:48,368 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.31/9.24 [2019-03-28 12:40:48,374 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue [102] ULTIMATE.startENTRY-->L23: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_13|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ret7, #NULL.base] 15#L23true [78] L23-->L23-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 11#L23-2true [89] L23-2-->L10-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1 0) (= v_ULTIMATE.start_sumOfThirdBytes_~i~0_1 0) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_sumOfThirdBytes_~array_size_1 |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_1, ULTIMATE.start_sumOfThirdBytes_#in~array_size=|v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_1, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_1, ULTIMATE.start_sumOfThirdBytes_#t~mem3=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem3_1|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_1, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|, ULTIMATE.start_sumOfThirdBytes_#res=|v_ULTIMATE.start_sumOfThirdBytes_#res_1|, ULTIMATE.start_sumOfThirdBytes_#t~post2=|v_ULTIMATE.start_sumOfThirdBytes_#t~post2_1|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1, ULTIMATE.start_sumOfThirdBytes_#t~post4=|v_ULTIMATE.start_sumOfThirdBytes_#t~post4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset, ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_#in~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_~p~0.base, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_#t~mem3, ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~#numbers.base, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base, ULTIMATE.start_sumOfThirdBytes_#res, ULTIMATE.start_sumOfThirdBytes_#t~post2, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset, ULTIMATE.start_sumOfThirdBytes_~sum~0, ULTIMATE.start_sumOfThirdBytes_#t~post4] 7#L10-3true 21.31/9.24 [2019-03-28 12:40:48,374 INFO L796 eck$LassoCheckResult]: Loop: 7#L10-3true [58] L10-3-->L13-3: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3 |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|) (< v_ULTIMATE.start_sumOfThirdBytes_~i~0_5 v_ULTIMATE.start_sumOfThirdBytes_~array_size_4) (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3 (+ |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3| (* 4 v_ULTIMATE.start_sumOfThirdBytes_~i~0_5) 2))) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base] 10#L13-3true [63] L13-3-->L13-1: Formula: (and (= |v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5)) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5 1) (select |v_#length_3| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5)) (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5) (= (select |v_#valid_5| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5) 1)) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_#t~mem1] 13#L13-1true [105] L13-1-->L10-3: Formula: (and (<= |v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_8| 0) (= (+ v_ULTIMATE.start_sumOfThirdBytes_~i~0_11 1) v_ULTIMATE.start_sumOfThirdBytes_~i~0_10)) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_11, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_8|} OutVars{ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_10, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_4|, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_7|} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#t~mem1] 7#L10-3true 21.31/9.24 [2019-03-28 12:40:48,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.24 [2019-03-28 12:40:48,375 INFO L82 PathProgramCache]: Analyzing trace with hash 130320, now seen corresponding path program 1 times 21.31/9.24 [2019-03-28 12:40:48,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.31/9.24 [2019-03-28 12:40:48,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.31/9.24 [2019-03-28 12:40:48,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:48,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:48,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:48,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.24 [2019-03-28 12:40:48,407 INFO L82 PathProgramCache]: Analyzing trace with hash 87587, now seen corresponding path program 1 times 21.31/9.24 [2019-03-28 12:40:48,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.31/9.24 [2019-03-28 12:40:48,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.31/9.24 [2019-03-28 12:40:48,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:48,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:48,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:48,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.24 [2019-03-28 12:40:48,420 INFO L82 PathProgramCache]: Analyzing trace with hash -412546380, now seen corresponding path program 1 times 21.31/9.24 [2019-03-28 12:40:48,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.31/9.24 [2019-03-28 12:40:48,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.31/9.24 [2019-03-28 12:40:48,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:48,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:48,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:48,614 INFO L216 LassoAnalysis]: Preferences: 21.31/9.24 [2019-03-28 12:40:48,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.31/9.24 [2019-03-28 12:40:48,616 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.31/9.24 [2019-03-28 12:40:48,616 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.31/9.24 [2019-03-28 12:40:48,616 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.31/9.24 [2019-03-28 12:40:48,616 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.31/9.24 [2019-03-28 12:40:48,617 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.31/9.24 [2019-03-28 12:40:48,617 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.31/9.24 [2019-03-28 12:40:48,617 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 21.31/9.24 [2019-03-28 12:40:48,617 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.31/9.24 [2019-03-28 12:40:48,617 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.31/9.24 [2019-03-28 12:40:48,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:48,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:48,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:48,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:48,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:48,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:48,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:48,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:48,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:48,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:48,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:48,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:48,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:48,972 INFO L300 LassoAnalysis]: Preprocessing complete. 21.31/9.24 [2019-03-28 12:40:48,977 INFO L497 LassoAnalysis]: Using template 'affine'. 21.31/9.24 [2019-03-28 12:40:48,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:48,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:48,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.31/9.24 [2019-03-28 12:40:48,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:48,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:48,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:48,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:48,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:48,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:48,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:48,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:48,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:48,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:48,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:48,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:48,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:48,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:48,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:48,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:48,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.31/9.24 [2019-03-28 12:40:48,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:48,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:48,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:48,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:48,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:48,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:48,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:48,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:48,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:48,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:48,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:49,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:49,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:49,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.31/9.24 [2019-03-28 12:40:49,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:49,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:49,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:49,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:49,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:49,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.31/9.24 [2019-03-28 12:40:49,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:49,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:49,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:49,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:49,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:49,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:49,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:49,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:49,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:49,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:49,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.31/9.24 [2019-03-28 12:40:49,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:49,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:49,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:49,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:49,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:49,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:49,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:49,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:49,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:49,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:49,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.31/9.24 [2019-03-28 12:40:49,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:49,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:49,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:49,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:49,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:49,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:49,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:49,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:49,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:49,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:49,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:49,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:49,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,091 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.31/9.24 [2019-03-28 12:40:49,130 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. 21.31/9.24 [2019-03-28 12:40:49,131 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. 21.31/9.24 [2019-03-28 12:40:49,133 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.31/9.24 [2019-03-28 12:40:49,135 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 21.31/9.24 [2019-03-28 12:40:49,135 INFO L518 LassoAnalysis]: Proved termination. 21.31/9.24 [2019-03-28 12:40:49,136 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.31/9.24 Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 21.31/9.24 Supporting invariants [] 21.31/9.24 [2019-03-28 12:40:49,140 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed 21.31/9.24 [2019-03-28 12:40:49,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.24 [2019-03-28 12:40:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.31/9.24 [2019-03-28 12:40:49,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core 21.31/9.24 [2019-03-28 12:40:49,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.31/9.24 [2019-03-28 12:40:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.31/9.24 [2019-03-28 12:40:49,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core 21.31/9.24 [2019-03-28 12:40:49,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.31/9.24 [2019-03-28 12:40:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.31/9.24 [2019-03-28 12:40:49,234 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 21.31/9.24 [2019-03-28 12:40:49,237 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 21.31/9.24 [2019-03-28 12:40:49,238 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states. Second operand 3 states. 21.31/9.24 [2019-03-28 12:40:49,301 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states.. Second operand 3 states. Result 37 states and 65 transitions. Complement of second has 4 states. 21.31/9.24 [2019-03-28 12:40:49,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 21.31/9.24 [2019-03-28 12:40:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 21.31/9.24 [2019-03-28 12:40:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. 21.31/9.24 [2019-03-28 12:40:49,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 3 letters. Loop has 3 letters. 21.31/9.24 [2019-03-28 12:40:49,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.31/9.24 [2019-03-28 12:40:49,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 6 letters. Loop has 3 letters. 21.31/9.24 [2019-03-28 12:40:49,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.31/9.24 [2019-03-28 12:40:49,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 3 letters. Loop has 6 letters. 21.31/9.24 [2019-03-28 12:40:49,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.31/9.24 [2019-03-28 12:40:49,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 65 transitions. 21.31/9.24 [2019-03-28 12:40:49,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 21.31/9.24 [2019-03-28 12:40:49,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 19 states and 25 transitions. 21.31/9.24 [2019-03-28 12:40:49,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 21.31/9.24 [2019-03-28 12:40:49,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 21.31/9.24 [2019-03-28 12:40:49,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. 21.31/9.24 [2019-03-28 12:40:49,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.31/9.24 [2019-03-28 12:40:49,319 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. 21.31/9.24 [2019-03-28 12:40:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. 21.31/9.24 [2019-03-28 12:40:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. 21.31/9.24 [2019-03-28 12:40:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 21.31/9.24 [2019-03-28 12:40:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. 21.31/9.24 [2019-03-28 12:40:49,322 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. 21.31/9.24 [2019-03-28 12:40:49,322 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. 21.31/9.24 [2019-03-28 12:40:49,322 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 21.31/9.24 [2019-03-28 12:40:49,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. 21.31/9.24 [2019-03-28 12:40:49,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 21.31/9.24 [2019-03-28 12:40:49,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.31/9.24 [2019-03-28 12:40:49,323 INFO L119 BuchiIsEmpty]: Starting construction of run 21.31/9.24 [2019-03-28 12:40:49,324 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 21.31/9.24 [2019-03-28 12:40:49,324 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.31/9.24 [2019-03-28 12:40:49,324 INFO L794 eck$LassoCheckResult]: Stem: 108#ULTIMATE.startENTRY [102] ULTIMATE.startENTRY-->L23: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_13|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ret7, #NULL.base] 109#L23 [78] L23-->L23-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 105#L23-2 [88] L23-2-->L10-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1 0) (= v_ULTIMATE.start_sumOfThirdBytes_~i~0_1 0) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_sumOfThirdBytes_~array_size_1 |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_1, ULTIMATE.start_sumOfThirdBytes_#in~array_size=|v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_1, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_1, ULTIMATE.start_sumOfThirdBytes_#t~mem3=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem3_1|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_1, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|, ULTIMATE.start_sumOfThirdBytes_#res=|v_ULTIMATE.start_sumOfThirdBytes_#res_1|, ULTIMATE.start_sumOfThirdBytes_#t~post2=|v_ULTIMATE.start_sumOfThirdBytes_#t~post2_1|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1, ULTIMATE.start_sumOfThirdBytes_#t~post4=|v_ULTIMATE.start_sumOfThirdBytes_#t~post4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset, ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_#in~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_~p~0.base, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_#t~mem3, ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~#numbers.base, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base, ULTIMATE.start_sumOfThirdBytes_#res, ULTIMATE.start_sumOfThirdBytes_#t~post2, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset, ULTIMATE.start_sumOfThirdBytes_~sum~0, ULTIMATE.start_sumOfThirdBytes_#t~post4] 106#L10-3 21.31/9.24 [2019-03-28 12:40:49,325 INFO L796 eck$LassoCheckResult]: Loop: 106#L10-3 [58] L10-3-->L13-3: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3 |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|) (< v_ULTIMATE.start_sumOfThirdBytes_~i~0_5 v_ULTIMATE.start_sumOfThirdBytes_~array_size_4) (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3 (+ |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3| (* 4 v_ULTIMATE.start_sumOfThirdBytes_~i~0_5) 2))) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base] 111#L13-3 [63] L13-3-->L13-1: Formula: (and (= |v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5)) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5 1) (select |v_#length_3| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5)) (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5) (= (select |v_#valid_5| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5) 1)) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_#t~mem1] 112#L13-1 [105] L13-1-->L10-3: Formula: (and (<= |v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_8| 0) (= (+ v_ULTIMATE.start_sumOfThirdBytes_~i~0_11 1) v_ULTIMATE.start_sumOfThirdBytes_~i~0_10)) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_11, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_8|} OutVars{ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_10, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_4|, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_7|} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#t~mem1] 106#L10-3 21.31/9.24 [2019-03-28 12:40:49,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.24 [2019-03-28 12:40:49,325 INFO L82 PathProgramCache]: Analyzing trace with hash 130319, now seen corresponding path program 1 times 21.31/9.24 [2019-03-28 12:40:49,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.31/9.24 [2019-03-28 12:40:49,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.31/9.24 [2019-03-28 12:40:49,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:49,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:49,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:49,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.24 [2019-03-28 12:40:49,339 INFO L82 PathProgramCache]: Analyzing trace with hash 87587, now seen corresponding path program 2 times 21.31/9.24 [2019-03-28 12:40:49,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.31/9.24 [2019-03-28 12:40:49,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.31/9.24 [2019-03-28 12:40:49,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:49,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:49,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:49,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.24 [2019-03-28 12:40:49,349 INFO L82 PathProgramCache]: Analyzing trace with hash -412576171, now seen corresponding path program 1 times 21.31/9.24 [2019-03-28 12:40:49,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.31/9.24 [2019-03-28 12:40:49,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.31/9.24 [2019-03-28 12:40:49,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:49,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:49,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:49,522 INFO L216 LassoAnalysis]: Preferences: 21.31/9.24 [2019-03-28 12:40:49,522 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.31/9.24 [2019-03-28 12:40:49,523 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.31/9.24 [2019-03-28 12:40:49,523 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.31/9.24 [2019-03-28 12:40:49,523 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.31/9.24 [2019-03-28 12:40:49,523 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.31/9.24 [2019-03-28 12:40:49,523 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.31/9.24 [2019-03-28 12:40:49,523 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.31/9.24 [2019-03-28 12:40:49,523 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 21.31/9.24 [2019-03-28 12:40:49,523 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.31/9.24 [2019-03-28 12:40:49,524 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.31/9.24 [2019-03-28 12:40:49,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:49,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:49,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:49,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:49,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:49,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:49,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:49,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:49,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:49,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:49,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:49,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:49,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:49,847 INFO L300 LassoAnalysis]: Preprocessing complete. 21.31/9.24 [2019-03-28 12:40:49,848 INFO L497 LassoAnalysis]: Using template 'affine'. 21.31/9.24 [2019-03-28 12:40:49,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:49,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:49,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:49,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:49,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:49,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:49,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:49,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.31/9.24 [2019-03-28 12:40:49,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:49,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:49,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:49,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:49,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:49,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:49,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:49,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:49,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:49,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:49,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:49,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:49,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:49,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:49,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:49,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.31/9.24 [2019-03-28 12:40:49,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:49,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:49,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:49,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:49,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:49,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.31/9.24 [2019-03-28 12:40:49,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:49,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:49,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:49,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:49,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:49,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:49,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:49,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:49,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:49,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:49,907 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.31/9.24 [2019-03-28 12:40:49,924 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 21.31/9.24 [2019-03-28 12:40:49,924 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. 21.31/9.24 [2019-03-28 12:40:49,924 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.31/9.24 [2019-03-28 12:40:49,925 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 21.31/9.24 [2019-03-28 12:40:49,926 INFO L518 LassoAnalysis]: Proved termination. 21.31/9.24 [2019-03-28 12:40:49,926 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.31/9.24 Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 21.31/9.24 Supporting invariants [] 21.31/9.24 [2019-03-28 12:40:49,940 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed 21.31/9.24 [2019-03-28 12:40:49,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.24 [2019-03-28 12:40:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.31/9.24 [2019-03-28 12:40:49,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core 21.31/9.24 [2019-03-28 12:40:49,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.31/9.24 [2019-03-28 12:40:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.31/9.24 [2019-03-28 12:40:49,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core 21.31/9.24 [2019-03-28 12:40:49,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.31/9.24 [2019-03-28 12:40:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.31/9.24 [2019-03-28 12:40:50,003 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 21.31/9.24 [2019-03-28 12:40:50,003 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 21.31/9.24 [2019-03-28 12:40:50,004 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. 21.31/9.24 [2019-03-28 12:40:50,018 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 24 states and 32 transitions. Complement of second has 4 states. 21.31/9.24 [2019-03-28 12:40:50,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 21.31/9.24 [2019-03-28 12:40:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 21.31/9.24 [2019-03-28 12:40:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. 21.31/9.24 [2019-03-28 12:40:50,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 3 letters. Loop has 3 letters. 21.31/9.24 [2019-03-28 12:40:50,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.31/9.24 [2019-03-28 12:40:50,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 6 letters. Loop has 3 letters. 21.31/9.24 [2019-03-28 12:40:50,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.31/9.24 [2019-03-28 12:40:50,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 3 letters. Loop has 6 letters. 21.31/9.24 [2019-03-28 12:40:50,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.31/9.24 [2019-03-28 12:40:50,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 32 transitions. 21.31/9.24 [2019-03-28 12:40:50,024 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 21.31/9.24 [2019-03-28 12:40:50,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 32 transitions. 21.31/9.24 [2019-03-28 12:40:50,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 21.31/9.24 [2019-03-28 12:40:50,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 21.31/9.24 [2019-03-28 12:40:50,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. 21.31/9.24 [2019-03-28 12:40:50,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.31/9.24 [2019-03-28 12:40:50,026 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. 21.31/9.24 [2019-03-28 12:40:50,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. 21.31/9.24 [2019-03-28 12:40:50,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 13. 21.31/9.24 [2019-03-28 12:40:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 21.31/9.24 [2019-03-28 12:40:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. 21.31/9.24 [2019-03-28 12:40:50,028 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. 21.31/9.24 [2019-03-28 12:40:50,028 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. 21.31/9.24 [2019-03-28 12:40:50,028 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 21.31/9.24 [2019-03-28 12:40:50,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. 21.31/9.24 [2019-03-28 12:40:50,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 21.31/9.24 [2019-03-28 12:40:50,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.31/9.24 [2019-03-28 12:40:50,029 INFO L119 BuchiIsEmpty]: Starting construction of run 21.31/9.24 [2019-03-28 12:40:50,029 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 21.31/9.24 [2019-03-28 12:40:50,029 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 21.31/9.24 [2019-03-28 12:40:50,030 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY [102] ULTIMATE.startENTRY-->L23: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_13|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ret7, #NULL.base] 193#L23 [78] L23-->L23-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 190#L23-2 [89] L23-2-->L10-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1 0) (= v_ULTIMATE.start_sumOfThirdBytes_~i~0_1 0) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_sumOfThirdBytes_~array_size_1 |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_1, ULTIMATE.start_sumOfThirdBytes_#in~array_size=|v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_1, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_1, ULTIMATE.start_sumOfThirdBytes_#t~mem3=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem3_1|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_1, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|, ULTIMATE.start_sumOfThirdBytes_#res=|v_ULTIMATE.start_sumOfThirdBytes_#res_1|, ULTIMATE.start_sumOfThirdBytes_#t~post2=|v_ULTIMATE.start_sumOfThirdBytes_#t~post2_1|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1, ULTIMATE.start_sumOfThirdBytes_#t~post4=|v_ULTIMATE.start_sumOfThirdBytes_#t~post4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset, ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_#in~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_~p~0.base, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_#t~mem3, ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~#numbers.base, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base, ULTIMATE.start_sumOfThirdBytes_#res, ULTIMATE.start_sumOfThirdBytes_#t~post2, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset, ULTIMATE.start_sumOfThirdBytes_~sum~0, ULTIMATE.start_sumOfThirdBytes_#t~post4] 191#L10-3 [58] L10-3-->L13-3: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3 |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|) (< v_ULTIMATE.start_sumOfThirdBytes_~i~0_5 v_ULTIMATE.start_sumOfThirdBytes_~array_size_4) (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3 (+ |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3| (* 4 v_ULTIMATE.start_sumOfThirdBytes_~i~0_5) 2))) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base] 186#L13-3 21.31/9.24 [2019-03-28 12:40:50,030 INFO L796 eck$LassoCheckResult]: Loop: 186#L13-3 [63] L13-3-->L13-1: Formula: (and (= |v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5)) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5 1) (select |v_#length_3| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5)) (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5) (= (select |v_#valid_5| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5) 1)) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_5, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_5, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_2|} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_#t~mem1] 187#L13-1 [69] L13-1-->L15: Formula: (and (= (+ v_ULTIMATE.start_sumOfThirdBytes_~sum~0_5 1) v_ULTIMATE.start_sumOfThirdBytes_~sum~0_4) (< 0 |v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_6|)) InVars {ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_6|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_5} OutVars{ULTIMATE.start_sumOfThirdBytes_#t~post2=|v_ULTIMATE.start_sumOfThirdBytes_#t~post2_2|, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_5|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_4} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_#t~post2, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_~sum~0] 182#L15 [107] L15-->L15-2: Formula: (and (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_11) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_11 1) (select |v_#length_9| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_14)) (= |v_ULTIMATE.start_sumOfThirdBytes_#t~post4_5| |v_ULTIMATE.start_sumOfThirdBytes_#t~mem3_5|) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_14) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_11) |v_ULTIMATE.start_sumOfThirdBytes_#t~mem3_5|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_14))) InVars {ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_11, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_14} OutVars{ULTIMATE.start_sumOfThirdBytes_#t~mem3=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem3_5|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_11, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_14, ULTIMATE.start_sumOfThirdBytes_#t~post4=|v_ULTIMATE.start_sumOfThirdBytes_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_#t~mem3, ULTIMATE.start_sumOfThirdBytes_#t~post4] 183#L15-2 [109] L15-2-->L13-3: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_15) 1) (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_12) (= (store |v_#memory_int_7| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_15 (store (select |v_#memory_int_7| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_15) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_12 (+ |v_ULTIMATE.start_sumOfThirdBytes_#t~post4_7| (- 1)))) |v_#memory_int_6|) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_12 1) (select |v_#length_10| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_15))) InVars {ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_12, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_15, ULTIMATE.start_sumOfThirdBytes_#t~post4=|v_ULTIMATE.start_sumOfThirdBytes_#t~post4_7|} OutVars{ULTIMATE.start_sumOfThirdBytes_#t~mem3=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem3_6|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_12, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_15, ULTIMATE.start_sumOfThirdBytes_#t~post4=|v_ULTIMATE.start_sumOfThirdBytes_#t~post4_6|} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_#t~mem3, #memory_int, ULTIMATE.start_sumOfThirdBytes_#t~post4] 186#L13-3 21.31/9.24 [2019-03-28 12:40:50,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.24 [2019-03-28 12:40:50,030 INFO L82 PathProgramCache]: Analyzing trace with hash 4039978, now seen corresponding path program 1 times 21.31/9.24 [2019-03-28 12:40:50,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.31/9.24 [2019-03-28 12:40:50,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.31/9.24 [2019-03-28 12:40:50,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:50,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:50,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:50,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.24 [2019-03-28 12:40:50,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2870089, now seen corresponding path program 1 times 21.31/9.24 [2019-03-28 12:40:50,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.31/9.24 [2019-03-28 12:40:50,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.31/9.24 [2019-03-28 12:40:50,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:50,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:50,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:50,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.24 [2019-03-28 12:40:50,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1320111118, now seen corresponding path program 1 times 21.31/9.24 [2019-03-28 12:40:50,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.31/9.24 [2019-03-28 12:40:50,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.31/9.24 [2019-03-28 12:40:50,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:50,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:50,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.31/9.24 [2019-03-28 12:40:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:50,243 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 21.31/9.24 [2019-03-28 12:40:50,312 INFO L216 LassoAnalysis]: Preferences: 21.31/9.24 [2019-03-28 12:40:50,312 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.31/9.24 [2019-03-28 12:40:50,312 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.31/9.24 [2019-03-28 12:40:50,312 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.31/9.24 [2019-03-28 12:40:50,312 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.31/9.24 [2019-03-28 12:40:50,312 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.31/9.24 [2019-03-28 12:40:50,313 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.31/9.24 [2019-03-28 12:40:50,313 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.31/9.24 [2019-03-28 12:40:50,313 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 21.31/9.24 [2019-03-28 12:40:50,313 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.31/9.24 [2019-03-28 12:40:50,313 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.31/9.24 [2019-03-28 12:40:50,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:50,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:50,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:50,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:50,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:50,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:50,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:50,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:50,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:50,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:50,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:50,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:50,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.31/9.24 [2019-03-28 12:40:50,720 INFO L300 LassoAnalysis]: Preprocessing complete. 21.31/9.24 [2019-03-28 12:40:50,720 INFO L497 LassoAnalysis]: Using template 'affine'. 21.31/9.24 [2019-03-28 12:40:50,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:50,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:50,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:50,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:50,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:50,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:50,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:50,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.31/9.24 [2019-03-28 12:40:50,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.31/9.24 Termination analysis: LINEAR_WITH_GUESSES 21.31/9.24 Number of strict supporting invariants: 0 21.31/9.24 Number of non-strict supporting invariants: 1 21.31/9.24 Consider only non-deceasing supporting invariants: true 21.31/9.24 Simplify termination arguments: true 21.31/9.24 Simplify supporting invariants: trueOverapproximate stem: false 21.31/9.24 [2019-03-28 12:40:50,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.31/9.24 [2019-03-28 12:40:50,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.31/9.24 [2019-03-28 12:40:50,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.31/9.24 [2019-03-28 12:40:50,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.31/9.24 [2019-03-28 12:40:50,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.31/9.24 [2019-03-28 12:40:50,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.31/9.24 [2019-03-28 12:40:50,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.31/9.24 [2019-03-28 12:40:50,733 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.31/9.24 [2019-03-28 12:40:50,734 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 21.31/9.24 [2019-03-28 12:40:50,734 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 21.31/9.24 [2019-03-28 12:40:50,734 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.31/9.24 [2019-03-28 12:40:50,734 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 21.31/9.24 [2019-03-28 12:40:50,735 INFO L518 LassoAnalysis]: Proved termination. 21.31/9.24 [2019-03-28 12:40:50,735 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.31/9.24 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3 21.31/9.24 Supporting invariants [] 21.31/9.24 [2019-03-28 12:40:50,743 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 21.31/9.24 [2019-03-28 12:40:50,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 21.31/9.24 [2019-03-28 12:40:50,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.31/9.24 [2019-03-28 12:40:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.31/9.24 [2019-03-28 12:40:50,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core 21.31/9.24 [2019-03-28 12:40:50,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.31/9.24 [2019-03-28 12:40:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.31/9.24 [2019-03-28 12:40:50,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core 21.31/9.24 [2019-03-28 12:40:50,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.31/9.24 [2019-03-28 12:40:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.31/9.24 [2019-03-28 12:40:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.31/9.24 [2019-03-28 12:40:50,878 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 21.31/9.24 [2019-03-28 12:40:50,878 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 21.31/9.24 [2019-03-28 12:40:50,878 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates 21.31/9.24 [2019-03-28 12:40:50,878 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. 21.31/9.24 [2019-03-28 12:40:50,914 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 21 states and 27 transitions. Complement of second has 10 states. 21.31/9.24 [2019-03-28 12:40:50,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 21.31/9.24 [2019-03-28 12:40:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 21.31/9.24 [2019-03-28 12:40:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. 21.31/9.24 [2019-03-28 12:40:50,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 4 letters. Loop has 4 letters. 21.31/9.24 [2019-03-28 12:40:50,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.31/9.24 [2019-03-28 12:40:50,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 8 letters. Loop has 4 letters. 21.31/9.24 [2019-03-28 12:40:50,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.31/9.24 [2019-03-28 12:40:50,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 4 letters. Loop has 8 letters. 21.31/9.24 [2019-03-28 12:40:50,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.31/9.24 [2019-03-28 12:40:50,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. 21.31/9.24 [2019-03-28 12:40:50,920 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 21.31/9.24 [2019-03-28 12:40:50,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. 21.31/9.24 [2019-03-28 12:40:50,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 21.31/9.24 [2019-03-28 12:40:50,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 21.31/9.24 [2019-03-28 12:40:50,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 21.31/9.24 [2019-03-28 12:40:50,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 21.31/9.24 [2019-03-28 12:40:50,921 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 21.31/9.24 [2019-03-28 12:40:50,921 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 21.31/9.24 [2019-03-28 12:40:50,921 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 21.31/9.24 [2019-03-28 12:40:50,921 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 21.31/9.24 [2019-03-28 12:40:50,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 21.31/9.24 [2019-03-28 12:40:50,921 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 21.31/9.24 [2019-03-28 12:40:50,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 21.31/9.24 [2019-03-28 12:40:50,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:50 BasicIcfg 21.31/9.24 [2019-03-28 12:40:50,928 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 21.31/9.24 [2019-03-28 12:40:50,928 INFO L168 Benchmark]: Toolchain (without parser) took 4795.02 ms. Allocated memory was 649.6 MB in the beginning and 759.2 MB in the end (delta: 109.6 MB). Free memory was 564.0 MB in the beginning and 704.8 MB in the end (delta: -140.9 MB). There was no memory consumed. Max. memory is 50.3 GB. 21.31/9.24 [2019-03-28 12:40:50,929 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 649.6 MB. Free memory is still 585.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 21.31/9.24 [2019-03-28 12:40:50,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.16 ms. Allocated memory was 649.6 MB in the beginning and 655.4 MB in the end (delta: 5.8 MB). Free memory was 564.0 MB in the beginning and 620.4 MB in the end (delta: -56.5 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 21.31/9.24 [2019-03-28 12:40:50,930 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.53 ms. Allocated memory is still 655.4 MB. Free memory was 620.4 MB in the beginning and 617.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 21.31/9.24 [2019-03-28 12:40:50,931 INFO L168 Benchmark]: Boogie Preprocessor took 26.14 ms. Allocated memory is still 655.4 MB. Free memory was 617.3 MB in the beginning and 615.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. 21.31/9.24 [2019-03-28 12:40:50,931 INFO L168 Benchmark]: RCFGBuilder took 307.17 ms. Allocated memory is still 655.4 MB. Free memory was 615.9 MB in the beginning and 595.2 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 50.3 GB. 21.31/9.24 [2019-03-28 12:40:50,932 INFO L168 Benchmark]: BlockEncodingV2 took 135.17 ms. Allocated memory is still 655.4 MB. Free memory was 595.2 MB in the beginning and 587.1 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 21.31/9.24 [2019-03-28 12:40:50,933 INFO L168 Benchmark]: TraceAbstraction took 1358.70 ms. Allocated memory is still 655.4 MB. Free memory was 587.1 MB in the beginning and 452.7 MB in the end (delta: 134.4 MB). Peak memory consumption was 134.4 MB. Max. memory is 50.3 GB. 21.31/9.24 [2019-03-28 12:40:50,933 INFO L168 Benchmark]: BuchiAutomizer took 2609.95 ms. Allocated memory was 655.4 MB in the beginning and 759.2 MB in the end (delta: 103.8 MB). Free memory was 451.4 MB in the beginning and 704.8 MB in the end (delta: -253.5 MB). There was no memory consumed. Max. memory is 50.3 GB. 21.31/9.24 [2019-03-28 12:40:50,937 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 21.31/9.24 --- Results --- 21.31/9.24 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 21.31/9.24 - StatisticsResult: Initial Icfg 21.31/9.24 23 locations, 27 edges 21.31/9.24 - StatisticsResult: Encoded RCFG 21.31/9.24 14 locations, 23 edges 21.31/9.24 * Results from de.uni_freiburg.informatik.ultimate.core: 21.31/9.24 - StatisticsResult: Toolchain Benchmarks 21.31/9.24 Benchmark results are: 21.31/9.24 * CDTParser took 0.21 ms. Allocated memory is still 649.6 MB. Free memory is still 585.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 21.31/9.24 * CACSL2BoogieTranslator took 310.16 ms. Allocated memory was 649.6 MB in the beginning and 655.4 MB in the end (delta: 5.8 MB). Free memory was 564.0 MB in the beginning and 620.4 MB in the end (delta: -56.5 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 21.31/9.24 * Boogie Procedure Inliner took 42.53 ms. Allocated memory is still 655.4 MB. Free memory was 620.4 MB in the beginning and 617.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 21.31/9.24 * Boogie Preprocessor took 26.14 ms. Allocated memory is still 655.4 MB. Free memory was 617.3 MB in the beginning and 615.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. 21.31/9.24 * RCFGBuilder took 307.17 ms. Allocated memory is still 655.4 MB. Free memory was 615.9 MB in the beginning and 595.2 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 50.3 GB. 21.31/9.24 * BlockEncodingV2 took 135.17 ms. Allocated memory is still 655.4 MB. Free memory was 595.2 MB in the beginning and 587.1 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 21.31/9.24 * TraceAbstraction took 1358.70 ms. Allocated memory is still 655.4 MB. Free memory was 587.1 MB in the beginning and 452.7 MB in the end (delta: 134.4 MB). Peak memory consumption was 134.4 MB. Max. memory is 50.3 GB. 21.31/9.24 * BuchiAutomizer took 2609.95 ms. Allocated memory was 655.4 MB in the beginning and 759.2 MB in the end (delta: 103.8 MB). Free memory was 451.4 MB in the beginning and 704.8 MB in the end (delta: -253.5 MB). There was no memory consumed. Max. memory is 50.3 GB. 21.31/9.24 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 21.31/9.24 - GenericResult: Unfinished Backtranslation 21.31/9.24 unknown boogie variable #length 21.31/9.24 - GenericResult: Unfinished Backtranslation 21.31/9.24 unknown boogie variable #length 21.31/9.24 - GenericResult: Unfinished Backtranslation 21.31/9.24 unknown boogie variable #length 21.31/9.24 - GenericResult: Unfinished Backtranslation 21.31/9.24 unknown boogie variable #length 21.31/9.24 - GenericResult: Unfinished Backtranslation 21.31/9.24 unknown boogie variable #length 21.31/9.24 - GenericResult: Unfinished Backtranslation 21.31/9.24 unknown boogie variable #length 21.31/9.24 - GenericResult: Unfinished Backtranslation 21.31/9.24 unknown boogie variable #length 21.31/9.24 - GenericResult: Unfinished Backtranslation 21.31/9.24 unknown boogie variable #length 21.31/9.24 - GenericResult: Unfinished Backtranslation 21.31/9.24 unknown boogie variable #length 21.31/9.24 - GenericResult: Unfinished Backtranslation 21.31/9.24 unknown boogie variable #length 21.31/9.24 - GenericResult: Unfinished Backtranslation 21.31/9.24 unknown boogie variable #length 21.31/9.24 - GenericResult: Unfinished Backtranslation 21.31/9.24 unknown boogie variable #length 21.31/9.24 - GenericResult: Unfinished Backtranslation 21.31/9.24 unknown boogie variable #memory_int 21.31/9.24 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 21.31/9.24 - PositiveResult [Line: 15]: pointer dereference always succeeds 21.31/9.24 For all program executions holds that pointer dereference always succeeds at this location 21.31/9.24 - PositiveResult [Line: 13]: pointer dereference always succeeds 21.31/9.24 For all program executions holds that pointer dereference always succeeds at this location 21.31/9.24 - PositiveResult [Line: 13]: pointer dereference always succeeds 21.31/9.24 For all program executions holds that pointer dereference always succeeds at this location 21.31/9.24 - PositiveResult [Line: 15]: pointer dereference always succeeds 21.31/9.24 For all program executions holds that pointer dereference always succeeds at this location 21.31/9.24 - PositiveResult [Line: 15]: pointer dereference always succeeds 21.31/9.24 For all program executions holds that pointer dereference always succeeds at this location 21.31/9.24 - PositiveResult [Line: 15]: pointer dereference always succeeds 21.31/9.24 For all program executions holds that pointer dereference always succeeds at this location 21.31/9.24 - AllSpecificationsHoldResult: All specifications hold 21.31/9.24 6 specifications checked. All of them hold 21.31/9.24 - InvariantResult [Line: 13]: Loop Invariant 21.31/9.24 [2019-03-28 12:40:50,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.24 [2019-03-28 12:40:50,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.24 [2019-03-28 12:40:50,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.24 [2019-03-28 12:40:50,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.24 [2019-03-28 12:40:50,948 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.24 [2019-03-28 12:40:50,948 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.24 [2019-03-28 12:40:50,948 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.24 [2019-03-28 12:40:50,948 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.24 Derived loop invariant: ((((((4 <= p && p <= numbers + 4 * i + 2) && 4 * array_size <= unknown-#length-unknown[numbers]) && p + 2 <= unknown-#length-unknown[p]) && 1 == \valid[numbers]) && 0 == numbers) && 1 == \valid[p]) || (((((((p <= numbers + 4 * i + 2 && 4 * array_size <= unknown-#length-unknown[numbers]) && p + 2 <= unknown-#length-unknown[p]) && 1 == \valid[numbers]) && 0 == numbers) && 2 <= p) && 1 == \valid[p]) && 0 == i) 21.31/9.24 - InvariantResult [Line: 10]: Loop Invariant 21.31/9.24 [2019-03-28 12:40:50,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.24 [2019-03-28 12:40:50,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.24 [2019-03-28 12:40:50,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.24 [2019-03-28 12:40:50,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 21.31/9.24 Derived loop invariant: ((((p <= numbers + 4 * i + 2 && 4 * array_size <= unknown-#length-unknown[numbers]) && 1 == \valid[numbers]) && 0 == numbers) && 2 <= numbers + 4 * i) || (((4 * array_size <= unknown-#length-unknown[numbers] && 1 == \valid[numbers]) && 0 == numbers) && 0 == i) 21.31/9.24 - StatisticsResult: Ultimate Automizer benchmark data 21.31/9.24 CFG has 1 procedures, 14 locations, 6 error locations. SAFE Result, 1.2s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 16 SDtfs, 83 SDslu, 48 SDs, 0 SdLazy, 137 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=3, 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, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 10 NumberOfFragments, 133 HoareAnnotationTreeSize, 2 FomulaSimplifications, 587 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 43 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 610 SizeOfPredicates, 4 NumberOfNonLiveVariables, 58 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 3/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 21.31/9.24 - StatisticsResult: Constructed decomposition of program 21.31/9.24 Your program was decomposed into 3 terminating modules (0 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 6 locations. 21.31/9.24 - StatisticsResult: Timing statistics 21.31/9.24 BüchiAutomizer plugin needed 2.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 90 SDslu, 20 SDs, 0 SdLazy, 83 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital120 mio100 ax100 hnf100 lsp91 ukn81 mio100 lsp61 div100 bol100 ite100 ukn100 eq191 hnf90 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 21.31/9.24 - TerminationAnalysisResult: Termination proven 21.31/9.24 Buchi Automizer proved that your program is terminating 21.31/9.24 RESULT: Ultimate proved your program to be correct! 21.31/9.24 !SESSION 2019-03-28 12:40:42.872 ----------------------------------------------- 21.31/9.24 eclipse.buildId=unknown 21.31/9.24 java.version=1.8.0_181 21.31/9.24 java.vendor=Oracle Corporation 21.31/9.24 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 21.31/9.24 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 21.31/9.24 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 21.31/9.24 21.31/9.24 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:40:51.176 21.31/9.24 !MESSAGE The workspace will exit with unsaved changes in this session. 21.31/9.24 Received shutdown request... 21.31/9.24 Ultimate: 21.31/9.24 GTK+ Version Check 21.31/9.24 EOF