java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:03:22,294 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:03:22,296 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:03:22,312 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:03:22,313 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:03:22,315 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:03:22,318 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:03:22,320 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:03:22,323 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:03:22,324 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:03:22,326 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:03:22,326 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:03:22,329 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:03:22,330 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:03:22,331 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:03:22,335 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:03:22,336 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:03:22,338 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:03:22,346 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:03:22,348 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:03:22,349 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:03:22,352 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:03:22,354 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:03:22,354 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:03:22,356 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:03:22,358 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:03:22,358 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:03:22,359 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:03:22,360 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:03:22,361 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:03:22,361 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:03:22,362 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:03:22,362 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:03:22,362 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:03:22,363 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:03:22,364 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:03:22,364 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:03:22,378 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:03:22,379 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:03:22,380 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:03:22,380 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:03:22,380 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:03:22,381 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:03:22,381 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:03:22,381 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:03:22,381 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:03:22,381 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:03:22,381 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:03:22,382 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:03:22,382 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:03:22,382 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:03:22,382 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:03:22,382 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:03:22,383 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:03:22,383 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:03:22,383 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:03:22,383 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:03:22,383 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:03:22,383 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:03:22,384 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:03:22,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:03:22,384 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:03:22,384 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:03:22,384 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:03:22,385 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:03:22,385 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:03:22,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:03:22,385 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:03:22,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:03:22,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:03:22,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:03:22,457 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:03:22,457 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:03:22,458 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-23 13:03:22,524 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df0b4087/766c683116cf4ac6be07f6ba67bf2f0a/FLAG6dadca289 [2018-11-23 13:03:22,960 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:03:22,961 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-23 13:03:22,967 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df0b4087/766c683116cf4ac6be07f6ba67bf2f0a/FLAG6dadca289 [2018-11-23 13:03:23,331 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df0b4087/766c683116cf4ac6be07f6ba67bf2f0a [2018-11-23 13:03:23,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:03:23,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:03:23,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:23,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:03:23,346 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:03:23,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:23" (1/1) ... [2018-11-23 13:03:23,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a78dcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:23, skipping insertion in model container [2018-11-23 13:03:23,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:23" (1/1) ... [2018-11-23 13:03:23,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:03:23,391 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:03:23,633 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:23,637 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:03:23,664 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:23,688 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:03:23,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:23 WrapperNode [2018-11-23 13:03:23,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:23,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:23,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:03:23,690 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:03:23,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:23" (1/1) ... [2018-11-23 13:03:23,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:23" (1/1) ... [2018-11-23 13:03:23,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:23,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:03:23,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:03:23,719 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:03:23,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:23" (1/1) ... [2018-11-23 13:03:23,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:23" (1/1) ... [2018-11-23 13:03:23,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:23" (1/1) ... [2018-11-23 13:03:23,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:23" (1/1) ... [2018-11-23 13:03:23,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:23" (1/1) ... [2018-11-23 13:03:23,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:23" (1/1) ... [2018-11-23 13:03:23,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:23" (1/1) ... [2018-11-23 13:03:23,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:03:23,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:03:23,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:03:23,765 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:03:23,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:03:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:03:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:03:23,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:03:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:03:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:03:23,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:03:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:03:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:03:23,900 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:03:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:03:23,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:03:23,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:03:24,461 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:03:24,463 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 13:03:24,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:24 BoogieIcfgContainer [2018-11-23 13:03:24,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:03:24,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:03:24,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:03:24,469 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:03:24,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:03:23" (1/3) ... [2018-11-23 13:03:24,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce15b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:24, skipping insertion in model container [2018-11-23 13:03:24,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:23" (2/3) ... [2018-11-23 13:03:24,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce15b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:24, skipping insertion in model container [2018-11-23 13:03:24,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:24" (3/3) ... [2018-11-23 13:03:24,473 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-11-23 13:03:24,483 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:03:24,491 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:03:24,509 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:03:24,544 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:03:24,545 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:03:24,545 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:03:24,545 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:03:24,546 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:03:24,546 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:03:24,546 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:03:24,546 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:03:24,547 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:03:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 13:03:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:03:24,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:24,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:24,575 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:24,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:24,582 INFO L82 PathProgramCache]: Analyzing trace with hash 637757472, now seen corresponding path program 1 times [2018-11-23 13:03:24,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:24,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:24,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:24,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:24,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:24,751 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-23 13:03:24,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31#true} is VALID [2018-11-23 13:03:24,756 INFO L273 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-23 13:03:24,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #69#return; {31#true} is VALID [2018-11-23 13:03:24,757 INFO L256 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret9 := main(); {31#true} is VALID [2018-11-23 13:03:24,757 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {31#true} is VALID [2018-11-23 13:03:24,758 INFO L273 TraceCheckUtils]: 6: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-23 13:03:24,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#false} ~k~0 := 1; {32#false} is VALID [2018-11-23 13:03:24,759 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {32#false} is VALID [2018-11-23 13:03:24,759 INFO L256 TraceCheckUtils]: 9: Hoare triple {32#false} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {32#false} is VALID [2018-11-23 13:03:24,760 INFO L273 TraceCheckUtils]: 10: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-23 13:03:24,760 INFO L273 TraceCheckUtils]: 11: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2018-11-23 13:03:24,760 INFO L273 TraceCheckUtils]: 12: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-23 13:03:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:24,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:24,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:03:24,771 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 13:03:24,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:24,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:03:24,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:24,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:03:24,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:03:24,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:03:24,882 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-23 13:03:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:25,309 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2018-11-23 13:03:25,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:03:25,309 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 13:03:25,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 13:03:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 13:03:25,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 65 transitions. [2018-11-23 13:03:25,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:25,697 INFO L225 Difference]: With dead ends: 50 [2018-11-23 13:03:25,698 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 13:03:25,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:03:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 13:03:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 13:03:25,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:25,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 13:03:25,754 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:03:25,754 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:03:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:25,759 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 13:03:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 13:03:25,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:25,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:25,760 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:03:25,760 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:03:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:25,764 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 13:03:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 13:03:25,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:25,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:25,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:25,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:25,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:03:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 13:03:25,771 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2018-11-23 13:03:25,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:25,771 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 13:03:25,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:03:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 13:03:25,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:03:25,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:25,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:25,773 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:25,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash -962501754, now seen corresponding path program 1 times [2018-11-23 13:03:25,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:25,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:25,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:25,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:25,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:26,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {177#true} call ULTIMATE.init(); {177#true} is VALID [2018-11-23 13:03:26,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {177#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {177#true} is VALID [2018-11-23 13:03:26,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {177#true} assume true; {177#true} is VALID [2018-11-23 13:03:26,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} #69#return; {177#true} is VALID [2018-11-23 13:03:26,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {177#true} call #t~ret9 := main(); {177#true} is VALID [2018-11-23 13:03:26,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {177#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {179#(and (<= main_~j~0 1) (< 0 (+ (div main_~j~0 4294967296) 1)))} is VALID [2018-11-23 13:03:26,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {179#(and (<= main_~j~0 1) (< 0 (+ (div main_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {180#(<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 1))} is VALID [2018-11-23 13:03:26,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {180#(<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 1))} ~k~0 := 1; {181#(and (= main_~k~0 1) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~k~0 4294967296))) (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 1)))} is VALID [2018-11-23 13:03:26,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {181#(and (= main_~k~0 1) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~k~0 4294967296))) (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 1)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {178#false} is VALID [2018-11-23 13:03:26,196 INFO L256 TraceCheckUtils]: 9: Hoare triple {178#false} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {178#false} is VALID [2018-11-23 13:03:26,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {178#false} ~cond := #in~cond; {178#false} is VALID [2018-11-23 13:03:26,197 INFO L273 TraceCheckUtils]: 11: Hoare triple {178#false} assume 0 == ~cond; {178#false} is VALID [2018-11-23 13:03:26,197 INFO L273 TraceCheckUtils]: 12: Hoare triple {178#false} assume !false; {178#false} is VALID [2018-11-23 13:03:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:26,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:26,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:03:26,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 13:03:26,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:26,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:03:26,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:26,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:03:26,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:03:26,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:03:26,260 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 5 states. [2018-11-23 13:03:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:26,888 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 13:03:26,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:03:26,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 13:03:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:03:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2018-11-23 13:03:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:03:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2018-11-23 13:03:26,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2018-11-23 13:03:26,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:26,982 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:03:26,982 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:03:26,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:03:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:03:27,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-23 13:03:27,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:27,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 24 states. [2018-11-23 13:03:27,008 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 24 states. [2018-11-23 13:03:27,008 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 24 states. [2018-11-23 13:03:27,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:27,012 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 13:03:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 13:03:27,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:27,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:27,013 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 29 states. [2018-11-23 13:03:27,013 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 29 states. [2018-11-23 13:03:27,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:27,016 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 13:03:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 13:03:27,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:27,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:27,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:27,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:03:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 13:03:27,020 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 13 [2018-11-23 13:03:27,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:27,021 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 13:03:27,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:03:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 13:03:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:03:27,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:27,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:27,022 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:27,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:27,023 INFO L82 PathProgramCache]: Analyzing trace with hash 513665657, now seen corresponding path program 1 times [2018-11-23 13:03:27,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:27,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:27,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:27,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:27,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:28,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {336#true} call ULTIMATE.init(); {336#true} is VALID [2018-11-23 13:03:28,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {336#true} is VALID [2018-11-23 13:03:28,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {336#true} assume true; {336#true} is VALID [2018-11-23 13:03:28,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {336#true} {336#true} #69#return; {336#true} is VALID [2018-11-23 13:03:28,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {336#true} call #t~ret9 := main(); {336#true} is VALID [2018-11-23 13:03:28,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {336#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {338#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} is VALID [2018-11-23 13:03:28,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {338#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; {339#(and (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset|)) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-23 13:03:28,168 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#(and (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset|)) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} #t~short4 := ~i~0 >= 0; {339#(and (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset|)) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-23 13:03:28,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {339#(and (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset|)) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; {340#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or |main_#t~short4| (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))) main_~key~0)) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-23 13:03:28,195 INFO L273 TraceCheckUtils]: 9: Hoare triple {340#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or |main_#t~short4| (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))) main_~key~0)) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {341#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))) main_~key~0))} is VALID [2018-11-23 13:03:28,196 INFO L273 TraceCheckUtils]: 10: Hoare triple {341#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))) main_~key~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {342#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~j~0) |main_~#v~0.offset|))))} is VALID [2018-11-23 13:03:28,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {342#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~j~0) |main_~#v~0.offset|))))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {343#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-23 13:03:28,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {343#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {343#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-23 13:03:28,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {343#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} ~k~0 := 1; {344#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} is VALID [2018-11-23 13:03:28,202 INFO L273 TraceCheckUtils]: 14: Hoare triple {344#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {345#(<= |main_#t~mem7| |main_#t~mem8|)} is VALID [2018-11-23 13:03:28,204 INFO L256 TraceCheckUtils]: 15: Hoare triple {345#(<= |main_#t~mem7| |main_#t~mem8|)} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {346#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:28,205 INFO L273 TraceCheckUtils]: 16: Hoare triple {346#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {347#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:03:28,206 INFO L273 TraceCheckUtils]: 17: Hoare triple {347#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {337#false} is VALID [2018-11-23 13:03:28,206 INFO L273 TraceCheckUtils]: 18: Hoare triple {337#false} assume !false; {337#false} is VALID [2018-11-23 13:03:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:28,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:28,215 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:28,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:28,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:28,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 23 [2018-11-23 13:03:28,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:03:28,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 37 [2018-11-23 13:03:28,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:29,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:29,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:03:29,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-23 13:03:29,033 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:29,033 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, main_~i~0, main_~key~0]. (let ((.cse0 (select |v_#memory_int_10| |main_~#v~0.base|)) (.cse1 (* 4 main_~i~0))) (and (<= (select .cse0 (+ .cse1 |main_~#v~0.offset|)) main_~key~0) (<= 0 main_~i~0) (= |#memory_int| (store |v_#memory_int_10| |main_~#v~0.base| (store .cse0 (+ .cse1 |main_~#v~0.offset| 4) main_~key~0))) (= |main_~#v~0.offset| 0) (<= main_~i~0 0))) [2018-11-23 13:03:29,033 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0]. (and (<= 0 main_~i~0) (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (let ((.cse0 (select |#memory_int| |main_~#v~0.base|)) (.cse1 (* 4 main_~i~0))) (<= (select .cse0 (+ .cse1 |main_~#v~0.offset|)) (select .cse0 (+ .cse1 |main_~#v~0.offset| 4))))) [2018-11-23 13:03:29,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 18 [2018-11-23 13:03:29,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 13:03:29,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:29,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:29,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:29,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 13:03:29,225 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:29,225 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#v~0.base|]. (let ((.cse2 (select |#memory_int| |main_~#v~0.base|))) (let ((.cse0 (select .cse2 4)) (.cse1 (select .cse2 0))) (and (<= .cse0 |main_#t~mem8|) (<= .cse1 .cse0) (<= |main_#t~mem7| .cse1)))) [2018-11-23 13:03:29,226 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= |main_#t~mem7| |main_#t~mem8|) [2018-11-23 13:03:29,266 INFO L256 TraceCheckUtils]: 0: Hoare triple {336#true} call ULTIMATE.init(); {336#true} is VALID [2018-11-23 13:03:29,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {336#true} is VALID [2018-11-23 13:03:29,267 INFO L273 TraceCheckUtils]: 2: Hoare triple {336#true} assume true; {336#true} is VALID [2018-11-23 13:03:29,268 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {336#true} {336#true} #69#return; {336#true} is VALID [2018-11-23 13:03:29,268 INFO L256 TraceCheckUtils]: 4: Hoare triple {336#true} call #t~ret9 := main(); {336#true} is VALID [2018-11-23 13:03:29,269 INFO L273 TraceCheckUtils]: 5: Hoare triple {336#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {366#(and (<= main_~j~0 1) (= |main_~#v~0.offset| 0))} is VALID [2018-11-23 13:03:29,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {366#(and (<= main_~j~0 1) (= |main_~#v~0.offset| 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; {370#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:29,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {370#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} #t~short4 := ~i~0 >= 0; {374#(and (or (and (<= 0 main_~i~0) |main_#t~short4|) (and (not |main_#t~short4|) (< main_~i~0 0))) (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:29,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {374#(and (or (and (<= 0 main_~i~0) |main_#t~short4|) (and (not |main_#t~short4|) (< main_~i~0 0))) (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; {378#(and (<= 0 main_~i~0) (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|))} is VALID [2018-11-23 13:03:29,290 INFO L273 TraceCheckUtils]: 9: Hoare triple {378#(and (<= 0 main_~i~0) (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {382#(and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|)) main_~key~0) (<= 0 main_~i~0) (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:29,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {382#(and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|)) main_~key~0) (<= 0 main_~i~0) (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {343#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-23 13:03:29,291 INFO L273 TraceCheckUtils]: 11: Hoare triple {343#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {343#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-23 13:03:29,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {343#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {343#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-23 13:03:29,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {343#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} ~k~0 := 1; {344#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} is VALID [2018-11-23 13:03:29,299 INFO L273 TraceCheckUtils]: 14: Hoare triple {344#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {345#(<= |main_#t~mem7| |main_#t~mem8|)} is VALID [2018-11-23 13:03:29,300 INFO L256 TraceCheckUtils]: 15: Hoare triple {345#(<= |main_#t~mem7| |main_#t~mem8|)} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {346#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:29,300 INFO L273 TraceCheckUtils]: 16: Hoare triple {346#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {347#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:03:29,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {347#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {337#false} is VALID [2018-11-23 13:03:29,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {337#false} assume !false; {337#false} is VALID [2018-11-23 13:03:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:29,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:29,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-11-23 13:03:29,335 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-11-23 13:03:29,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:29,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:03:29,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:29,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:03:29,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:03:29,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:03:29,381 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 17 states. [2018-11-23 13:03:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:31,293 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2018-11-23 13:03:31,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:03:31,293 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-11-23 13:03:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:03:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 95 transitions. [2018-11-23 13:03:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:03:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 95 transitions. [2018-11-23 13:03:31,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 95 transitions. [2018-11-23 13:03:31,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:31,459 INFO L225 Difference]: With dead ends: 77 [2018-11-23 13:03:31,459 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 13:03:31,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:03:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 13:03:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2018-11-23 13:03:31,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:31,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 40 states. [2018-11-23 13:03:31,578 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 40 states. [2018-11-23 13:03:31,578 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 40 states. [2018-11-23 13:03:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:31,584 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-11-23 13:03:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2018-11-23 13:03:31,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:31,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:31,586 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 60 states. [2018-11-23 13:03:31,587 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 60 states. [2018-11-23 13:03:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:31,592 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-11-23 13:03:31,592 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2018-11-23 13:03:31,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:31,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:31,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:31,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:03:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-11-23 13:03:31,596 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 19 [2018-11-23 13:03:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:31,597 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-23 13:03:31,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:03:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-23 13:03:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:03:31,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:31,598 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:31,598 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:31,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:31,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1947791941, now seen corresponding path program 1 times [2018-11-23 13:03:31,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:31,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:31,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:31,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:31,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:32,449 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2018-11-23 13:03:32,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {709#true} call ULTIMATE.init(); {709#true} is VALID [2018-11-23 13:03:32,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {709#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {709#true} is VALID [2018-11-23 13:03:32,687 INFO L273 TraceCheckUtils]: 2: Hoare triple {709#true} assume true; {709#true} is VALID [2018-11-23 13:03:32,687 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {709#true} {709#true} #69#return; {709#true} is VALID [2018-11-23 13:03:32,687 INFO L256 TraceCheckUtils]: 4: Hoare triple {709#true} call #t~ret9 := main(); {709#true} is VALID [2018-11-23 13:03:32,689 INFO L273 TraceCheckUtils]: 5: Hoare triple {709#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {711#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} is VALID [2018-11-23 13:03:32,698 INFO L273 TraceCheckUtils]: 6: Hoare triple {711#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; {712#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-23 13:03:32,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {712#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} #t~short4 := ~i~0 >= 0; {712#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-23 13:03:32,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {712#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; {713#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or (not |main_#t~short4|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))))) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-23 13:03:32,717 INFO L273 TraceCheckUtils]: 9: Hoare triple {713#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or (not |main_#t~short4|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))))) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem5;~i~0 := ~i~0 - 1; {714#(and (= |main_~#v~0.offset| 0) (or (not (= (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) 0)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ (* 4 main_~j~0) |main_~#v~0.offset|))))) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)))} is VALID [2018-11-23 13:03:32,731 INFO L273 TraceCheckUtils]: 10: Hoare triple {714#(and (= |main_~#v~0.offset| 0) (or (not (= (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) 0)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ (* 4 main_~j~0) |main_~#v~0.offset|))))) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)))} #t~short4 := ~i~0 >= 0; {715#(and (= |main_~#v~0.offset| 0) (or |main_#t~short4| (and (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)) (<= (+ main_~i~0 1) 0))) (or (not (= (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) 0)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ (* 4 main_~j~0) |main_~#v~0.offset|))))))} is VALID [2018-11-23 13:03:32,746 INFO L273 TraceCheckUtils]: 11: Hoare triple {715#(and (= |main_~#v~0.offset| 0) (or |main_#t~short4| (and (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)) (<= (+ main_~i~0 1) 0))) (or (not (= (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) 0)) (and (<= main_~j~0 1) (<= 1 main_~j~0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ (* 4 main_~j~0) |main_~#v~0.offset|))))))} assume !#t~short4; {716#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)) (<= (+ main_~i~0 1) 0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ (* 4 main_~j~0) |main_~#v~0.offset|))))} is VALID [2018-11-23 13:03:32,750 INFO L273 TraceCheckUtils]: 12: Hoare triple {716#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)) (<= (+ main_~i~0 1) 0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ (* 4 main_~j~0) |main_~#v~0.offset|))))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {716#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)) (<= (+ main_~i~0 1) 0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ (* 4 main_~j~0) |main_~#v~0.offset|))))} is VALID [2018-11-23 13:03:32,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {716#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 5)) (<= (+ main_~i~0 1) 0) (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ (* 4 main_~j~0) |main_~#v~0.offset|))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {717#(and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~j~0) |main_~#v~0.offset|))) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} is VALID [2018-11-23 13:03:32,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {717#(and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~j~0) |main_~#v~0.offset|))) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {718#(and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))) (= |main_~#v~0.offset| 0))} is VALID [2018-11-23 13:03:32,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {718#(and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))) (= |main_~#v~0.offset| 0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {718#(and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))) (= |main_~#v~0.offset| 0))} is VALID [2018-11-23 13:03:32,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {718#(and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))) (= |main_~#v~0.offset| 0))} ~k~0 := 1; {719#(and (= main_~k~0 1) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))) (= |main_~#v~0.offset| 0))} is VALID [2018-11-23 13:03:32,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {719#(and (= main_~k~0 1) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))) (= |main_~#v~0.offset| 0))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {720#(<= (+ |main_#t~mem7| 1) |main_#t~mem8|)} is VALID [2018-11-23 13:03:32,756 INFO L256 TraceCheckUtils]: 18: Hoare triple {720#(<= (+ |main_#t~mem7| 1) |main_#t~mem8|)} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {721#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:32,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {721#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {722#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:03:32,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {722#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {710#false} is VALID [2018-11-23 13:03:32,759 INFO L273 TraceCheckUtils]: 21: Hoare triple {710#false} assume !false; {710#false} is VALID [2018-11-23 13:03:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:32,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:32,765 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:32,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:32,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:33,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 38 treesize of output 31 [2018-11-23 13:03:33,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:03:33,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 31 treesize of output 47 [2018-11-23 13:03:33,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:33,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:33,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:03:33,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-11-23 13:03:33,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:03:33,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-23 13:03:33,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:03:33,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:03:33,899 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:03:33,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 72 [2018-11-23 13:03:33,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:33,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:33,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:03:33,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-23 13:03:33,942 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:33,943 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, main_~i~0, main_~key~0, v_main_~i~0_8]. (let ((.cse1 (select |v_#memory_int_12| |main_~#v~0.base|)) (.cse2 (* 4 v_main_~i~0_8))) (let ((.cse0 (select .cse1 (+ .cse2 |main_~#v~0.offset|)))) (and (<= v_main_~i~0_8 (+ main_~i~0 1)) (= .cse0 (select .cse1 (+ .cse2 |main_~#v~0.offset| 4))) (= (store |v_#memory_int_12| |main_~#v~0.base| (store .cse1 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4) main_~key~0)) |#memory_int|) (<= (+ main_~key~0 1) .cse0) (<= v_main_~i~0_8 0) (< main_~i~0 0) (<= 0 v_main_~i~0_8)))) [2018-11-23 13:03:33,943 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_8]. (and (let ((.cse0 (select |#memory_int| |main_~#v~0.base|)) (.cse1 (* 4 v_main_~i~0_8))) (<= (+ (select .cse0 (+ .cse1 |main_~#v~0.offset|)) 1) (select .cse0 (+ .cse1 |main_~#v~0.offset| 4)))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8)) [2018-11-23 13:03:34,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 31 [2018-11-23 13:03:34,068 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:03:34,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:03:34,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:03:34,070 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:03:34,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:03:34,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-11-23 13:03:34,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:34,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:34,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:34,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-23 13:03:34,156 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:34,156 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#v~0.base|, v_main_~i~0_8, |main_~#v~0.offset|]. (let ((.cse0 (select |#memory_int| |main_~#v~0.base|))) (and (let ((.cse1 (* 4 v_main_~i~0_8))) (<= (+ (select .cse0 (+ .cse1 |main_~#v~0.offset|)) 1) (select .cse0 (+ .cse1 |main_~#v~0.offset| 4)))) (<= |main_#t~mem7| (select .cse0 |main_~#v~0.offset|)) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8) (<= (select .cse0 (+ |main_~#v~0.offset| 4)) |main_#t~mem8|))) [2018-11-23 13:03:34,156 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ |main_#t~mem7| 1) |main_#t~mem8|) [2018-11-23 13:03:34,283 INFO L256 TraceCheckUtils]: 0: Hoare triple {709#true} call ULTIMATE.init(); {709#true} is VALID [2018-11-23 13:03:34,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {709#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {709#true} is VALID [2018-11-23 13:03:34,283 INFO L273 TraceCheckUtils]: 2: Hoare triple {709#true} assume true; {709#true} is VALID [2018-11-23 13:03:34,284 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {709#true} {709#true} #69#return; {709#true} is VALID [2018-11-23 13:03:34,284 INFO L256 TraceCheckUtils]: 4: Hoare triple {709#true} call #t~ret9 := main(); {709#true} is VALID [2018-11-23 13:03:34,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {709#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {741#(<= main_~j~0 1)} is VALID [2018-11-23 13:03:34,287 INFO L273 TraceCheckUtils]: 6: Hoare triple {741#(<= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; {745#(<= main_~i~0 0)} is VALID [2018-11-23 13:03:34,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {745#(<= main_~i~0 0)} #t~short4 := ~i~0 >= 0; {749#(and (or (and (<= 0 main_~i~0) |main_#t~short4|) (and (not |main_#t~short4|) (< main_~i~0 0))) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:34,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {749#(and (or (and (<= 0 main_~i~0) |main_#t~short4|) (and (not |main_#t~short4|) (< main_~i~0 0))) (<= main_~i~0 0))} assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; {753#(and (<= 0 main_~i~0) (or (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (not |main_#t~short4|)) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:34,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {753#(and (<= 0 main_~i~0) (or (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (not |main_#t~short4|)) (<= main_~i~0 0))} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem5;~i~0 := ~i~0 - 1; {757#(exists ((v_main_~i~0_8 Int)) (and (<= v_main_~i~0_8 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)))))} is VALID [2018-11-23 13:03:34,293 INFO L273 TraceCheckUtils]: 10: Hoare triple {757#(exists ((v_main_~i~0_8 Int)) (and (<= v_main_~i~0_8 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)))))} #t~short4 := ~i~0 >= 0; {761#(or (and (<= 0 main_~i~0) (exists ((v_main_~i~0_8 Int)) (and (<= v_main_~i~0_8 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|))))) |main_#t~short4|) (and (exists ((v_main_~i~0_8 Int)) (and (<= v_main_~i~0_8 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|))))) (not |main_#t~short4|) (< main_~i~0 0)))} is VALID [2018-11-23 13:03:34,294 INFO L273 TraceCheckUtils]: 11: Hoare triple {761#(or (and (<= 0 main_~i~0) (exists ((v_main_~i~0_8 Int)) (and (<= v_main_~i~0_8 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|))))) |main_#t~short4|) (and (exists ((v_main_~i~0_8 Int)) (and (<= v_main_~i~0_8 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|))))) (not |main_#t~short4|) (< main_~i~0 0)))} assume !#t~short4; {765#(and (exists ((v_main_~i~0_8 Int)) (and (<= v_main_~i~0_8 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|))))) (< main_~i~0 0))} is VALID [2018-11-23 13:03:34,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {765#(and (exists ((v_main_~i~0_8 Int)) (and (<= v_main_~i~0_8 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|))))) (< main_~i~0 0))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {765#(and (exists ((v_main_~i~0_8 Int)) (and (<= v_main_~i~0_8 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|))))) (< main_~i~0 0))} is VALID [2018-11-23 13:03:34,296 INFO L273 TraceCheckUtils]: 13: Hoare triple {765#(and (exists ((v_main_~i~0_8 Int)) (and (<= v_main_~i~0_8 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|))))) (< main_~i~0 0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {772#(exists ((v_main_~i~0_8 Int)) (and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8)))} is VALID [2018-11-23 13:03:34,299 INFO L273 TraceCheckUtils]: 14: Hoare triple {772#(exists ((v_main_~i~0_8 Int)) (and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8)))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {772#(exists ((v_main_~i~0_8 Int)) (and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8)))} is VALID [2018-11-23 13:03:34,300 INFO L273 TraceCheckUtils]: 15: Hoare triple {772#(exists ((v_main_~i~0_8 Int)) (and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {772#(exists ((v_main_~i~0_8 Int)) (and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8)))} is VALID [2018-11-23 13:03:34,301 INFO L273 TraceCheckUtils]: 16: Hoare triple {772#(exists ((v_main_~i~0_8 Int)) (and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8)))} ~k~0 := 1; {782#(and (= main_~k~0 1) (exists ((v_main_~i~0_8 Int)) (and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8))))} is VALID [2018-11-23 13:03:34,302 INFO L273 TraceCheckUtils]: 17: Hoare triple {782#(and (= main_~k~0 1) (exists ((v_main_~i~0_8 Int)) (and (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset|)) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 v_main_~i~0_8) |main_~#v~0.offset| 4))) (<= v_main_~i~0_8 0) (<= 0 v_main_~i~0_8))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {720#(<= (+ |main_#t~mem7| 1) |main_#t~mem8|)} is VALID [2018-11-23 13:03:34,303 INFO L256 TraceCheckUtils]: 18: Hoare triple {720#(<= (+ |main_#t~mem7| 1) |main_#t~mem8|)} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {721#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:34,303 INFO L273 TraceCheckUtils]: 19: Hoare triple {721#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {722#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:03:34,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {722#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {710#false} is VALID [2018-11-23 13:03:34,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {710#false} assume !false; {710#false} is VALID [2018-11-23 13:03:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:34,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:34,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-11-23 13:03:34,331 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-11-23 13:03:34,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:34,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:03:34,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:34,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:03:34,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:03:34,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:03:34,386 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 23 states. [2018-11-23 13:03:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:36,602 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2018-11-23 13:03:36,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:03:36,602 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-11-23 13:03:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:03:36,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 91 transitions. [2018-11-23 13:03:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:03:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 91 transitions. [2018-11-23 13:03:36,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 91 transitions. [2018-11-23 13:03:36,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:36,733 INFO L225 Difference]: With dead ends: 95 [2018-11-23 13:03:36,733 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 13:03:36,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:03:36,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 13:03:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2018-11-23 13:03:36,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:36,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 40 states. [2018-11-23 13:03:36,846 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 40 states. [2018-11-23 13:03:36,846 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 40 states. [2018-11-23 13:03:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:36,851 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-23 13:03:36,851 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-11-23 13:03:36,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:36,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:36,852 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 64 states. [2018-11-23 13:03:36,852 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 64 states. [2018-11-23 13:03:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:36,856 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-23 13:03:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-11-23 13:03:36,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:36,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:36,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:36,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:03:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-23 13:03:36,860 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 22 [2018-11-23 13:03:36,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:36,860 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-23 13:03:36,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:03:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 13:03:36,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:03:36,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:36,862 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:36,862 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:36,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:36,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1126706988, now seen corresponding path program 2 times [2018-11-23 13:03:36,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:36,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:36,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:36,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:36,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:37,779 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 13:03:37,784 INFO L168 Benchmark]: Toolchain (without parser) took 14443.37 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 849.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -439.2 MB). Peak memory consumption was 410.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:37,785 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:03:37,786 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:37,787 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:03:37,787 INFO L168 Benchmark]: Boogie Preprocessor took 46.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:03:37,787 INFO L168 Benchmark]: RCFGBuilder took 698.67 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 695.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -717.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:37,788 INFO L168 Benchmark]: TraceAbstraction took 13317.71 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 154.1 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 267.5 MB). Peak memory consumption was 421.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:37,792 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 347.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 698.67 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 695.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -717.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13317.71 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 154.1 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 267.5 MB). Peak memory consumption was 421.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...