30.56/12.85 YES 30.56/12.85 30.56/12.85 Ultimate: Cannot open display: 30.56/12.85 This is Ultimate 0.1.24-8dc7c08-m 30.56/12.85 [2019-03-28 12:30:17,229 INFO L170 SettingsManager]: Resetting all preferences to default values... 30.56/12.85 [2019-03-28 12:30:17,231 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 30.56/12.85 [2019-03-28 12:30:17,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 30.56/12.85 [2019-03-28 12:30:17,243 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 30.56/12.85 [2019-03-28 12:30:17,244 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 30.56/12.85 [2019-03-28 12:30:17,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 30.56/12.85 [2019-03-28 12:30:17,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 30.56/12.85 [2019-03-28 12:30:17,248 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 30.56/12.85 [2019-03-28 12:30:17,249 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 30.56/12.85 [2019-03-28 12:30:17,250 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 30.56/12.85 [2019-03-28 12:30:17,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 30.56/12.85 [2019-03-28 12:30:17,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 30.56/12.85 [2019-03-28 12:30:17,252 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 30.56/12.85 [2019-03-28 12:30:17,253 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 30.56/12.85 [2019-03-28 12:30:17,254 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 30.56/12.85 [2019-03-28 12:30:17,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 30.56/12.85 [2019-03-28 12:30:17,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 30.56/12.85 [2019-03-28 12:30:17,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 30.56/12.85 [2019-03-28 12:30:17,259 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 30.56/12.85 [2019-03-28 12:30:17,260 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 30.56/12.85 [2019-03-28 12:30:17,261 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 30.56/12.85 [2019-03-28 12:30:17,263 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 30.56/12.85 [2019-03-28 12:30:17,264 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 30.56/12.85 [2019-03-28 12:30:17,264 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 30.56/12.85 [2019-03-28 12:30:17,264 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 30.56/12.85 [2019-03-28 12:30:17,265 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 30.56/12.85 [2019-03-28 12:30:17,266 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 30.56/12.85 [2019-03-28 12:30:17,266 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 30.56/12.85 [2019-03-28 12:30:17,267 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 30.56/12.85 [2019-03-28 12:30:17,267 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 30.56/12.85 [2019-03-28 12:30:17,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 30.56/12.85 [2019-03-28 12:30:17,269 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 30.56/12.85 [2019-03-28 12:30:17,269 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 30.56/12.85 [2019-03-28 12:30:17,270 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 30.56/12.85 [2019-03-28 12:30:17,270 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 30.56/12.85 [2019-03-28 12:30:17,270 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 30.56/12.85 [2019-03-28 12:30:17,271 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 30.56/12.85 [2019-03-28 12:30:17,272 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 30.56/12.85 [2019-03-28 12:30:17,272 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 30.56/12.85 [2019-03-28 12:30:17,287 INFO L110 SettingsManager]: Loading preferences was successful 30.56/12.85 [2019-03-28 12:30:17,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 30.56/12.85 [2019-03-28 12:30:17,289 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 30.56/12.85 [2019-03-28 12:30:17,289 INFO L133 SettingsManager]: * Rewrite not-equals=true 30.56/12.85 [2019-03-28 12:30:17,289 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 30.56/12.85 [2019-03-28 12:30:17,289 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 30.56/12.85 [2019-03-28 12:30:17,289 INFO L133 SettingsManager]: * Use SBE=true 30.56/12.85 [2019-03-28 12:30:17,289 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 30.56/12.85 [2019-03-28 12:30:17,290 INFO L133 SettingsManager]: * Use old map elimination=false 30.56/12.85 [2019-03-28 12:30:17,290 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 30.56/12.85 [2019-03-28 12:30:17,290 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 30.56/12.85 [2019-03-28 12:30:17,290 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 30.56/12.85 [2019-03-28 12:30:17,290 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 30.56/12.85 [2019-03-28 12:30:17,290 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 30.56/12.85 [2019-03-28 12:30:17,291 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.56/12.85 [2019-03-28 12:30:17,291 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 30.56/12.85 [2019-03-28 12:30:17,291 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 30.56/12.85 [2019-03-28 12:30:17,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE 30.56/12.85 [2019-03-28 12:30:17,291 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 30.56/12.85 [2019-03-28 12:30:17,291 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 30.56/12.85 [2019-03-28 12:30:17,292 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 30.56/12.85 [2019-03-28 12:30:17,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 30.56/12.85 [2019-03-28 12:30:17,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 30.56/12.85 [2019-03-28 12:30:17,292 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 30.56/12.85 [2019-03-28 12:30:17,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 30.56/12.85 [2019-03-28 12:30:17,293 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 30.56/12.85 [2019-03-28 12:30:17,293 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 30.56/12.85 [2019-03-28 12:30:17,293 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 30.56/12.85 [2019-03-28 12:30:17,293 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 30.56/12.85 [2019-03-28 12:30:17,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 30.56/12.85 [2019-03-28 12:30:17,334 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 30.56/12.85 [2019-03-28 12:30:17,338 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 30.56/12.85 [2019-03-28 12:30:17,339 INFO L271 PluginConnector]: Initializing CDTParser... 30.56/12.85 [2019-03-28 12:30:17,340 INFO L276 PluginConnector]: CDTParser initialized 30.56/12.85 [2019-03-28 12:30:17,341 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 30.56/12.85 [2019-03-28 12:30:17,400 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/2dd35a67ec9c49fcb21cc923ce5a6890/FLAG5c456f57d 30.56/12.85 [2019-03-28 12:30:17,799 INFO L307 CDTParser]: Found 1 translation units. 30.56/12.85 [2019-03-28 12:30:17,800 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 30.56/12.85 [2019-03-28 12:30:17,816 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/2dd35a67ec9c49fcb21cc923ce5a6890/FLAG5c456f57d 30.56/12.85 [2019-03-28 12:30:18,361 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/2dd35a67ec9c49fcb21cc923ce5a6890 30.56/12.85 [2019-03-28 12:30:18,372 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 30.56/12.85 [2019-03-28 12:30:18,375 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 30.56/12.85 [2019-03-28 12:30:18,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 30.56/12.85 [2019-03-28 12:30:18,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 30.56/12.85 [2019-03-28 12:30:18,380 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 30.56/12.85 [2019-03-28 12:30:18,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:30:18" (1/1) ... 30.56/12.85 [2019-03-28 12:30:18,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5dc315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:30:18, skipping insertion in model container 30.56/12.85 [2019-03-28 12:30:18,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:30:18" (1/1) ... 30.56/12.85 [2019-03-28 12:30:18,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 30.56/12.85 [2019-03-28 12:30:18,434 INFO L176 MainTranslator]: Built tables and reachable declarations 30.56/12.85 [2019-03-28 12:30:18,763 INFO L206 PostProcessor]: Analyzing one entry point: main 30.56/12.85 [2019-03-28 12:30:18,774 INFO L191 MainTranslator]: Completed pre-run 30.56/12.85 [2019-03-28 12:30:18,821 INFO L206 PostProcessor]: Analyzing one entry point: main 30.56/12.85 [2019-03-28 12:30:18,864 INFO L195 MainTranslator]: Completed translation 30.56/12.85 [2019-03-28 12:30:18,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:30:18 WrapperNode 30.56/12.85 [2019-03-28 12:30:18,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 30.56/12.85 [2019-03-28 12:30:18,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 30.56/12.85 [2019-03-28 12:30:18,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 30.56/12.85 [2019-03-28 12:30:18,866 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 30.56/12.85 [2019-03-28 12:30:18,875 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:30:18" (1/1) ... 30.56/12.85 [2019-03-28 12:30:18,891 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:30:18" (1/1) ... 30.56/12.85 [2019-03-28 12:30:18,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 30.56/12.85 [2019-03-28 12:30:18,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 30.56/12.85 [2019-03-28 12:30:18,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 30.56/12.85 [2019-03-28 12:30:18,915 INFO L276 PluginConnector]: Boogie Preprocessor initialized 30.56/12.85 [2019-03-28 12:30:18,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:30:18" (1/1) ... 30.56/12.85 [2019-03-28 12:30:18,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:30:18" (1/1) ... 30.56/12.85 [2019-03-28 12:30:18,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:30:18" (1/1) ... 30.56/12.85 [2019-03-28 12:30:18,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:30:18" (1/1) ... 30.56/12.85 [2019-03-28 12:30:18,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:30:18" (1/1) ... 30.56/12.85 [2019-03-28 12:30:18,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:30:18" (1/1) ... 30.56/12.85 [2019-03-28 12:30:18,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:30:18" (1/1) ... 30.56/12.85 [2019-03-28 12:30:18,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 30.56/12.85 [2019-03-28 12:30:18,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 30.56/12.85 [2019-03-28 12:30:18,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... 30.56/12.85 [2019-03-28 12:30:18,944 INFO L276 PluginConnector]: RCFGBuilder initialized 30.56/12.85 [2019-03-28 12:30:18,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:30:18" (1/1) ... 30.56/12.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.56/12.85 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 30.56/12.85 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 30.56/12.85 [2019-03-28 12:30:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 30.56/12.85 [2019-03-28 12:30:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 30.56/12.85 [2019-03-28 12:30:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap 30.56/12.85 [2019-03-28 12:30:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 30.56/12.85 [2019-03-28 12:30:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 30.56/12.85 [2019-03-28 12:30:19,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 30.56/12.85 [2019-03-28 12:30:19,245 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 30.56/12.85 [2019-03-28 12:30:19,245 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. 30.56/12.85 [2019-03-28 12:30:19,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:30:19 BoogieIcfgContainer 30.56/12.85 [2019-03-28 12:30:19,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 30.56/12.85 [2019-03-28 12:30:19,247 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 30.56/12.85 [2019-03-28 12:30:19,248 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 30.56/12.85 [2019-03-28 12:30:19,250 INFO L276 PluginConnector]: BlockEncodingV2 initialized 30.56/12.85 [2019-03-28 12:30:19,250 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:30:19" (1/1) ... 30.56/12.85 [2019-03-28 12:30:19,266 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 36 edges 30.56/12.85 [2019-03-28 12:30:19,268 INFO L258 BlockEncoder]: Using Remove infeasible edges 30.56/12.85 [2019-03-28 12:30:19,269 INFO L263 BlockEncoder]: Using Maximize final states 30.56/12.85 [2019-03-28 12:30:19,269 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 30.56/12.85 [2019-03-28 12:30:19,269 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 30.56/12.85 [2019-03-28 12:30:19,271 INFO L296 BlockEncoder]: Using Remove sink states 30.56/12.85 [2019-03-28 12:30:19,272 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 30.56/12.85 [2019-03-28 12:30:19,272 INFO L179 BlockEncoder]: Using Rewrite not-equals 30.56/12.85 [2019-03-28 12:30:19,295 INFO L185 BlockEncoder]: Using Use SBE 30.56/12.85 [2019-03-28 12:30:19,325 INFO L200 BlockEncoder]: SBE split 14 edges 30.56/12.85 [2019-03-28 12:30:19,331 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility 30.56/12.85 [2019-03-28 12:30:19,333 INFO L71 MaximizeFinalStates]: 0 new accepting states 30.56/12.85 [2019-03-28 12:30:19,361 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 30.56/12.85 [2019-03-28 12:30:19,363 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states 30.56/12.85 [2019-03-28 12:30:19,365 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 30.56/12.85 [2019-03-28 12:30:19,365 INFO L71 MaximizeFinalStates]: 0 new accepting states 30.56/12.85 [2019-03-28 12:30:19,365 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 30.56/12.85 [2019-03-28 12:30:19,366 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 30.56/12.85 [2019-03-28 12:30:19,366 INFO L313 BlockEncoder]: Encoded RCFG 20 locations, 37 edges 30.56/12.85 [2019-03-28 12:30:19,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:30:19 BasicIcfg 30.56/12.85 [2019-03-28 12:30:19,367 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 30.56/12.85 [2019-03-28 12:30:19,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 30.56/12.85 [2019-03-28 12:30:19,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... 30.56/12.85 [2019-03-28 12:30:19,371 INFO L276 PluginConnector]: TraceAbstraction initialized 30.56/12.85 [2019-03-28 12:30:19,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:30:18" (1/4) ... 30.56/12.85 [2019-03-28 12:30:19,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6db43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:30:19, skipping insertion in model container 30.56/12.85 [2019-03-28 12:30:19,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:30:18" (2/4) ... 30.56/12.85 [2019-03-28 12:30:19,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6db43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:30:19, skipping insertion in model container 30.56/12.85 [2019-03-28 12:30:19,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:30:19" (3/4) ... 30.56/12.85 [2019-03-28 12:30:19,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6db43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:30:19, skipping insertion in model container 30.56/12.85 [2019-03-28 12:30:19,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:30:19" (4/4) ... 30.56/12.85 [2019-03-28 12:30:19,375 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 30.56/12.85 [2019-03-28 12:30:19,385 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 30.56/12.85 [2019-03-28 12:30:19,393 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. 30.56/12.85 [2019-03-28 12:30:19,411 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. 30.56/12.85 [2019-03-28 12:30:19,440 INFO L133 ementStrategyFactory]: Using default assertion order modulation 30.56/12.85 [2019-03-28 12:30:19,441 INFO L382 AbstractCegarLoop]: Interprodecural is true 30.56/12.85 [2019-03-28 12:30:19,441 INFO L383 AbstractCegarLoop]: Hoare is true 30.56/12.85 [2019-03-28 12:30:19,441 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 30.56/12.85 [2019-03-28 12:30:19,441 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 30.56/12.85 [2019-03-28 12:30:19,442 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 30.56/12.85 [2019-03-28 12:30:19,442 INFO L387 AbstractCegarLoop]: Difference is false 30.56/12.85 [2019-03-28 12:30:19,442 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 30.56/12.85 [2019-03-28 12:30:19,442 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 30.56/12.85 [2019-03-28 12:30:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. 30.56/12.85 [2019-03-28 12:30:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 30.56/12.85 [2019-03-28 12:30:19,463 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.85 [2019-03-28 12:30:19,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 30.56/12.85 [2019-03-28 12:30:19,464 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.85 [2019-03-28 12:30:19,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.85 [2019-03-28 12:30:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash 5542340, now seen corresponding path program 1 times 30.56/12.85 [2019-03-28 12:30:19,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.85 [2019-03-28 12:30:19,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.85 [2019-03-28 12:30:19,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:19,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:19,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.85 [2019-03-28 12:30:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.56/12.85 [2019-03-28 12:30:19,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.85 [2019-03-28 12:30:19,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 30.56/12.85 [2019-03-28 12:30:19,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 30.56/12.85 [2019-03-28 12:30:19,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 30.56/12.85 [2019-03-28 12:30:19,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.56/12.85 [2019-03-28 12:30:19,636 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. 30.56/12.85 [2019-03-28 12:30:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.85 [2019-03-28 12:30:19,821 INFO L93 Difference]: Finished difference Result 57 states and 105 transitions. 30.56/12.85 [2019-03-28 12:30:19,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 30.56/12.85 [2019-03-28 12:30:19,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 30.56/12.85 [2019-03-28 12:30:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.85 [2019-03-28 12:30:19,838 INFO L225 Difference]: With dead ends: 57 30.56/12.85 [2019-03-28 12:30:19,838 INFO L226 Difference]: Without dead ends: 39 30.56/12.85 [2019-03-28 12:30:19,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.56/12.85 [2019-03-28 12:30:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. 30.56/12.85 [2019-03-28 12:30:19,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 21. 30.56/12.85 [2019-03-28 12:30:19,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 30.56/12.85 [2019-03-28 12:30:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 40 transitions. 30.56/12.85 [2019-03-28 12:30:19,881 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 40 transitions. Word has length 4 30.56/12.85 [2019-03-28 12:30:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.85 [2019-03-28 12:30:19,882 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 40 transitions. 30.56/12.85 [2019-03-28 12:30:19,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 30.56/12.85 [2019-03-28 12:30:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 40 transitions. 30.56/12.85 [2019-03-28 12:30:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 30.56/12.85 [2019-03-28 12:30:19,882 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.85 [2019-03-28 12:30:19,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 30.56/12.85 [2019-03-28 12:30:19,883 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.85 [2019-03-28 12:30:19,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.85 [2019-03-28 12:30:19,883 INFO L82 PathProgramCache]: Analyzing trace with hash 5543301, now seen corresponding path program 1 times 30.56/12.85 [2019-03-28 12:30:19,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.85 [2019-03-28 12:30:19,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.85 [2019-03-28 12:30:19,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:19,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:19,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.85 [2019-03-28 12:30:19,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.56/12.85 [2019-03-28 12:30:19,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.85 [2019-03-28 12:30:19,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 30.56/12.85 [2019-03-28 12:30:19,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 30.56/12.85 [2019-03-28 12:30:19,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 30.56/12.85 [2019-03-28 12:30:19,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.56/12.85 [2019-03-28 12:30:19,931 INFO L87 Difference]: Start difference. First operand 21 states and 40 transitions. Second operand 3 states. 30.56/12.85 [2019-03-28 12:30:20,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.85 [2019-03-28 12:30:20,008 INFO L93 Difference]: Finished difference Result 21 states and 40 transitions. 30.56/12.85 [2019-03-28 12:30:20,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 30.56/12.85 [2019-03-28 12:30:20,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 30.56/12.85 [2019-03-28 12:30:20,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.85 [2019-03-28 12:30:20,009 INFO L225 Difference]: With dead ends: 21 30.56/12.85 [2019-03-28 12:30:20,009 INFO L226 Difference]: Without dead ends: 20 30.56/12.85 [2019-03-28 12:30:20,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.56/12.85 [2019-03-28 12:30:20,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 30.56/12.85 [2019-03-28 12:30:20,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 30.56/12.85 [2019-03-28 12:30:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 30.56/12.85 [2019-03-28 12:30:20,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 38 transitions. 30.56/12.85 [2019-03-28 12:30:20,014 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 38 transitions. Word has length 4 30.56/12.85 [2019-03-28 12:30:20,015 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.85 [2019-03-28 12:30:20,015 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 38 transitions. 30.56/12.85 [2019-03-28 12:30:20,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 30.56/12.85 [2019-03-28 12:30:20,016 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 38 transitions. 30.56/12.85 [2019-03-28 12:30:20,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 30.56/12.85 [2019-03-28 12:30:20,016 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.85 [2019-03-28 12:30:20,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 30.56/12.85 [2019-03-28 12:30:20,017 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.85 [2019-03-28 12:30:20,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.85 [2019-03-28 12:30:20,017 INFO L82 PathProgramCache]: Analyzing trace with hash 5543303, now seen corresponding path program 1 times 30.56/12.85 [2019-03-28 12:30:20,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.85 [2019-03-28 12:30:20,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.85 [2019-03-28 12:30:20,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.85 [2019-03-28 12:30:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.56/12.85 [2019-03-28 12:30:20,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.85 [2019-03-28 12:30:20,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 30.56/12.85 [2019-03-28 12:30:20,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 30.56/12.85 [2019-03-28 12:30:20,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 30.56/12.85 [2019-03-28 12:30:20,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 30.56/12.85 [2019-03-28 12:30:20,065 INFO L87 Difference]: Start difference. First operand 20 states and 38 transitions. Second operand 4 states. 30.56/12.85 [2019-03-28 12:30:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.85 [2019-03-28 12:30:20,162 INFO L93 Difference]: Finished difference Result 20 states and 38 transitions. 30.56/12.85 [2019-03-28 12:30:20,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 30.56/12.85 [2019-03-28 12:30:20,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 30.56/12.85 [2019-03-28 12:30:20,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.85 [2019-03-28 12:30:20,163 INFO L225 Difference]: With dead ends: 20 30.56/12.85 [2019-03-28 12:30:20,163 INFO L226 Difference]: Without dead ends: 19 30.56/12.85 [2019-03-28 12:30:20,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 30.56/12.85 [2019-03-28 12:30:20,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 30.56/12.85 [2019-03-28 12:30:20,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 30.56/12.85 [2019-03-28 12:30:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 30.56/12.85 [2019-03-28 12:30:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. 30.56/12.85 [2019-03-28 12:30:20,168 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 36 transitions. Word has length 4 30.56/12.85 [2019-03-28 12:30:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.85 [2019-03-28 12:30:20,168 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 36 transitions. 30.56/12.85 [2019-03-28 12:30:20,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 30.56/12.85 [2019-03-28 12:30:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 36 transitions. 30.56/12.85 [2019-03-28 12:30:20,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 30.56/12.85 [2019-03-28 12:30:20,169 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.85 [2019-03-28 12:30:20,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 30.56/12.85 [2019-03-28 12:30:20,169 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.85 [2019-03-28 12:30:20,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.85 [2019-03-28 12:30:20,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1032169743, now seen corresponding path program 1 times 30.56/12.85 [2019-03-28 12:30:20,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.85 [2019-03-28 12:30:20,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.85 [2019-03-28 12:30:20,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.85 [2019-03-28 12:30:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.56/12.85 [2019-03-28 12:30:20,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.85 [2019-03-28 12:30:20,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 30.56/12.85 [2019-03-28 12:30:20,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 30.56/12.85 [2019-03-28 12:30:20,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 30.56/12.85 [2019-03-28 12:30:20,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.56/12.85 [2019-03-28 12:30:20,223 INFO L87 Difference]: Start difference. First operand 19 states and 36 transitions. Second operand 3 states. 30.56/12.85 [2019-03-28 12:30:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.85 [2019-03-28 12:30:20,271 INFO L93 Difference]: Finished difference Result 19 states and 36 transitions. 30.56/12.85 [2019-03-28 12:30:20,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 30.56/12.85 [2019-03-28 12:30:20,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 30.56/12.85 [2019-03-28 12:30:20,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.85 [2019-03-28 12:30:20,272 INFO L225 Difference]: With dead ends: 19 30.56/12.85 [2019-03-28 12:30:20,272 INFO L226 Difference]: Without dead ends: 18 30.56/12.85 [2019-03-28 12:30:20,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.56/12.85 [2019-03-28 12:30:20,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 30.56/12.85 [2019-03-28 12:30:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 30.56/12.85 [2019-03-28 12:30:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 30.56/12.85 [2019-03-28 12:30:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. 30.56/12.85 [2019-03-28 12:30:20,276 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 34 transitions. Word has length 6 30.56/12.85 [2019-03-28 12:30:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.85 [2019-03-28 12:30:20,277 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 34 transitions. 30.56/12.85 [2019-03-28 12:30:20,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 30.56/12.85 [2019-03-28 12:30:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 34 transitions. 30.56/12.85 [2019-03-28 12:30:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 30.56/12.85 [2019-03-28 12:30:20,278 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.85 [2019-03-28 12:30:20,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 30.56/12.85 [2019-03-28 12:30:20,278 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.85 [2019-03-28 12:30:20,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.85 [2019-03-28 12:30:20,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1032169745, now seen corresponding path program 1 times 30.56/12.85 [2019-03-28 12:30:20,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.85 [2019-03-28 12:30:20,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.85 [2019-03-28 12:30:20,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.85 [2019-03-28 12:30:20,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.56/12.85 [2019-03-28 12:30:20,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.85 [2019-03-28 12:30:20,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 30.56/12.85 [2019-03-28 12:30:20,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 30.56/12.85 [2019-03-28 12:30:20,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 30.56/12.85 [2019-03-28 12:30:20,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 30.56/12.85 [2019-03-28 12:30:20,385 INFO L87 Difference]: Start difference. First operand 18 states and 34 transitions. Second operand 6 states. 30.56/12.85 [2019-03-28 12:30:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.85 [2019-03-28 12:30:20,538 INFO L93 Difference]: Finished difference Result 41 states and 71 transitions. 30.56/12.85 [2019-03-28 12:30:20,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 30.56/12.85 [2019-03-28 12:30:20,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 30.56/12.85 [2019-03-28 12:30:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.85 [2019-03-28 12:30:20,539 INFO L225 Difference]: With dead ends: 41 30.56/12.85 [2019-03-28 12:30:20,539 INFO L226 Difference]: Without dead ends: 30 30.56/12.85 [2019-03-28 12:30:20,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 30.56/12.85 [2019-03-28 12:30:20,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 30.56/12.85 [2019-03-28 12:30:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. 30.56/12.85 [2019-03-28 12:30:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 30.56/12.85 [2019-03-28 12:30:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 36 transitions. 30.56/12.85 [2019-03-28 12:30:20,544 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 36 transitions. Word has length 6 30.56/12.85 [2019-03-28 12:30:20,545 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.85 [2019-03-28 12:30:20,545 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 36 transitions. 30.56/12.85 [2019-03-28 12:30:20,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 30.56/12.85 [2019-03-28 12:30:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 36 transitions. 30.56/12.85 [2019-03-28 12:30:20,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 30.56/12.85 [2019-03-28 12:30:20,546 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.85 [2019-03-28 12:30:20,546 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] 30.56/12.85 [2019-03-28 12:30:20,547 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.85 [2019-03-28 12:30:20,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.85 [2019-03-28 12:30:20,547 INFO L82 PathProgramCache]: Analyzing trace with hash -222299495, now seen corresponding path program 1 times 30.56/12.85 [2019-03-28 12:30:20,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.85 [2019-03-28 12:30:20,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.85 [2019-03-28 12:30:20,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.85 [2019-03-28 12:30:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.56/12.85 [2019-03-28 12:30:20,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 30.56/12.85 [2019-03-28 12:30:20,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 30.56/12.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.56/12.85 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 30.56/12.85 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 30.56/12.85 [2019-03-28 12:30:20,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.85 [2019-03-28 12:30:20,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core 30.56/12.85 [2019-03-28 12:30:20,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.56/12.85 [2019-03-28 12:30:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.56/12.85 [2019-03-28 12:30:20,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 30.56/12.85 [2019-03-28 12:30:20,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 30.56/12.85 [2019-03-28 12:30:20,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 30.56/12.85 [2019-03-28 12:30:20,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 30.56/12.85 [2019-03-28 12:30:20,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 30.56/12.85 [2019-03-28 12:30:20,723 INFO L87 Difference]: Start difference. First operand 20 states and 36 transitions. Second operand 7 states. 30.56/12.85 [2019-03-28 12:30:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.85 [2019-03-28 12:30:20,911 INFO L93 Difference]: Finished difference Result 45 states and 77 transitions. 30.56/12.85 [2019-03-28 12:30:20,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 30.56/12.85 [2019-03-28 12:30:20,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 30.56/12.85 [2019-03-28 12:30:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.85 [2019-03-28 12:30:20,913 INFO L225 Difference]: With dead ends: 45 30.56/12.85 [2019-03-28 12:30:20,913 INFO L226 Difference]: Without dead ends: 32 30.56/12.85 [2019-03-28 12:30:20,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 30.56/12.85 [2019-03-28 12:30:20,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 30.56/12.85 [2019-03-28 12:30:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. 30.56/12.85 [2019-03-28 12:30:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 30.56/12.85 [2019-03-28 12:30:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. 30.56/12.85 [2019-03-28 12:30:20,919 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 8 30.56/12.85 [2019-03-28 12:30:20,919 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.85 [2019-03-28 12:30:20,919 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. 30.56/12.85 [2019-03-28 12:30:20,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 30.56/12.85 [2019-03-28 12:30:20,919 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. 30.56/12.85 [2019-03-28 12:30:20,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 30.56/12.85 [2019-03-28 12:30:20,920 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.85 [2019-03-28 12:30:20,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 30.56/12.85 [2019-03-28 12:30:20,921 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.85 [2019-03-28 12:30:20,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.85 [2019-03-28 12:30:20,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1698717933, now seen corresponding path program 1 times 30.56/12.85 [2019-03-28 12:30:20,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.85 [2019-03-28 12:30:20,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.85 [2019-03-28 12:30:20,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.85 [2019-03-28 12:30:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.85 [2019-03-28 12:30:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 30.56/12.85 [2019-03-28 12:30:20,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.85 [2019-03-28 12:30:20,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 30.56/12.85 [2019-03-28 12:30:20,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 30.56/12.85 [2019-03-28 12:30:20,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 30.56/12.85 [2019-03-28 12:30:20,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.56/12.85 [2019-03-28 12:30:20,962 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 3 states. 30.56/12.85 [2019-03-28 12:30:21,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.85 [2019-03-28 12:30:21,005 INFO L93 Difference]: Finished difference Result 26 states and 45 transitions. 30.56/12.85 [2019-03-28 12:30:21,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 30.56/12.85 [2019-03-28 12:30:21,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 30.56/12.85 [2019-03-28 12:30:21,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.85 [2019-03-28 12:30:21,006 INFO L225 Difference]: With dead ends: 26 30.56/12.85 [2019-03-28 12:30:21,007 INFO L226 Difference]: Without dead ends: 23 30.56/12.85 [2019-03-28 12:30:21,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.56/12.86 [2019-03-28 12:30:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 30.56/12.86 [2019-03-28 12:30:21,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 30.56/12.86 [2019-03-28 12:30:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 30.56/12.86 [2019-03-28 12:30:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 39 transitions. 30.56/12.86 [2019-03-28 12:30:21,012 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 39 transitions. Word has length 9 30.56/12.86 [2019-03-28 12:30:21,013 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.86 [2019-03-28 12:30:21,013 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 39 transitions. 30.56/12.86 [2019-03-28 12:30:21,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 30.56/12.86 [2019-03-28 12:30:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 39 transitions. 30.56/12.86 [2019-03-28 12:30:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 30.56/12.86 [2019-03-28 12:30:21,014 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.86 [2019-03-28 12:30:21,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 30.56/12.86 [2019-03-28 12:30:21,014 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.86 [2019-03-28 12:30:21,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:21,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1698717935, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:21,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:21,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:21,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:21,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:21,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:21,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.86 [2019-03-28 12:30:21,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 30.56/12.86 [2019-03-28 12:30:21,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 30.56/12.86 [2019-03-28 12:30:21,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 30.56/12.86 [2019-03-28 12:30:21,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 30.56/12.86 [2019-03-28 12:30:21,093 INFO L87 Difference]: Start difference. First operand 23 states and 39 transitions. Second operand 6 states. 30.56/12.86 [2019-03-28 12:30:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.86 [2019-03-28 12:30:21,173 INFO L93 Difference]: Finished difference Result 24 states and 39 transitions. 30.56/12.86 [2019-03-28 12:30:21,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 30.56/12.86 [2019-03-28 12:30:21,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 30.56/12.86 [2019-03-28 12:30:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.86 [2019-03-28 12:30:21,174 INFO L225 Difference]: With dead ends: 24 30.56/12.86 [2019-03-28 12:30:21,174 INFO L226 Difference]: Without dead ends: 23 30.56/12.86 [2019-03-28 12:30:21,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 30.56/12.86 [2019-03-28 12:30:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 30.56/12.86 [2019-03-28 12:30:21,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 30.56/12.86 [2019-03-28 12:30:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 30.56/12.86 [2019-03-28 12:30:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. 30.56/12.86 [2019-03-28 12:30:21,180 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 9 30.56/12.86 [2019-03-28 12:30:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.86 [2019-03-28 12:30:21,180 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. 30.56/12.86 [2019-03-28 12:30:21,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 30.56/12.86 [2019-03-28 12:30:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. 30.56/12.86 [2019-03-28 12:30:21,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 30.56/12.86 [2019-03-28 12:30:21,181 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.86 [2019-03-28 12:30:21,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 30.56/12.86 [2019-03-28 12:30:21,181 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.86 [2019-03-28 12:30:21,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:21,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1698717936, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:21,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:21,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:21,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:21,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:21,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:21,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.86 [2019-03-28 12:30:21,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 30.56/12.86 [2019-03-28 12:30:21,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 30.56/12.86 [2019-03-28 12:30:21,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 30.56/12.86 [2019-03-28 12:30:21,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 30.56/12.86 [2019-03-28 12:30:21,224 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 4 states. 30.56/12.86 [2019-03-28 12:30:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.86 [2019-03-28 12:30:21,305 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. 30.56/12.86 [2019-03-28 12:30:21,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 30.56/12.86 [2019-03-28 12:30:21,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 30.56/12.86 [2019-03-28 12:30:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.86 [2019-03-28 12:30:21,306 INFO L225 Difference]: With dead ends: 23 30.56/12.86 [2019-03-28 12:30:21,306 INFO L226 Difference]: Without dead ends: 22 30.56/12.86 [2019-03-28 12:30:21,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 30.56/12.86 [2019-03-28 12:30:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 30.56/12.86 [2019-03-28 12:30:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 30.56/12.86 [2019-03-28 12:30:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 30.56/12.86 [2019-03-28 12:30:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. 30.56/12.86 [2019-03-28 12:30:21,314 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 37 transitions. Word has length 9 30.56/12.86 [2019-03-28 12:30:21,315 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.86 [2019-03-28 12:30:21,315 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 37 transitions. 30.56/12.86 [2019-03-28 12:30:21,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 30.56/12.86 [2019-03-28 12:30:21,315 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. 30.56/12.86 [2019-03-28 12:30:21,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 30.56/12.86 [2019-03-28 12:30:21,316 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.86 [2019-03-28 12:30:21,316 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] 30.56/12.86 [2019-03-28 12:30:21,316 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.86 [2019-03-28 12:30:21,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:21,316 INFO L82 PathProgramCache]: Analyzing trace with hash 899371689, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:21,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:21,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:21,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:21,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:21,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:21,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 30.56/12.86 [2019-03-28 12:30:21,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 30.56/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.56/12.86 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 30.56/12.86 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 30.56/12.86 [2019-03-28 12:30:21,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:21,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core 30.56/12.86 [2019-03-28 12:30:21,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.56/12.86 [2019-03-28 12:30:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:21,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 30.56/12.86 [2019-03-28 12:30:21,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 30.56/12.86 [2019-03-28 12:30:21,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 30.56/12.86 [2019-03-28 12:30:21,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 30.56/12.86 [2019-03-28 12:30:21,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 30.56/12.86 [2019-03-28 12:30:21,394 INFO L87 Difference]: Start difference. First operand 22 states and 37 transitions. Second operand 4 states. 30.56/12.86 [2019-03-28 12:30:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.86 [2019-03-28 12:30:21,488 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. 30.56/12.86 [2019-03-28 12:30:21,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 30.56/12.86 [2019-03-28 12:30:21,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 30.56/12.86 [2019-03-28 12:30:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.86 [2019-03-28 12:30:21,489 INFO L225 Difference]: With dead ends: 52 30.56/12.86 [2019-03-28 12:30:21,489 INFO L226 Difference]: Without dead ends: 39 30.56/12.86 [2019-03-28 12:30:21,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 30.56/12.86 [2019-03-28 12:30:21,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. 30.56/12.86 [2019-03-28 12:30:21,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 23. 30.56/12.86 [2019-03-28 12:30:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 30.56/12.86 [2019-03-28 12:30:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. 30.56/12.86 [2019-03-28 12:30:21,494 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 40 transitions. Word has length 9 30.56/12.86 [2019-03-28 12:30:21,495 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.86 [2019-03-28 12:30:21,495 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 40 transitions. 30.56/12.86 [2019-03-28 12:30:21,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 30.56/12.86 [2019-03-28 12:30:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 40 transitions. 30.56/12.86 [2019-03-28 12:30:21,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 30.56/12.86 [2019-03-28 12:30:21,496 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.86 [2019-03-28 12:30:21,496 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] 30.56/12.86 [2019-03-28 12:30:21,496 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.86 [2019-03-28 12:30:21,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:21,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1786875370, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:21,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:21,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:21,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:21,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:21,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:21,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 30.56/12.86 [2019-03-28 12:30:21,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 30.56/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.56/12.86 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 30.56/12.86 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 30.56/12.86 [2019-03-28 12:30:21,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:21,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core 30.56/12.86 [2019-03-28 12:30:21,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.56/12.86 [2019-03-28 12:30:21,632 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 30.56/12.86 [2019-03-28 12:30:21,633 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 30.56/12.86 [2019-03-28 12:30:21,642 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 30.56/12.86 [2019-03-28 12:30:21,651 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 30.56/12.86 [2019-03-28 12:30:21,652 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 30.56/12.86 [2019-03-28 12:30:21,662 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 30.56/12.86 [2019-03-28 12:30:21,663 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 30.56/12.86 [2019-03-28 12:30:21,663 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:25 30.56/12.86 [2019-03-28 12:30:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:21,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 30.56/12.86 [2019-03-28 12:30:21,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 8 30.56/12.86 [2019-03-28 12:30:21,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 30.56/12.86 [2019-03-28 12:30:21,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 30.56/12.86 [2019-03-28 12:30:21,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 30.56/12.86 [2019-03-28 12:30:21,768 INFO L87 Difference]: Start difference. First operand 23 states and 40 transitions. Second operand 9 states. 30.56/12.86 [2019-03-28 12:30:22,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.86 [2019-03-28 12:30:22,107 INFO L93 Difference]: Finished difference Result 44 states and 69 transitions. 30.56/12.86 [2019-03-28 12:30:22,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 30.56/12.86 [2019-03-28 12:30:22,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 30.56/12.86 [2019-03-28 12:30:22,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.86 [2019-03-28 12:30:22,109 INFO L225 Difference]: With dead ends: 44 30.56/12.86 [2019-03-28 12:30:22,109 INFO L226 Difference]: Without dead ends: 37 30.56/12.86 [2019-03-28 12:30:22,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 30.56/12.86 [2019-03-28 12:30:22,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. 30.56/12.86 [2019-03-28 12:30:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. 30.56/12.86 [2019-03-28 12:30:22,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 30.56/12.86 [2019-03-28 12:30:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 41 transitions. 30.56/12.86 [2019-03-28 12:30:22,116 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 41 transitions. Word has length 9 30.56/12.86 [2019-03-28 12:30:22,116 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.86 [2019-03-28 12:30:22,116 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 41 transitions. 30.56/12.86 [2019-03-28 12:30:22,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 30.56/12.86 [2019-03-28 12:30:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 41 transitions. 30.56/12.86 [2019-03-28 12:30:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 30.56/12.86 [2019-03-28 12:30:22,117 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.86 [2019-03-28 12:30:22,117 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] 30.56/12.86 [2019-03-28 12:30:22,117 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.86 [2019-03-28 12:30:22,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:22,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1786875371, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:22,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:22,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:22,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:22,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.86 [2019-03-28 12:30:22,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 30.56/12.86 [2019-03-28 12:30:22,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 30.56/12.86 [2019-03-28 12:30:22,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 30.56/12.86 [2019-03-28 12:30:22,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.56/12.86 [2019-03-28 12:30:22,146 INFO L87 Difference]: Start difference. First operand 25 states and 41 transitions. Second operand 3 states. 30.56/12.86 [2019-03-28 12:30:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.86 [2019-03-28 12:30:22,199 INFO L93 Difference]: Finished difference Result 25 states and 41 transitions. 30.56/12.86 [2019-03-28 12:30:22,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 30.56/12.86 [2019-03-28 12:30:22,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 30.56/12.86 [2019-03-28 12:30:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.86 [2019-03-28 12:30:22,201 INFO L225 Difference]: With dead ends: 25 30.56/12.86 [2019-03-28 12:30:22,201 INFO L226 Difference]: Without dead ends: 24 30.56/12.86 [2019-03-28 12:30:22,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.56/12.86 [2019-03-28 12:30:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 30.56/12.86 [2019-03-28 12:30:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 30.56/12.86 [2019-03-28 12:30:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 30.56/12.86 [2019-03-28 12:30:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 40 transitions. 30.56/12.86 [2019-03-28 12:30:22,207 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 40 transitions. Word has length 9 30.56/12.86 [2019-03-28 12:30:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.86 [2019-03-28 12:30:22,207 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 40 transitions. 30.56/12.86 [2019-03-28 12:30:22,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 30.56/12.86 [2019-03-28 12:30:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 40 transitions. 30.56/12.86 [2019-03-28 12:30:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 30.56/12.86 [2019-03-28 12:30:22,208 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.86 [2019-03-28 12:30:22,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 30.56/12.86 [2019-03-28 12:30:22,209 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.86 [2019-03-28 12:30:22,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:22,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1120646875, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:22,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:22,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:22,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:22,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.86 [2019-03-28 12:30:22,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 30.56/12.86 [2019-03-28 12:30:22,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 30.56/12.86 [2019-03-28 12:30:22,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 30.56/12.86 [2019-03-28 12:30:22,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 30.56/12.86 [2019-03-28 12:30:22,239 INFO L87 Difference]: Start difference. First operand 24 states and 40 transitions. Second operand 4 states. 30.56/12.86 [2019-03-28 12:30:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.86 [2019-03-28 12:30:22,323 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. 30.56/12.86 [2019-03-28 12:30:22,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 30.56/12.86 [2019-03-28 12:30:22,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 30.56/12.86 [2019-03-28 12:30:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.86 [2019-03-28 12:30:22,325 INFO L225 Difference]: With dead ends: 28 30.56/12.86 [2019-03-28 12:30:22,325 INFO L226 Difference]: Without dead ends: 27 30.56/12.86 [2019-03-28 12:30:22,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 30.56/12.86 [2019-03-28 12:30:22,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 30.56/12.86 [2019-03-28 12:30:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. 30.56/12.86 [2019-03-28 12:30:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 30.56/12.86 [2019-03-28 12:30:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. 30.56/12.86 [2019-03-28 12:30:22,331 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 10 30.56/12.86 [2019-03-28 12:30:22,331 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.86 [2019-03-28 12:30:22,331 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. 30.56/12.86 [2019-03-28 12:30:22,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 30.56/12.86 [2019-03-28 12:30:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. 30.56/12.86 [2019-03-28 12:30:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 30.56/12.86 [2019-03-28 12:30:22,332 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.86 [2019-03-28 12:30:22,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 30.56/12.86 [2019-03-28 12:30:22,332 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.86 [2019-03-28 12:30:22,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:22,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1120646876, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:22,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:22,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:22,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:22,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.86 [2019-03-28 12:30:22,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 30.56/12.86 [2019-03-28 12:30:22,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 30.56/12.86 [2019-03-28 12:30:22,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 30.56/12.86 [2019-03-28 12:30:22,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 30.56/12.86 [2019-03-28 12:30:22,361 INFO L87 Difference]: Start difference. First operand 24 states and 39 transitions. Second operand 4 states. 30.56/12.86 [2019-03-28 12:30:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.86 [2019-03-28 12:30:22,400 INFO L93 Difference]: Finished difference Result 24 states and 39 transitions. 30.56/12.86 [2019-03-28 12:30:22,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 30.56/12.86 [2019-03-28 12:30:22,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 30.56/12.86 [2019-03-28 12:30:22,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.86 [2019-03-28 12:30:22,402 INFO L225 Difference]: With dead ends: 24 30.56/12.86 [2019-03-28 12:30:22,402 INFO L226 Difference]: Without dead ends: 15 30.56/12.86 [2019-03-28 12:30:22,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 30.56/12.86 [2019-03-28 12:30:22,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. 30.56/12.86 [2019-03-28 12:30:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. 30.56/12.86 [2019-03-28 12:30:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 30.56/12.86 [2019-03-28 12:30:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. 30.56/12.86 [2019-03-28 12:30:22,406 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 10 30.56/12.86 [2019-03-28 12:30:22,406 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.86 [2019-03-28 12:30:22,406 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. 30.56/12.86 [2019-03-28 12:30:22,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 30.56/12.86 [2019-03-28 12:30:22,406 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. 30.56/12.86 [2019-03-28 12:30:22,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 30.56/12.86 [2019-03-28 12:30:22,407 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.86 [2019-03-28 12:30:22,407 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 30.56/12.86 [2019-03-28 12:30:22,407 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.86 [2019-03-28 12:30:22,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:22,408 INFO L82 PathProgramCache]: Analyzing trace with hash 980196670, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:22,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:22,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:22,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:22,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:22,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.86 [2019-03-28 12:30:22,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 30.56/12.86 [2019-03-28 12:30:22,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 30.56/12.86 [2019-03-28 12:30:22,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 30.56/12.86 [2019-03-28 12:30:22,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 30.56/12.86 [2019-03-28 12:30:22,458 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 5 states. 30.56/12.86 [2019-03-28 12:30:22,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.86 [2019-03-28 12:30:22,505 INFO L93 Difference]: Finished difference Result 18 states and 29 transitions. 30.56/12.86 [2019-03-28 12:30:22,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 30.56/12.86 [2019-03-28 12:30:22,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 30.56/12.86 [2019-03-28 12:30:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.86 [2019-03-28 12:30:22,506 INFO L225 Difference]: With dead ends: 18 30.56/12.86 [2019-03-28 12:30:22,506 INFO L226 Difference]: Without dead ends: 17 30.56/12.86 [2019-03-28 12:30:22,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 30.56/12.86 [2019-03-28 12:30:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 30.56/12.86 [2019-03-28 12:30:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. 30.56/12.86 [2019-03-28 12:30:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 30.56/12.86 [2019-03-28 12:30:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. 30.56/12.86 [2019-03-28 12:30:22,511 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 28 transitions. Word has length 12 30.56/12.86 [2019-03-28 12:30:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.86 [2019-03-28 12:30:22,512 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 28 transitions. 30.56/12.86 [2019-03-28 12:30:22,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 30.56/12.86 [2019-03-28 12:30:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 28 transitions. 30.56/12.86 [2019-03-28 12:30:22,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 30.56/12.86 [2019-03-28 12:30:22,512 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.86 [2019-03-28 12:30:22,513 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 30.56/12.86 [2019-03-28 12:30:22,513 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.86 [2019-03-28 12:30:22,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:22,513 INFO L82 PathProgramCache]: Analyzing trace with hash 980196669, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:22,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:22,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:22,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:22,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.86 [2019-03-28 12:30:22,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 30.56/12.86 [2019-03-28 12:30:22,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 30.56/12.86 [2019-03-28 12:30:22,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 30.56/12.86 [2019-03-28 12:30:22,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 30.56/12.86 [2019-03-28 12:30:22,565 INFO L87 Difference]: Start difference. First operand 16 states and 28 transitions. Second operand 5 states. 30.56/12.86 [2019-03-28 12:30:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.86 [2019-03-28 12:30:22,625 INFO L93 Difference]: Finished difference Result 17 states and 28 transitions. 30.56/12.86 [2019-03-28 12:30:22,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 30.56/12.86 [2019-03-28 12:30:22,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 30.56/12.86 [2019-03-28 12:30:22,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.86 [2019-03-28 12:30:22,626 INFO L225 Difference]: With dead ends: 17 30.56/12.86 [2019-03-28 12:30:22,626 INFO L226 Difference]: Without dead ends: 16 30.56/12.86 [2019-03-28 12:30:22,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 30.56/12.86 [2019-03-28 12:30:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 30.56/12.86 [2019-03-28 12:30:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 30.56/12.86 [2019-03-28 12:30:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 30.56/12.86 [2019-03-28 12:30:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. 30.56/12.86 [2019-03-28 12:30:22,631 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 12 30.56/12.86 [2019-03-28 12:30:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.86 [2019-03-28 12:30:22,631 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. 30.56/12.86 [2019-03-28 12:30:22,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 30.56/12.86 [2019-03-28 12:30:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. 30.56/12.86 [2019-03-28 12:30:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 30.56/12.86 [2019-03-28 12:30:22,632 INFO L394 BasicCegarLoop]: Found error trace 30.56/12.86 [2019-03-28 12:30:22,632 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 30.56/12.86 [2019-03-28 12:30:22,632 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 30.56/12.86 [2019-03-28 12:30:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:22,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1371175179, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:22,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:22,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:22,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:22,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.86 [2019-03-28 12:30:22,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 30.56/12.86 [2019-03-28 12:30:22,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 30.56/12.86 [2019-03-28 12:30:22,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 30.56/12.86 [2019-03-28 12:30:22,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.56/12.86 [2019-03-28 12:30:22,659 INFO L87 Difference]: Start difference. First operand 16 states and 26 transitions. Second operand 3 states. 30.56/12.86 [2019-03-28 12:30:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.86 [2019-03-28 12:30:22,692 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. 30.56/12.86 [2019-03-28 12:30:22,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 30.56/12.86 [2019-03-28 12:30:22,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 30.56/12.86 [2019-03-28 12:30:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.56/12.86 [2019-03-28 12:30:22,693 INFO L225 Difference]: With dead ends: 16 30.56/12.86 [2019-03-28 12:30:22,694 INFO L226 Difference]: Without dead ends: 0 30.56/12.86 [2019-03-28 12:30:22,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.56/12.86 [2019-03-28 12:30:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 30.56/12.86 [2019-03-28 12:30:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 30.56/12.86 [2019-03-28 12:30:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 30.56/12.86 [2019-03-28 12:30:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 30.56/12.86 [2019-03-28 12:30:22,695 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 30.56/12.86 [2019-03-28 12:30:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. 30.56/12.86 [2019-03-28 12:30:22,695 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 30.56/12.86 [2019-03-28 12:30:22,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 30.56/12.86 [2019-03-28 12:30:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 30.56/12.86 [2019-03-28 12:30:22,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 30.56/12.86 [2019-03-28 12:30:22,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 30.56/12.86 [2019-03-28 12:30:22,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 30.56/12.86 [2019-03-28 12:30:22,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 30.56/12.86 [2019-03-28 12:30:22,970 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 30.56/12.86 [2019-03-28 12:30:23,218 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 30.56/12.86 [2019-03-28 12:30:23,221 INFO L448 ceAbstractionStarter]: For program point L640(line 640) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,363 INFO L448 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,363 INFO L448 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,363 INFO L448 ceAbstractionStarter]: For program point L626(line 626) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,363 INFO L448 ceAbstractionStarter]: For program point L622(lines 622 629) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,363 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 628) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 628) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 626) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 626) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 638) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 638) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,365 INFO L444 ceAbstractionStarter]: At program point L633-2(lines 633 635) the Hoare annotation is: (or (and (<= 1 ~n~0) (= ~a~0.offset 0)) (<= 2 ~n~0)) 30.56/12.86 [2019-03-28 12:30:23,365 INFO L448 ceAbstractionStarter]: For program point L633-3(lines 633 635) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 640) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 640) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 640) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 640) no Hoare annotation was computed. 30.56/12.86 [2019-03-28 12:30:23,366 INFO L444 ceAbstractionStarter]: At program point L627-2(lines 627 628) the Hoare annotation is: (let ((.cse9 (select |#length| ~b~0.base)) (.cse10 (select |#length| ~a~0.base)) (.cse8 (* 4 ~n~0))) (let ((.cse0 (= 1 (select |#valid| ~b~0.base))) (.cse6 (* 4 ULTIMATE.start_foo_~i~0)) (.cse1 (= .cse10 .cse8)) (.cse2 (= .cse9 .cse8)) (.cse3 (= ~a~0.offset 0)) (.cse4 (= 1 (select |#valid| ~a~0.base))) (.cse7 (<= 4 ~b~0.offset))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((~n~0 Int) (|ULTIMATE.start_main_#t~post6.base| Int)) (let ((.cse5 (* 4 ~n~0))) (and (= .cse5 (select |#length| ~a~0.base)) (= .cse5 (select |#length| |ULTIMATE.start_main_#t~post6.base|)) (not (= ~a~0.base |ULTIMATE.start_main_#t~post6.base|)) (<= 2 ~n~0)))) (<= 4 (+ .cse6 ~b~0.offset)) .cse7 (<= (+ .cse8 ~b~0.offset) (+ .cse9 4))) (and .cse0 (<= (+ .cse6 4) .cse10) .cse1 .cse2 (<= 0 ULTIMATE.start_foo_~i~0) .cse3 (<= ~n~0 1) .cse4 .cse7 (<= ~b~0.offset .cse8))))) 30.56/12.86 [2019-03-28 12:30:23,366 INFO L444 ceAbstractionStarter]: At program point L625-2(lines 625 626) the Hoare annotation is: (let ((.cse9 (select |#length| ~b~0.base)) (.cse6 (* 4 ~n~0))) (let ((.cse0 (= 1 (select |#valid| ~b~0.base))) (.cse1 (= .cse9 .cse6)) (.cse2 (= (select |#length| ~a~0.base) .cse6)) (.cse3 (= ~a~0.offset 0)) (.cse4 (= 1 (select |#valid| ~a~0.base))) (.cse7 (exists ((~n~0 Int) (|ULTIMATE.start_main_#t~post6.base| Int)) (let ((.cse10 (* 4 ~n~0))) (and (= .cse10 (select |#length| ~a~0.base)) (= .cse10 (select |#length| |ULTIMATE.start_main_#t~post6.base|)) (not (= ~a~0.base |ULTIMATE.start_main_#t~post6.base|)) (<= 2 ~n~0))))) (.cse5 (<= 4 ~b~0.offset)) (.cse8 (<= (+ .cse6 ~b~0.offset) (+ .cse9 4)))) (or (and .cse0 .cse1 .cse2 (<= 0 ULTIMATE.start_foo_~i~0) .cse3 (<= ~n~0 1) .cse4 .cse5 (<= ~b~0.offset .cse6)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 4 (+ ~a~0.offset (* 4 ULTIMATE.start_foo_~i~0))) .cse7 .cse5 .cse8) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_foo_~i~0) .cse3 .cse4 .cse7 .cse5 .cse8)))) 30.56/12.86 [2019-03-28 12:30:23,367 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 30.56/12.86 [2019-03-28 12:30:23,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,398 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,399 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,399 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:23,410 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,410 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:23,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:30:23 BasicIcfg 30.56/12.86 [2019-03-28 12:30:23,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 30.56/12.86 [2019-03-28 12:30:23,416 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 30.56/12.86 [2019-03-28 12:30:23,416 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 30.56/12.86 [2019-03-28 12:30:23,420 INFO L276 PluginConnector]: BuchiAutomizer initialized 30.56/12.86 [2019-03-28 12:30:23,421 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.56/12.86 [2019-03-28 12:30:23,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:30:18" (1/5) ... 30.56/12.86 [2019-03-28 12:30:23,422 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7cff6ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:30:23, skipping insertion in model container 30.56/12.86 [2019-03-28 12:30:23,422 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.56/12.86 [2019-03-28 12:30:23,422 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:30:18" (2/5) ... 30.56/12.86 [2019-03-28 12:30:23,422 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7cff6ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:30:23, skipping insertion in model container 30.56/12.86 [2019-03-28 12:30:23,422 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.56/12.86 [2019-03-28 12:30:23,422 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:30:19" (3/5) ... 30.56/12.86 [2019-03-28 12:30:23,423 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7cff6ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:30:23, skipping insertion in model container 30.56/12.86 [2019-03-28 12:30:23,423 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.56/12.86 [2019-03-28 12:30:23,423 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:30:19" (4/5) ... 30.56/12.86 [2019-03-28 12:30:23,423 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7cff6ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:30:23, skipping insertion in model container 30.56/12.86 [2019-03-28 12:30:23,423 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.56/12.86 [2019-03-28 12:30:23,423 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:30:23" (5/5) ... 30.56/12.86 [2019-03-28 12:30:23,425 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 30.56/12.86 [2019-03-28 12:30:23,448 INFO L133 ementStrategyFactory]: Using default assertion order modulation 30.56/12.86 [2019-03-28 12:30:23,449 INFO L374 BuchiCegarLoop]: Interprodecural is true 30.56/12.86 [2019-03-28 12:30:23,449 INFO L375 BuchiCegarLoop]: Hoare is true 30.56/12.86 [2019-03-28 12:30:23,449 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 30.56/12.86 [2019-03-28 12:30:23,449 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 30.56/12.86 [2019-03-28 12:30:23,449 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 30.56/12.86 [2019-03-28 12:30:23,449 INFO L379 BuchiCegarLoop]: Difference is false 30.56/12.86 [2019-03-28 12:30:23,449 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 30.56/12.86 [2019-03-28 12:30:23,449 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 30.56/12.86 [2019-03-28 12:30:23,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. 30.56/12.86 [2019-03-28 12:30:23,463 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 30.56/12.86 [2019-03-28 12:30:23,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.56/12.86 [2019-03-28 12:30:23,464 INFO L119 BuchiIsEmpty]: Starting construction of run 30.56/12.86 [2019-03-28 12:30:23,468 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 30.56/12.86 [2019-03-28 12:30:23,468 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 30.56/12.86 [2019-03-28 12:30:23,468 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 30.56/12.86 [2019-03-28 12:30:23,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. 30.56/12.86 [2019-03-28 12:30:23,470 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 30.56/12.86 [2019-03-28 12:30:23,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.56/12.86 [2019-03-28 12:30:23,470 INFO L119 BuchiIsEmpty]: Starting construction of run 30.56/12.86 [2019-03-28 12:30:23,470 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 30.56/12.86 [2019-03-28 12:30:23,470 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 30.56/12.86 [2019-03-28 12:30:23,475 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 v_~a~0.offset_7) (= 0 v_~b~0.base_15) (= 0 v_~a~0.base_8) (= v_~n~0_16 1) (= |v_#NULL.offset_2| 0) (= v_~b~0.offset_12 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_23| 0 0) |v_#valid_22|)) InVars {#valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 5#L633-2true 30.56/12.86 [2019-03-28 12:30:23,476 INFO L796 eck$LassoCheckResult]: Loop: 5#L633-2true [123] L633-2-->L633-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (= (+ v_~n~0_5 1) v_~n~0_4) (< v_~n~0_5 30)) InVars {~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ~n~0] 5#L633-2true 30.56/12.86 [2019-03-28 12:30:23,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:23,477 INFO L82 PathProgramCache]: Analyzing trace with hash 182, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:23,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:23,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:23,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:23,501 INFO L82 PathProgramCache]: Analyzing trace with hash 154, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:23,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:23,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:23,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:23,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:23,506 INFO L82 PathProgramCache]: Analyzing trace with hash 5765, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:23,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:23,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:23,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:23,542 INFO L216 LassoAnalysis]: Preferences: 30.56/12.86 [2019-03-28 12:30:23,543 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.56/12.86 [2019-03-28 12:30:23,543 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.56/12.86 [2019-03-28 12:30:23,544 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.56/12.86 [2019-03-28 12:30:23,544 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.56/12.86 [2019-03-28 12:30:23,544 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.56/12.86 [2019-03-28 12:30:23,544 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.56/12.86 [2019-03-28 12:30:23,544 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.56/12.86 [2019-03-28 12:30:23,544 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 30.56/12.86 [2019-03-28 12:30:23,545 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.56/12.86 [2019-03-28 12:30:23,545 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.56/12.86 [2019-03-28 12:30:23,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:23,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:23,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:23,611 INFO L300 LassoAnalysis]: Preprocessing complete. 30.56/12.86 [2019-03-28 12:30:23,612 INFO L412 LassoAnalysis]: Checking for nontermination... 30.56/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.56/12.86 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.56/12.86 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.56/12.86 [2019-03-28 12:30:23,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.56/12.86 [2019-03-28 12:30:23,620 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.56/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.56/12.86 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.56/12.86 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.56/12.86 [2019-03-28 12:30:23,656 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.56/12.86 [2019-03-28 12:30:23,656 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.56/12.86 [2019-03-28 12:30:23,689 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.56/12.86 [2019-03-28 12:30:23,691 INFO L216 LassoAnalysis]: Preferences: 30.56/12.86 [2019-03-28 12:30:23,691 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.56/12.86 [2019-03-28 12:30:23,692 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.56/12.86 [2019-03-28 12:30:23,692 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.56/12.86 [2019-03-28 12:30:23,692 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.56/12.86 [2019-03-28 12:30:23,692 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.56/12.86 [2019-03-28 12:30:23,692 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.56/12.86 [2019-03-28 12:30:23,692 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.56/12.86 [2019-03-28 12:30:23,692 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 30.56/12.86 [2019-03-28 12:30:23,692 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.56/12.86 [2019-03-28 12:30:23,693 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.56/12.86 [2019-03-28 12:30:23,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:23,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:23,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:23,726 INFO L300 LassoAnalysis]: Preprocessing complete. 30.56/12.86 [2019-03-28 12:30:23,732 INFO L497 LassoAnalysis]: Using template 'affine'. 30.56/12.86 [2019-03-28 12:30:23,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.56/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.56/12.86 Number of strict supporting invariants: 0 30.56/12.86 Number of non-strict supporting invariants: 1 30.56/12.86 Consider only non-deceasing supporting invariants: true 30.56/12.86 Simplify termination arguments: true 30.56/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.56/12.86 [2019-03-28 12:30:23,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.56/12.86 [2019-03-28 12:30:23,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.56/12.86 [2019-03-28 12:30:23,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.56/12.86 [2019-03-28 12:30:23,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.56/12.86 [2019-03-28 12:30:23,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.56/12.86 [2019-03-28 12:30:23,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.56/12.86 [2019-03-28 12:30:23,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.56/12.86 [2019-03-28 12:30:23,743 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.56/12.86 [2019-03-28 12:30:23,749 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 30.56/12.86 [2019-03-28 12:30:23,749 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 30.56/12.86 [2019-03-28 12:30:23,751 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.56/12.86 [2019-03-28 12:30:23,751 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.56/12.86 [2019-03-28 12:30:23,752 INFO L518 LassoAnalysis]: Proved termination. 30.56/12.86 [2019-03-28 12:30:23,753 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.56/12.86 Ranking function f(~n~0) = -2*~n~0 + 59 30.56/12.86 Supporting invariants [] 30.56/12.86 [2019-03-28 12:30:23,754 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.56/12.86 [2019-03-28 12:30:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:23,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core 30.56/12.86 [2019-03-28 12:30:23,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.56/12.86 [2019-03-28 12:30:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:23,795 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core 30.56/12.86 [2019-03-28 12:30:23,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.56/12.86 [2019-03-28 12:30:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:23,798 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 30.56/12.86 [2019-03-28 12:30:23,802 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 1 loop predicates 30.56/12.86 [2019-03-28 12:30:23,803 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states. Second operand 2 states. 30.56/12.86 [2019-03-28 12:30:23,943 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states.. Second operand 2 states. Result 39 states and 77 transitions. Complement of second has 4 states. 30.56/12.86 [2019-03-28 12:30:23,943 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 30.56/12.86 [2019-03-28 12:30:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. 30.56/12.86 [2019-03-28 12:30:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. 30.56/12.86 [2019-03-28 12:30:23,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 1 letters. Loop has 1 letters. 30.56/12.86 [2019-03-28 12:30:23,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.56/12.86 [2019-03-28 12:30:23,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 2 letters. Loop has 1 letters. 30.56/12.86 [2019-03-28 12:30:23,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.56/12.86 [2019-03-28 12:30:23,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 1 letters. Loop has 2 letters. 30.56/12.86 [2019-03-28 12:30:23,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.56/12.86 [2019-03-28 12:30:23,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 77 transitions. 30.56/12.86 [2019-03-28 12:30:23,955 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 30.56/12.86 [2019-03-28 12:30:23,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 9 states and 19 transitions. 30.56/12.86 [2019-03-28 12:30:23,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 30.56/12.86 [2019-03-28 12:30:23,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 30.56/12.86 [2019-03-28 12:30:23,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 19 transitions. 30.56/12.86 [2019-03-28 12:30:23,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 30.56/12.86 [2019-03-28 12:30:23,958 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 19 transitions. 30.56/12.86 [2019-03-28 12:30:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 19 transitions. 30.56/12.86 [2019-03-28 12:30:23,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. 30.56/12.86 [2019-03-28 12:30:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 30.56/12.86 [2019-03-28 12:30:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. 30.56/12.86 [2019-03-28 12:30:23,960 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 19 transitions. 30.56/12.86 [2019-03-28 12:30:23,960 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 19 transitions. 30.56/12.86 [2019-03-28 12:30:23,961 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 30.56/12.86 [2019-03-28 12:30:23,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 19 transitions. 30.56/12.86 [2019-03-28 12:30:23,961 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 30.56/12.86 [2019-03-28 12:30:23,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.56/12.86 [2019-03-28 12:30:23,961 INFO L119 BuchiIsEmpty]: Starting construction of run 30.56/12.86 [2019-03-28 12:30:23,962 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 30.56/12.86 [2019-03-28 12:30:23,962 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 30.56/12.86 [2019-03-28 12:30:23,963 INFO L794 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 v_~a~0.offset_7) (= 0 v_~b~0.base_15) (= 0 v_~a~0.base_8) (= v_~n~0_16 1) (= |v_#NULL.offset_2| 0) (= v_~b~0.offset_12 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_23| 0 0) |v_#valid_22|)) InVars {#valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 92#L633-2 [122] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 94#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* 4 v_~n~0_6))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 89#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19)) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 90#L625-2 30.56/12.86 [2019-03-28 12:30:23,963 INFO L796 eck$LassoCheckResult]: Loop: 90#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 93#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (let ((.cse1 (+ .cse0 v_~a~0.offset_8))) (and (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= (select |v_#valid_25| v_~a~0.base_9) 1) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) .cse1 v_~n~0_20))) (<= 0 .cse1)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 90#L625-2 30.56/12.86 [2019-03-28 12:30:23,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:23,963 INFO L82 PathProgramCache]: Analyzing trace with hash 5543293, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:23,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:23,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:23,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:23,977 INFO L82 PathProgramCache]: Analyzing trace with hash 3657, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:23,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:23,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:23,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:23,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:23,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1032139973, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:23,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:23,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:23,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:24,231 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 30.56/12.86 [2019-03-28 12:30:24,284 INFO L216 LassoAnalysis]: Preferences: 30.56/12.86 [2019-03-28 12:30:24,284 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.56/12.86 [2019-03-28 12:30:24,284 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.56/12.86 [2019-03-28 12:30:24,284 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.56/12.86 [2019-03-28 12:30:24,284 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.56/12.86 [2019-03-28 12:30:24,284 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.56/12.86 [2019-03-28 12:30:24,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.56/12.86 [2019-03-28 12:30:24,285 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.56/12.86 [2019-03-28 12:30:24,285 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 30.56/12.86 [2019-03-28 12:30:24,285 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.56/12.86 [2019-03-28 12:30:24,285 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.56/12.86 [2019-03-28 12:30:24,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:24,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:24,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:24,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:24,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:24,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:24,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:24,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:24,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:24,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:24,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:24,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:24,650 INFO L300 LassoAnalysis]: Preprocessing complete. 30.56/12.86 [2019-03-28 12:30:24,650 INFO L497 LassoAnalysis]: Using template 'affine'. 30.56/12.86 [2019-03-28 12:30:24,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.56/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.56/12.86 Number of strict supporting invariants: 0 30.56/12.86 Number of non-strict supporting invariants: 1 30.56/12.86 Consider only non-deceasing supporting invariants: true 30.56/12.86 Simplify termination arguments: true 30.56/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.56/12.86 [2019-03-28 12:30:24,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.56/12.86 [2019-03-28 12:30:24,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.56/12.86 [2019-03-28 12:30:24,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.56/12.86 [2019-03-28 12:30:24,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.56/12.86 [2019-03-28 12:30:24,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.56/12.86 [2019-03-28 12:30:24,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.56/12.86 [2019-03-28 12:30:24,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.56/12.86 [2019-03-28 12:30:24,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.56/12.86 [2019-03-28 12:30:24,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.56/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.56/12.86 Number of strict supporting invariants: 0 30.56/12.86 Number of non-strict supporting invariants: 1 30.56/12.86 Consider only non-deceasing supporting invariants: true 30.56/12.86 Simplify termination arguments: true 30.56/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.56/12.86 [2019-03-28 12:30:24,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.56/12.86 [2019-03-28 12:30:24,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.56/12.86 [2019-03-28 12:30:24,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.56/12.86 [2019-03-28 12:30:24,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.56/12.86 [2019-03-28 12:30:24,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.56/12.86 [2019-03-28 12:30:24,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.56/12.86 [2019-03-28 12:30:24,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.56/12.86 [2019-03-28 12:30:24,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.56/12.86 [2019-03-28 12:30:24,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.56/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.56/12.86 Number of strict supporting invariants: 0 30.56/12.86 Number of non-strict supporting invariants: 1 30.56/12.86 Consider only non-deceasing supporting invariants: true 30.56/12.86 Simplify termination arguments: true 30.56/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.56/12.86 [2019-03-28 12:30:24,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.56/12.86 [2019-03-28 12:30:24,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.56/12.86 [2019-03-28 12:30:24,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.56/12.86 [2019-03-28 12:30:24,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.56/12.86 [2019-03-28 12:30:24,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.56/12.86 [2019-03-28 12:30:24,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.56/12.86 [2019-03-28 12:30:24,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.56/12.86 [2019-03-28 12:30:24,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.56/12.86 [2019-03-28 12:30:24,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.56/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.56/12.86 Number of strict supporting invariants: 0 30.56/12.86 Number of non-strict supporting invariants: 1 30.56/12.86 Consider only non-deceasing supporting invariants: true 30.56/12.86 Simplify termination arguments: true 30.56/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.56/12.86 [2019-03-28 12:30:24,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.56/12.86 [2019-03-28 12:30:24,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.56/12.86 [2019-03-28 12:30:24,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.56/12.86 [2019-03-28 12:30:24,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.56/12.86 [2019-03-28 12:30:24,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.56/12.86 [2019-03-28 12:30:24,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.56/12.86 [2019-03-28 12:30:24,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.56/12.86 [2019-03-28 12:30:24,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.56/12.86 [2019-03-28 12:30:24,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.56/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.56/12.86 Number of strict supporting invariants: 0 30.56/12.86 Number of non-strict supporting invariants: 1 30.56/12.86 Consider only non-deceasing supporting invariants: true 30.56/12.86 Simplify termination arguments: true 30.56/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.56/12.86 [2019-03-28 12:30:24,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.56/12.86 [2019-03-28 12:30:24,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.56/12.86 [2019-03-28 12:30:24,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.56/12.86 [2019-03-28 12:30:24,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.56/12.86 [2019-03-28 12:30:24,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.56/12.86 [2019-03-28 12:30:24,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.56/12.86 [2019-03-28 12:30:24,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.56/12.86 [2019-03-28 12:30:24,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.56/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.56/12.86 Number of strict supporting invariants: 0 30.56/12.86 Number of non-strict supporting invariants: 1 30.56/12.86 Consider only non-deceasing supporting invariants: true 30.56/12.86 Simplify termination arguments: true 30.56/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.56/12.86 [2019-03-28 12:30:24,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.56/12.86 [2019-03-28 12:30:24,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.56/12.86 [2019-03-28 12:30:24,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.56/12.86 [2019-03-28 12:30:24,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.56/12.86 [2019-03-28 12:30:24,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.56/12.86 [2019-03-28 12:30:24,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.56/12.86 [2019-03-28 12:30:24,697 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.56/12.86 [2019-03-28 12:30:24,734 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. 30.56/12.86 [2019-03-28 12:30:24,734 INFO L444 ModelExtractionUtils]: 22 out of 34 variables were initially zero. Simplification set additionally 9 variables to zero. 30.56/12.86 [2019-03-28 12:30:24,735 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.56/12.86 [2019-03-28 12:30:24,737 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 30.56/12.86 [2019-03-28 12:30:24,737 INFO L518 LassoAnalysis]: Proved termination. 30.56/12.86 [2019-03-28 12:30:24,737 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.56/12.86 Ranking function f(ULTIMATE.start_foo_~i~0, ~n~0) = -1*ULTIMATE.start_foo_~i~0 + 1*~n~0 30.56/12.86 Supporting invariants [] 30.56/12.86 [2019-03-28 12:30:24,751 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed 30.56/12.86 [2019-03-28 12:30:24,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:24,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core 30.56/12.86 [2019-03-28 12:30:24,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.56/12.86 [2019-03-28 12:30:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:24,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 30.56/12.86 [2019-03-28 12:30:24,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.56/12.86 [2019-03-28 12:30:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:24,814 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 30.56/12.86 [2019-03-28 12:30:24,814 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 30.56/12.86 [2019-03-28 12:30:24,814 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 19 transitions. cyclomatic complexity: 13 Second operand 3 states. 30.56/12.86 [2019-03-28 12:30:24,842 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 19 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 12 states and 24 transitions. Complement of second has 4 states. 30.56/12.86 [2019-03-28 12:30:24,843 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 30.56/12.86 [2019-03-28 12:30:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 30.56/12.86 [2019-03-28 12:30:24,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. 30.56/12.86 [2019-03-28 12:30:24,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 4 letters. Loop has 2 letters. 30.56/12.86 [2019-03-28 12:30:24,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.56/12.86 [2019-03-28 12:30:24,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. 30.56/12.86 [2019-03-28 12:30:24,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.56/12.86 [2019-03-28 12:30:24,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 4 letters. Loop has 4 letters. 30.56/12.86 [2019-03-28 12:30:24,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.56/12.86 [2019-03-28 12:30:24,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 24 transitions. 30.56/12.86 [2019-03-28 12:30:24,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 30.56/12.86 [2019-03-28 12:30:24,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 11 states and 22 transitions. 30.56/12.86 [2019-03-28 12:30:24,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 30.56/12.86 [2019-03-28 12:30:24,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 30.56/12.86 [2019-03-28 12:30:24,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 22 transitions. 30.56/12.86 [2019-03-28 12:30:24,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 30.56/12.86 [2019-03-28 12:30:24,849 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 22 transitions. 30.56/12.86 [2019-03-28 12:30:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 22 transitions. 30.56/12.86 [2019-03-28 12:30:24,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. 30.56/12.86 [2019-03-28 12:30:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 30.56/12.86 [2019-03-28 12:30:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. 30.56/12.86 [2019-03-28 12:30:24,851 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 21 transitions. 30.56/12.86 [2019-03-28 12:30:24,851 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 21 transitions. 30.56/12.86 [2019-03-28 12:30:24,851 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 30.56/12.86 [2019-03-28 12:30:24,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 21 transitions. 30.56/12.86 [2019-03-28 12:30:24,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 30.56/12.86 [2019-03-28 12:30:24,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.56/12.86 [2019-03-28 12:30:24,852 INFO L119 BuchiIsEmpty]: Starting construction of run 30.56/12.86 [2019-03-28 12:30:24,852 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 30.56/12.86 [2019-03-28 12:30:24,852 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 30.56/12.86 [2019-03-28 12:30:24,853 INFO L794 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 v_~a~0.offset_7) (= 0 v_~b~0.base_15) (= 0 v_~a~0.base_8) (= v_~n~0_16 1) (= |v_#NULL.offset_2| 0) (= v_~b~0.offset_12 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_23| 0 0) |v_#valid_22|)) InVars {#valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 176#L633-2 [122] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 179#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* 4 v_~n~0_6))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 173#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19)) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 174#L625-2 [153] L625-2-->L627-2: Formula: (and (<= v_~n~0_19 v_ULTIMATE.start_foo_~i~0_21) (= 0 v_ULTIMATE.start_foo_~i~0_20)) InVars {ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_21, ~n~0=v_~n~0_19} OutVars{ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_20, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[ULTIMATE.start_foo_~i~0] 172#L627-2 30.56/12.86 [2019-03-28 12:30:24,853 INFO L796 eck$LassoCheckResult]: Loop: 172#L627-2 [78] L627-2-->L628: Formula: (< (+ v_ULTIMATE.start_foo_~i~0_14 1) v_~n~0_12) InVars {~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} OutVars{~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} AuxVars[] AssignedVars[] 171#L628 [155] L628-->L627-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_foo_~i~0_25))) (let ((.cse0 (+ v_~b~0.offset_13 .cse1))) (and (= v_ULTIMATE.start_foo_~i~0_24 (+ v_ULTIMATE.start_foo_~i~0_25 1)) (= (store |v_#memory_int_14| v_~b~0.base_16 (store (select |v_#memory_int_14| v_~b~0.base_16) .cse0 v_~n~0_21)) |v_#memory_int_13|) (<= (+ v_~b~0.offset_13 .cse1 4) (select |v_#length_16| v_~b~0.base_16)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_~b~0.base_16))))) InVars {~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_25, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|, ~n~0=v_~n~0_21} OutVars{~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_24, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_16|, ~n~0=v_~n~0_21} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_~i~0, #memory_int] 172#L627-2 30.56/12.86 [2019-03-28 12:30:24,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:24,853 INFO L82 PathProgramCache]: Analyzing trace with hash 171842236, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:24,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:24,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:24,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:24,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:24,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:24,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.86 [2019-03-28 12:30:24,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 30.56/12.86 [2019-03-28 12:30:24,877 INFO L799 eck$LassoCheckResult]: stem already infeasible 30.56/12.86 [2019-03-28 12:30:24,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:24,877 INFO L82 PathProgramCache]: Analyzing trace with hash 3534, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:24,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:24,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:24,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:24,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:24,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:24,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 30.56/12.86 [2019-03-28 12:30:24,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 30.56/12.86 [2019-03-28 12:30:24,917 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. cyclomatic complexity: 14 Second operand 4 states. 30.56/12.86 [2019-03-28 12:30:24,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.86 [2019-03-28 12:30:24,956 INFO L93 Difference]: Finished difference Result 13 states and 23 transitions. 30.56/12.86 [2019-03-28 12:30:24,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 30.56/12.86 [2019-03-28 12:30:24,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 23 transitions. 30.56/12.86 [2019-03-28 12:30:24,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 30.56/12.86 [2019-03-28 12:30:24,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 23 transitions. 30.56/12.86 [2019-03-28 12:30:24,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 30.56/12.86 [2019-03-28 12:30:24,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 30.56/12.86 [2019-03-28 12:30:24,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 23 transitions. 30.56/12.86 [2019-03-28 12:30:24,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 30.56/12.86 [2019-03-28 12:30:24,961 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 23 transitions. 30.56/12.86 [2019-03-28 12:30:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 23 transitions. 30.56/12.86 [2019-03-28 12:30:24,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. 30.56/12.86 [2019-03-28 12:30:24,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 30.56/12.86 [2019-03-28 12:30:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. 30.56/12.86 [2019-03-28 12:30:24,962 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 20 transitions. 30.56/12.86 [2019-03-28 12:30:24,963 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 20 transitions. 30.56/12.86 [2019-03-28 12:30:24,963 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 30.56/12.86 [2019-03-28 12:30:24,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 20 transitions. 30.56/12.86 [2019-03-28 12:30:24,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 30.56/12.86 [2019-03-28 12:30:24,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.56/12.86 [2019-03-28 12:30:24,964 INFO L119 BuchiIsEmpty]: Starting construction of run 30.56/12.86 [2019-03-28 12:30:24,964 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 30.56/12.86 [2019-03-28 12:30:24,964 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 30.56/12.86 [2019-03-28 12:30:24,965 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 v_~a~0.offset_7) (= 0 v_~b~0.base_15) (= 0 v_~a~0.base_8) (= v_~n~0_16 1) (= |v_#NULL.offset_2| 0) (= v_~b~0.offset_12 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_23| 0 0) |v_#valid_22|)) InVars {#valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 206#L633-2 [122] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 209#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* 4 v_~n~0_6))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 203#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19)) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 204#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 207#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (let ((.cse1 (+ .cse0 v_~a~0.offset_8))) (and (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= (select |v_#valid_25| v_~a~0.base_9) 1) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) .cse1 v_~n~0_20))) (<= 0 .cse1)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 208#L625-2 [153] L625-2-->L627-2: Formula: (and (<= v_~n~0_19 v_ULTIMATE.start_foo_~i~0_21) (= 0 v_ULTIMATE.start_foo_~i~0_20)) InVars {ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_21, ~n~0=v_~n~0_19} OutVars{ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_20, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[ULTIMATE.start_foo_~i~0] 202#L627-2 30.56/12.86 [2019-03-28 12:30:24,965 INFO L796 eck$LassoCheckResult]: Loop: 202#L627-2 [78] L627-2-->L628: Formula: (< (+ v_ULTIMATE.start_foo_~i~0_14 1) v_~n~0_12) InVars {~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} OutVars{~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} AuxVars[] AssignedVars[] 201#L628 [155] L628-->L627-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_foo_~i~0_25))) (let ((.cse0 (+ v_~b~0.offset_13 .cse1))) (and (= v_ULTIMATE.start_foo_~i~0_24 (+ v_ULTIMATE.start_foo_~i~0_25 1)) (= (store |v_#memory_int_14| v_~b~0.base_16 (store (select |v_#memory_int_14| v_~b~0.base_16) .cse0 v_~n~0_21)) |v_#memory_int_13|) (<= (+ v_~b~0.offset_13 .cse1 4) (select |v_#length_16| v_~b~0.base_16)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_~b~0.base_16))))) InVars {~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_25, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|, ~n~0=v_~n~0_21} OutVars{~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_24, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_16|, ~n~0=v_~n~0_21} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_~i~0, #memory_int] 202#L627-2 30.56/12.86 [2019-03-28 12:30:24,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:24,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1931568244, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:24,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:24,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:24,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:24,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:24,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:24,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:24,983 INFO L82 PathProgramCache]: Analyzing trace with hash 3534, now seen corresponding path program 2 times 30.56/12.86 [2019-03-28 12:30:24,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:24,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:24,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:24,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:24,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:24,989 INFO L82 PathProgramCache]: Analyzing trace with hash 811213185, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:24,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:24,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:24,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:24,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:24,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:25,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.56/12.86 [2019-03-28 12:30:25,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 30.56/12.86 [2019-03-28 12:30:25,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 30.56/12.86 [2019-03-28 12:30:25,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 30.56/12.86 [2019-03-28 12:30:25,045 INFO L87 Difference]: Start difference. First operand 10 states and 20 transitions. cyclomatic complexity: 13 Second operand 4 states. 30.56/12.86 [2019-03-28 12:30:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.86 [2019-03-28 12:30:25,094 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. 30.56/12.86 [2019-03-28 12:30:25,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 30.56/12.86 [2019-03-28 12:30:25,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 29 transitions. 30.56/12.86 [2019-03-28 12:30:25,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 30.56/12.86 [2019-03-28 12:30:25,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 10 states and 18 transitions. 30.56/12.86 [2019-03-28 12:30:25,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 30.56/12.86 [2019-03-28 12:30:25,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 30.56/12.86 [2019-03-28 12:30:25,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 18 transitions. 30.56/12.86 [2019-03-28 12:30:25,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 30.56/12.86 [2019-03-28 12:30:25,099 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 30.56/12.86 [2019-03-28 12:30:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 18 transitions. 30.56/12.86 [2019-03-28 12:30:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 30.56/12.86 [2019-03-28 12:30:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 30.56/12.86 [2019-03-28 12:30:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. 30.56/12.86 [2019-03-28 12:30:25,101 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 30.56/12.86 [2019-03-28 12:30:25,101 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 30.56/12.86 [2019-03-28 12:30:25,101 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 30.56/12.86 [2019-03-28 12:30:25,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 18 transitions. 30.56/12.86 [2019-03-28 12:30:25,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 30.56/12.86 [2019-03-28 12:30:25,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.56/12.86 [2019-03-28 12:30:25,102 INFO L119 BuchiIsEmpty]: Starting construction of run 30.56/12.86 [2019-03-28 12:30:25,102 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 30.56/12.86 [2019-03-28 12:30:25,102 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 30.56/12.86 [2019-03-28 12:30:25,103 INFO L794 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 v_~a~0.offset_7) (= 0 v_~b~0.base_15) (= 0 v_~a~0.base_8) (= v_~n~0_16 1) (= |v_#NULL.offset_2| 0) (= v_~b~0.offset_12 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_23| 0 0) |v_#valid_22|)) InVars {#valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 242#L633-2 [124] L633-2-->L633-2: Formula: (and (= (+ v_~n~0_5 1) v_~n~0_4) (< v_~n~0_5 30) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ~n~0] 245#L633-2 [122] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 246#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* 4 v_~n~0_6))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 239#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19)) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 240#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 243#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (let ((.cse1 (+ .cse0 v_~a~0.offset_8))) (and (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= (select |v_#valid_25| v_~a~0.base_9) 1) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) .cse1 v_~n~0_20))) (<= 0 .cse1)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 244#L625-2 [153] L625-2-->L627-2: Formula: (and (<= v_~n~0_19 v_ULTIMATE.start_foo_~i~0_21) (= 0 v_ULTIMATE.start_foo_~i~0_20)) InVars {ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_21, ~n~0=v_~n~0_19} OutVars{ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_20, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[ULTIMATE.start_foo_~i~0] 238#L627-2 30.56/12.86 [2019-03-28 12:30:25,103 INFO L796 eck$LassoCheckResult]: Loop: 238#L627-2 [78] L627-2-->L628: Formula: (< (+ v_ULTIMATE.start_foo_~i~0_14 1) v_~n~0_12) InVars {~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} OutVars{~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} AuxVars[] AssignedVars[] 237#L628 [155] L628-->L627-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_foo_~i~0_25))) (let ((.cse0 (+ v_~b~0.offset_13 .cse1))) (and (= v_ULTIMATE.start_foo_~i~0_24 (+ v_ULTIMATE.start_foo_~i~0_25 1)) (= (store |v_#memory_int_14| v_~b~0.base_16 (store (select |v_#memory_int_14| v_~b~0.base_16) .cse0 v_~n~0_21)) |v_#memory_int_13|) (<= (+ v_~b~0.offset_13 .cse1 4) (select |v_#length_16| v_~b~0.base_16)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_~b~0.base_16))))) InVars {~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_25, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|, ~n~0=v_~n~0_21} OutVars{~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_24, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_16|, ~n~0=v_~n~0_21} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_~i~0, #memory_int] 238#L627-2 30.56/12.86 [2019-03-28 12:30:25,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:25,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1359863364, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:25,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:25,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:25,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:25,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 30.56/12.86 [2019-03-28 12:30:25,139 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 30.56/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.56/12.86 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 30.56/12.86 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 30.56/12.86 [2019-03-28 12:30:25,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:25,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core 30.56/12.86 [2019-03-28 12:30:25,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.56/12.86 [2019-03-28 12:30:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:25,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 30.56/12.86 [2019-03-28 12:30:25,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 30.56/12.86 [2019-03-28 12:30:25,227 INFO L799 eck$LassoCheckResult]: stem already infeasible 30.56/12.86 [2019-03-28 12:30:25,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:25,227 INFO L82 PathProgramCache]: Analyzing trace with hash 3534, now seen corresponding path program 3 times 30.56/12.86 [2019-03-28 12:30:25,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:25,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:25,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:25,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 30.56/12.86 [2019-03-28 12:30:25,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 30.56/12.86 [2019-03-28 12:30:25,266 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. cyclomatic complexity: 11 Second operand 8 states. 30.56/12.86 [2019-03-28 12:30:25,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.56/12.86 [2019-03-28 12:30:25,335 INFO L93 Difference]: Finished difference Result 17 states and 25 transitions. 30.56/12.86 [2019-03-28 12:30:25,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 30.56/12.86 [2019-03-28 12:30:25,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 25 transitions. 30.56/12.86 [2019-03-28 12:30:25,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 30.56/12.86 [2019-03-28 12:30:25,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 25 transitions. 30.56/12.86 [2019-03-28 12:30:25,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 30.56/12.86 [2019-03-28 12:30:25,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 30.56/12.86 [2019-03-28 12:30:25,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. 30.56/12.86 [2019-03-28 12:30:25,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 30.56/12.86 [2019-03-28 12:30:25,339 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. 30.56/12.86 [2019-03-28 12:30:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. 30.56/12.86 [2019-03-28 12:30:25,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. 30.56/12.86 [2019-03-28 12:30:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 30.56/12.86 [2019-03-28 12:30:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. 30.56/12.86 [2019-03-28 12:30:25,341 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 20 transitions. 30.56/12.86 [2019-03-28 12:30:25,341 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 20 transitions. 30.56/12.86 [2019-03-28 12:30:25,341 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 30.56/12.86 [2019-03-28 12:30:25,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 20 transitions. 30.56/12.86 [2019-03-28 12:30:25,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 30.56/12.86 [2019-03-28 12:30:25,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.56/12.86 [2019-03-28 12:30:25,342 INFO L119 BuchiIsEmpty]: Starting construction of run 30.56/12.86 [2019-03-28 12:30:25,342 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] 30.56/12.86 [2019-03-28 12:30:25,342 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 30.56/12.86 [2019-03-28 12:30:25,343 INFO L794 eck$LassoCheckResult]: Stem: 302#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 v_~a~0.offset_7) (= 0 v_~b~0.base_15) (= 0 v_~a~0.base_8) (= v_~n~0_16 1) (= |v_#NULL.offset_2| 0) (= v_~b~0.offset_12 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_23| 0 0) |v_#valid_22|)) InVars {#valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 303#L633-2 [124] L633-2-->L633-2: Formula: (and (= (+ v_~n~0_5 1) v_~n~0_4) (< v_~n~0_5 30) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ~n~0] 306#L633-2 [122] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 307#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* 4 v_~n~0_6))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 300#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19)) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 301#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 308#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (let ((.cse1 (+ .cse0 v_~a~0.offset_8))) (and (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= (select |v_#valid_25| v_~a~0.base_9) 1) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) .cse1 v_~n~0_20))) (<= 0 .cse1)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 309#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 304#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (let ((.cse1 (+ .cse0 v_~a~0.offset_8))) (and (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= (select |v_#valid_25| v_~a~0.base_9) 1) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) .cse1 v_~n~0_20))) (<= 0 .cse1)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 305#L625-2 [153] L625-2-->L627-2: Formula: (and (<= v_~n~0_19 v_ULTIMATE.start_foo_~i~0_21) (= 0 v_ULTIMATE.start_foo_~i~0_20)) InVars {ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_21, ~n~0=v_~n~0_19} OutVars{ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_20, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[ULTIMATE.start_foo_~i~0] 299#L627-2 30.56/12.86 [2019-03-28 12:30:25,344 INFO L796 eck$LassoCheckResult]: Loop: 299#L627-2 [78] L627-2-->L628: Formula: (< (+ v_ULTIMATE.start_foo_~i~0_14 1) v_~n~0_12) InVars {~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} OutVars{~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} AuxVars[] AssignedVars[] 298#L628 [155] L628-->L627-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_foo_~i~0_25))) (let ((.cse0 (+ v_~b~0.offset_13 .cse1))) (and (= v_ULTIMATE.start_foo_~i~0_24 (+ v_ULTIMATE.start_foo_~i~0_25 1)) (= (store |v_#memory_int_14| v_~b~0.base_16 (store (select |v_#memory_int_14| v_~b~0.base_16) .cse0 v_~n~0_21)) |v_#memory_int_13|) (<= (+ v_~b~0.offset_13 .cse1 4) (select |v_#length_16| v_~b~0.base_16)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_~b~0.base_16))))) InVars {~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_25, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|, ~n~0=v_~n~0_21} OutVars{~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_24, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_16|, ~n~0=v_~n~0_21} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_~i~0, #memory_int] 299#L627-2 30.56/12.86 [2019-03-28 12:30:25,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:25,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1158571516, now seen corresponding path program 2 times 30.56/12.86 [2019-03-28 12:30:25,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:25,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:25,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:25,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:25,363 INFO L82 PathProgramCache]: Analyzing trace with hash 3534, now seen corresponding path program 4 times 30.56/12.86 [2019-03-28 12:30:25,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:25,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:25,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:25,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:25,369 INFO L82 PathProgramCache]: Analyzing trace with hash 990699785, now seen corresponding path program 1 times 30.56/12.86 [2019-03-28 12:30:25,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.56/12.86 [2019-03-28 12:30:25,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.56/12.86 [2019-03-28 12:30:25,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.56/12.86 [2019-03-28 12:30:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.56/12.86 [2019-03-28 12:30:25,807 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 30.56/12.86 [2019-03-28 12:30:25,889 INFO L216 LassoAnalysis]: Preferences: 30.56/12.86 [2019-03-28 12:30:25,889 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.56/12.86 [2019-03-28 12:30:25,889 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.56/12.86 [2019-03-28 12:30:25,889 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.56/12.86 [2019-03-28 12:30:25,890 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.56/12.86 [2019-03-28 12:30:25,890 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.56/12.86 [2019-03-28 12:30:25,890 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.56/12.86 [2019-03-28 12:30:25,890 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.56/12.86 [2019-03-28 12:30:25,890 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 30.56/12.86 [2019-03-28 12:30:25,890 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.56/12.86 [2019-03-28 12:30:25,890 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.56/12.86 [2019-03-28 12:30:25,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:25,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:25,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:26,051 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 30.56/12.86 [2019-03-28 12:30:26,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:26,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:26,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:26,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:26,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:26,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:26,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:26,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:26,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:26,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.56/12.86 [2019-03-28 12:30:26,341 INFO L300 LassoAnalysis]: Preprocessing complete. 30.56/12.86 [2019-03-28 12:30:26,342 INFO L497 LassoAnalysis]: Using template 'affine'. 30.56/12.86 [2019-03-28 12:30:26,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.56/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.56/12.86 Number of strict supporting invariants: 0 30.56/12.86 Number of non-strict supporting invariants: 1 30.56/12.86 Consider only non-deceasing supporting invariants: true 30.56/12.86 Simplify termination arguments: true 30.56/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.56/12.86 [2019-03-28 12:30:26,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.56/12.86 [2019-03-28 12:30:26,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.56/12.86 [2019-03-28 12:30:26,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.56/12.86 [2019-03-28 12:30:26,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.56/12.86 [2019-03-28 12:30:26,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.56/12.86 [2019-03-28 12:30:26,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.56/12.86 [2019-03-28 12:30:26,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.56/12.86 [2019-03-28 12:30:26,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.56/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.56/12.86 Number of strict supporting invariants: 0 30.56/12.86 Number of non-strict supporting invariants: 1 30.56/12.86 Consider only non-deceasing supporting invariants: true 30.56/12.86 Simplify termination arguments: true 30.56/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.56/12.86 [2019-03-28 12:30:26,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.56/12.86 [2019-03-28 12:30:26,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.56/12.86 [2019-03-28 12:30:26,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.56/12.86 [2019-03-28 12:30:26,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.56/12.86 [2019-03-28 12:30:26,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.56/12.86 [2019-03-28 12:30:26,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.56/12.86 [2019-03-28 12:30:26,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.56/12.86 [2019-03-28 12:30:26,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.56/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.56/12.86 Number of strict supporting invariants: 0 30.56/12.86 Number of non-strict supporting invariants: 1 30.56/12.86 Consider only non-deceasing supporting invariants: true 30.56/12.86 Simplify termination arguments: true 30.56/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.56/12.86 [2019-03-28 12:30:26,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.56/12.86 [2019-03-28 12:30:26,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.56/12.86 [2019-03-28 12:30:26,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.56/12.86 [2019-03-28 12:30:26,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.56/12.86 [2019-03-28 12:30:26,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.56/12.86 [2019-03-28 12:30:26,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.56/12.86 [2019-03-28 12:30:26,375 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.56/12.86 [2019-03-28 12:30:26,400 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. 30.56/12.86 [2019-03-28 12:30:26,401 INFO L444 ModelExtractionUtils]: 25 out of 34 variables were initially zero. Simplification set additionally 6 variables to zero. 30.56/12.86 [2019-03-28 12:30:26,401 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.56/12.86 [2019-03-28 12:30:26,402 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 30.56/12.86 [2019-03-28 12:30:26,402 INFO L518 LassoAnalysis]: Proved termination. 30.56/12.86 [2019-03-28 12:30:26,402 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.56/12.86 Ranking function f(ULTIMATE.start_foo_~i~0, ~n~0) = -1*ULTIMATE.start_foo_~i~0 + 1*~n~0 30.56/12.86 Supporting invariants [] 30.56/12.86 [2019-03-28 12:30:26,423 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed 30.56/12.86 [2019-03-28 12:30:26,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.56/12.86 [2019-03-28 12:30:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:26,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core 30.56/12.86 [2019-03-28 12:30:26,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.56/12.86 [2019-03-28 12:30:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.56/12.86 [2019-03-28 12:30:26,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 30.56/12.86 [2019-03-28 12:30:26,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.56/12.86 [2019-03-28 12:30:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.56/12.86 [2019-03-28 12:30:26,485 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 30.56/12.86 [2019-03-28 12:30:26,485 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 30.56/12.86 [2019-03-28 12:30:26,485 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states and 20 transitions. cyclomatic complexity: 11 Second operand 3 states. 30.56/12.86 [2019-03-28 12:30:26,506 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states and 20 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 14 states and 23 transitions. Complement of second has 4 states. 30.56/12.86 [2019-03-28 12:30:26,507 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 30.56/12.86 [2019-03-28 12:30:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 30.56/12.86 [2019-03-28 12:30:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. 30.56/12.86 [2019-03-28 12:30:26,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 2 letters. 30.56/12.86 [2019-03-28 12:30:26,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.56/12.86 [2019-03-28 12:30:26,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. 30.56/12.86 [2019-03-28 12:30:26,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.56/12.86 [2019-03-28 12:30:26,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 4 letters. 30.56/12.86 [2019-03-28 12:30:26,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.56/12.86 [2019-03-28 12:30:26,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 23 transitions. 30.56/12.86 [2019-03-28 12:30:26,511 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 30.56/12.86 [2019-03-28 12:30:26,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. 30.56/12.86 [2019-03-28 12:30:26,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 30.56/12.86 [2019-03-28 12:30:26,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 30.56/12.86 [2019-03-28 12:30:26,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 30.56/12.86 [2019-03-28 12:30:26,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 30.56/12.86 [2019-03-28 12:30:26,512 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 30.56/12.86 [2019-03-28 12:30:26,512 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 30.56/12.86 [2019-03-28 12:30:26,512 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 30.56/12.86 [2019-03-28 12:30:26,512 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 30.56/12.86 [2019-03-28 12:30:26,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 30.56/12.86 [2019-03-28 12:30:26,513 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 30.56/12.86 [2019-03-28 12:30:26,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 30.56/12.86 [2019-03-28 12:30:26,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:30:26 BasicIcfg 30.56/12.86 [2019-03-28 12:30:26,519 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 30.56/12.86 [2019-03-28 12:30:26,520 INFO L168 Benchmark]: Toolchain (without parser) took 8146.88 ms. Allocated memory was 649.6 MB in the beginning and 855.1 MB in the end (delta: 205.5 MB). Free memory was 557.0 MB in the beginning and 647.6 MB in the end (delta: -90.6 MB). Peak memory consumption was 114.9 MB. Max. memory is 50.3 GB. 30.56/12.86 [2019-03-28 12:30:26,521 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 30.56/12.86 [2019-03-28 12:30:26,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.47 ms. Allocated memory was 649.6 MB in the beginning and 683.1 MB in the end (delta: 33.6 MB). Free memory was 557.0 MB in the beginning and 632.4 MB in the end (delta: -75.4 MB). Peak memory consumption was 33.9 MB. Max. memory is 50.3 GB. 30.56/12.86 [2019-03-28 12:30:26,522 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.16 ms. Allocated memory is still 683.1 MB. Free memory was 631.0 MB in the beginning and 629.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 30.56/12.86 [2019-03-28 12:30:26,522 INFO L168 Benchmark]: Boogie Preprocessor took 28.62 ms. Allocated memory is still 683.1 MB. Free memory was 629.7 MB in the beginning and 627.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 30.56/12.86 [2019-03-28 12:30:26,522 INFO L168 Benchmark]: RCFGBuilder took 303.08 ms. Allocated memory is still 683.1 MB. Free memory was 627.0 MB in the beginning and 604.3 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 50.3 GB. 30.56/12.86 [2019-03-28 12:30:26,523 INFO L168 Benchmark]: BlockEncodingV2 took 119.42 ms. Allocated memory is still 683.1 MB. Free memory was 604.3 MB in the beginning and 596.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 30.56/12.86 [2019-03-28 12:30:26,523 INFO L168 Benchmark]: TraceAbstraction took 4048.05 ms. Allocated memory was 683.1 MB in the beginning and 753.4 MB in the end (delta: 70.3 MB). Free memory was 596.2 MB in the beginning and 415.3 MB in the end (delta: 180.9 MB). Peak memory consumption was 251.2 MB. Max. memory is 50.3 GB. 30.56/12.86 [2019-03-28 12:30:26,524 INFO L168 Benchmark]: BuchiAutomizer took 3103.01 ms. Allocated memory was 753.4 MB in the beginning and 855.1 MB in the end (delta: 101.7 MB). Free memory was 411.2 MB in the beginning and 647.6 MB in the end (delta: -236.4 MB). There was no memory consumed. Max. memory is 50.3 GB. 30.56/12.86 [2019-03-28 12:30:26,528 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 30.56/12.86 --- Results --- 30.56/12.86 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 30.56/12.86 - StatisticsResult: Initial Icfg 30.56/12.86 30 locations, 36 edges 30.56/12.86 - StatisticsResult: Encoded RCFG 30.56/12.86 20 locations, 37 edges 30.56/12.86 * Results from de.uni_freiburg.informatik.ultimate.core: 30.56/12.86 - StatisticsResult: Toolchain Benchmarks 30.56/12.86 Benchmark results are: 30.56/12.86 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 30.56/12.86 * CACSL2BoogieTranslator took 489.47 ms. Allocated memory was 649.6 MB in the beginning and 683.1 MB in the end (delta: 33.6 MB). Free memory was 557.0 MB in the beginning and 632.4 MB in the end (delta: -75.4 MB). Peak memory consumption was 33.9 MB. Max. memory is 50.3 GB. 30.56/12.86 * Boogie Procedure Inliner took 49.16 ms. Allocated memory is still 683.1 MB. Free memory was 631.0 MB in the beginning and 629.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 30.56/12.86 * Boogie Preprocessor took 28.62 ms. Allocated memory is still 683.1 MB. Free memory was 629.7 MB in the beginning and 627.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 30.56/12.86 * RCFGBuilder took 303.08 ms. Allocated memory is still 683.1 MB. Free memory was 627.0 MB in the beginning and 604.3 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 50.3 GB. 30.56/12.86 * BlockEncodingV2 took 119.42 ms. Allocated memory is still 683.1 MB. Free memory was 604.3 MB in the beginning and 596.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 30.56/12.86 * TraceAbstraction took 4048.05 ms. Allocated memory was 683.1 MB in the beginning and 753.4 MB in the end (delta: 70.3 MB). Free memory was 596.2 MB in the beginning and 415.3 MB in the end (delta: 180.9 MB). Peak memory consumption was 251.2 MB. Max. memory is 50.3 GB. 30.56/12.86 * BuchiAutomizer took 3103.01 ms. Allocated memory was 753.4 MB in the beginning and 855.1 MB in the end (delta: 101.7 MB). Free memory was 411.2 MB in the beginning and 647.6 MB in the end (delta: -236.4 MB). There was no memory consumed. Max. memory is 50.3 GB. 30.56/12.86 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 - GenericResult: Unfinished Backtranslation 30.56/12.86 unknown boogie variable #length 30.56/12.86 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 30.56/12.86 - PositiveResult [Line: 638]: pointer dereference always succeeds 30.56/12.86 For all program executions holds that pointer dereference always succeeds at this location 30.56/12.86 - PositiveResult [Line: 640]: pointer dereference always succeeds 30.56/12.86 For all program executions holds that pointer dereference always succeeds at this location 30.56/12.86 - PositiveResult [Line: 640]: pointer dereference always succeeds 30.56/12.86 For all program executions holds that pointer dereference always succeeds at this location 30.56/12.86 - PositiveResult [Line: 640]: pointer dereference always succeeds 30.56/12.86 For all program executions holds that pointer dereference always succeeds at this location 30.56/12.86 - PositiveResult [Line: 626]: pointer dereference always succeeds 30.56/12.86 For all program executions holds that pointer dereference always succeeds at this location 30.56/12.86 - PositiveResult [Line: 640]: pointer dereference always succeeds 30.56/12.86 For all program executions holds that pointer dereference always succeeds at this location 30.56/12.86 - PositiveResult [Line: 628]: pointer dereference always succeeds 30.56/12.86 For all program executions holds that pointer dereference always succeeds at this location 30.56/12.86 - PositiveResult [Line: 626]: pointer dereference always succeeds 30.56/12.86 For all program executions holds that pointer dereference always succeeds at this location 30.56/12.86 - PositiveResult [Line: 628]: pointer dereference always succeeds 30.56/12.86 For all program executions holds that pointer dereference always succeeds at this location 30.56/12.86 - PositiveResult [Line: 638]: pointer dereference always succeeds 30.56/12.86 For all program executions holds that pointer dereference always succeeds at this location 30.56/12.86 - AllSpecificationsHoldResult: All specifications hold 30.56/12.86 10 specifications checked. All of them hold 30.56/12.86 - InvariantResult [Line: 633]: Loop Invariant 30.56/12.86 Derived loop invariant: (1 <= n && a == 0) || 2 <= n 30.56/12.86 - InvariantResult [Line: 627]: Loop Invariant 30.56/12.86 [2019-03-28 12:30:26,538 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,538 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,545 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,545 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,545 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,545 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,545 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 Derived loop invariant: ((((((((1 == \valid[b] && unknown-#length-unknown[a] == 4 * n) && unknown-#length-unknown[b] == 4 * n) && a == 0) && 1 == \valid[a]) && (\exists ~n~0 : int, ULTIMATE.start_main_#t~post6.base : int :: ((4 * ~n~0 == unknown-#length-unknown[a] && 4 * ~n~0 == unknown-#length-unknown[ULTIMATE.start_main_#t~post6.base]) && !(a == ULTIMATE.start_main_#t~post6.base)) && 2 <= ~n~0)) && 4 <= 4 * i + b) && 4 <= b) && 4 * n + b <= unknown-#length-unknown[b] + 4) || (((((((((1 == \valid[b] && 4 * i + 4 <= unknown-#length-unknown[a]) && unknown-#length-unknown[a] == 4 * n) && unknown-#length-unknown[b] == 4 * n) && 0 <= i) && a == 0) && n <= 1) && 1 == \valid[a]) && 4 <= b) && b <= 4 * n) 30.56/12.86 - InvariantResult [Line: 625]: Loop Invariant 30.56/12.86 [2019-03-28 12:30:26,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,549 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] 30.56/12.86 [2019-03-28 12:30:26,555 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,556 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,556 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,556 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,556 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,556 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 [2019-03-28 12:30:26,558 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.56/12.86 Derived loop invariant: (((((((((1 == \valid[b] && unknown-#length-unknown[b] == 4 * n) && unknown-#length-unknown[a] == 4 * n) && 0 <= i) && a == 0) && n <= 1) && 1 == \valid[a]) && 4 <= b) && b <= 4 * n) || ((((((((1 == \valid[b] && unknown-#length-unknown[b] == 4 * n) && unknown-#length-unknown[a] == 4 * n) && a == 0) && 1 == \valid[a]) && 4 <= a + 4 * i) && (\exists ~n~0 : int, ULTIMATE.start_main_#t~post6.base : int :: ((4 * ~n~0 == unknown-#length-unknown[a] && 4 * ~n~0 == unknown-#length-unknown[ULTIMATE.start_main_#t~post6.base]) && !(a == ULTIMATE.start_main_#t~post6.base)) && 2 <= ~n~0)) && 4 <= b) && 4 * n + b <= unknown-#length-unknown[b] + 4)) || ((((((((1 == \valid[b] && unknown-#length-unknown[b] == 4 * n) && unknown-#length-unknown[a] == 4 * n) && 0 == i) && a == 0) && 1 == \valid[a]) && (\exists ~n~0 : int, ULTIMATE.start_main_#t~post6.base : int :: ((4 * ~n~0 == unknown-#length-unknown[a] && 4 * ~n~0 == unknown-#length-unknown[ULTIMATE.start_main_#t~post6.base]) && !(a == ULTIMATE.start_main_#t~post6.base)) && 2 <= ~n~0)) && 4 <= b) && 4 * n + b <= unknown-#length-unknown[b] + 4) 30.56/12.86 - StatisticsResult: Ultimate Automizer benchmark data 30.56/12.86 CFG has 1 procedures, 20 locations, 10 error locations. SAFE Result, 3.9s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 52 SDtfs, 425 SDslu, 183 SDs, 0 SdLazy, 972 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=6, 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, 17 MinimizatonAttempts, 67 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 13 NumberOfFragments, 318 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1320 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 274 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 150 ConstructedInterpolants, 5 QuantifiedInterpolants, 6522 SizeOfPredicates, 8 NumberOfNonLiveVariables, 193 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 35/41 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 30.56/12.86 - StatisticsResult: Constructed decomposition of program 30.56/12.86 Your program was decomposed into 6 terminating modules (3 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function -2 * n + 59 and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + n and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + n and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. 30.56/12.86 - StatisticsResult: Timing statistics 30.56/12.86 BüchiAutomizer plugin needed 3.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 141 SDslu, 25 SDs, 0 SdLazy, 241 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital91 mio100 ax100 hnf100 lsp86 ukn86 mio100 lsp84 div100 bol100 ite100 ukn100 eq167 hnf92 smp98 dnf100 smp100 tf106 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 30.56/12.86 - TerminationAnalysisResult: Termination proven 30.56/12.86 Buchi Automizer proved that your program is terminating 30.56/12.86 RESULT: Ultimate proved your program to be correct! 30.56/12.86 !SESSION 2019-03-28 12:30:14.876 ----------------------------------------------- 30.56/12.86 eclipse.buildId=unknown 30.56/12.86 java.version=1.8.0_181 30.56/12.86 java.vendor=Oracle Corporation 30.56/12.86 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 30.56/12.86 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 30.56/12.86 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 30.56/12.86 30.56/12.86 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:30:26.784 30.56/12.86 !MESSAGE The workspace will exit with unsaved changes in this session. 30.56/12.86 Received shutdown request... 30.56/12.86 Ultimate: 30.56/12.86 GTK+ Version Check 30.56/12.86 EOF