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/reducercommutativity/max_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:16:21,561 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:16:21,563 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:16:21,582 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:16:21,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:16:21,584 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:16:21,586 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:16:21,588 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:16:21,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:16:21,590 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:16:21,591 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:16:21,592 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:16:21,593 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:16:21,594 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:16:21,595 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:16:21,596 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:16:21,597 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:16:21,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:16:21,601 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:16:21,603 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:16:21,604 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:16:21,605 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:16:21,608 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:16:21,608 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:16:21,608 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:16:21,609 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:16:21,610 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:16:21,611 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:16:21,612 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:16:21,613 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:16:21,613 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:16:21,614 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:16:21,614 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:16:21,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:16:21,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:16:21,616 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:16:21,617 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 12:16:21,640 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:16:21,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:16:21,642 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:16:21,642 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:16:21,642 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:16:21,643 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:16:21,643 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:16:21,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:16:21,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:16:21,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:16:21,646 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:16:21,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:16:21,646 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:16:21,647 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:16:21,647 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:16:21,647 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:16:21,647 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:16:21,647 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:16:21,648 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:16:21,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:16:21,649 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:16:21,649 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:16:21,649 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:16:21,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:16:21,650 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:16:21,650 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:16:21,650 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:16:21,650 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:16:21,650 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:16:21,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:16:21,651 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:16:21,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:16:21,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:16:21,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:16:21,739 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:16:21,739 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:16:21,740 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/max_true-unreach-call_true-termination.i [2018-11-23 12:16:21,805 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4616f9613/758175d1c1674e889488e778eea11d59/FLAG6cfd751ed [2018-11-23 12:16:22,260 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:16:22,261 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/max_true-unreach-call_true-termination.i [2018-11-23 12:16:22,267 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4616f9613/758175d1c1674e889488e778eea11d59/FLAG6cfd751ed [2018-11-23 12:16:22,611 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4616f9613/758175d1c1674e889488e778eea11d59 [2018-11-23 12:16:22,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:16:22,623 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:16:22,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:22,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:16:22,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:16:22,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:22" (1/1) ... [2018-11-23 12:16:22,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cec6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:22, skipping insertion in model container [2018-11-23 12:16:22,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:22" (1/1) ... [2018-11-23 12:16:22,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:16:22,667 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:16:22,895 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:22,912 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:16:22,946 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:22,964 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:16:22,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:22 WrapperNode [2018-11-23 12:16:22,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:22,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:22,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:16:22,966 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:16:22,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:22" (1/1) ... [2018-11-23 12:16:22,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:22" (1/1) ... [2018-11-23 12:16:22,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:22,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:16:22,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:16:22,993 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:16:23,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:22" (1/1) ... [2018-11-23 12:16:23,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:22" (1/1) ... [2018-11-23 12:16:23,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:22" (1/1) ... [2018-11-23 12:16:23,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:22" (1/1) ... [2018-11-23 12:16:23,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:22" (1/1) ... [2018-11-23 12:16:23,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:22" (1/1) ... [2018-11-23 12:16:23,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:22" (1/1) ... [2018-11-23 12:16:23,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:16:23,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:16:23,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:16:23,028 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:16:23,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:22" (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 12:16:23,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:16:23,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:16:23,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:16:23,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:16:23,157 INFO L130 BoogieDeclarations]: Found specification of procedure max [2018-11-23 12:16:23,157 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2018-11-23 12:16:23,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:16:23,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:16:23,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:16:23,157 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:16:23,157 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:16:23,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:16:23,805 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:16:23,805 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:16:23,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:23 BoogieIcfgContainer [2018-11-23 12:16:23,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:16:23,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:16:23,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:16:23,810 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:16:23,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:16:22" (1/3) ... [2018-11-23 12:16:23,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1497cc51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:23, skipping insertion in model container [2018-11-23 12:16:23,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:22" (2/3) ... [2018-11-23 12:16:23,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1497cc51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:23, skipping insertion in model container [2018-11-23 12:16:23,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:23" (3/3) ... [2018-11-23 12:16:23,814 INFO L112 eAbstractionObserver]: Analyzing ICFG max_true-unreach-call_true-termination.i [2018-11-23 12:16:23,823 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:16:23,830 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:16:23,848 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:16:23,879 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:16:23,880 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:16:23,880 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:16:23,880 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:16:23,881 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:16:23,881 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:16:23,881 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:16:23,881 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:16:23,881 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:16:23,898 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-23 12:16:23,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:16:23,905 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:23,906 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:23,909 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:23,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:23,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1705268457, now seen corresponding path program 1 times [2018-11-23 12:16:23,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:23,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:23,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:23,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:23,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:24,149 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-23 12:16:24,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {36#true} is VALID [2018-11-23 12:16:24,156 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 12:16:24,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #67#return; {36#true} is VALID [2018-11-23 12:16:24,157 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret13 := main(); {36#true} is VALID [2018-11-23 12:16:24,157 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {36#true} is VALID [2018-11-23 12:16:24,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {36#true} is VALID [2018-11-23 12:16:24,158 INFO L256 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~ret5 := max(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-23 12:16:24,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {36#true} is VALID [2018-11-23 12:16:24,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-23 12:16:24,176 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {37#false} is VALID [2018-11-23 12:16:24,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-23 12:16:24,176 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#false} {36#true} #71#return; {37#false} is VALID [2018-11-23 12:16:24,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {37#false} is VALID [2018-11-23 12:16:24,177 INFO L256 TraceCheckUtils]: 14: Hoare triple {37#false} call #t~ret8 := max(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-23 12:16:24,177 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {36#true} is VALID [2018-11-23 12:16:24,180 INFO L273 TraceCheckUtils]: 16: Hoare triple {36#true} assume !true; {36#true} is VALID [2018-11-23 12:16:24,181 INFO L273 TraceCheckUtils]: 17: Hoare triple {36#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {36#true} is VALID [2018-11-23 12:16:24,181 INFO L273 TraceCheckUtils]: 18: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 12:16:24,181 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {36#true} {37#false} #73#return; {37#false} is VALID [2018-11-23 12:16:24,182 INFO L273 TraceCheckUtils]: 20: Hoare triple {37#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0; {37#false} is VALID [2018-11-23 12:16:24,182 INFO L273 TraceCheckUtils]: 21: Hoare triple {37#false} assume !(~i~1 < ~N~0 - 1); {37#false} is VALID [2018-11-23 12:16:24,183 INFO L273 TraceCheckUtils]: 22: Hoare triple {37#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {37#false} is VALID [2018-11-23 12:16:24,183 INFO L256 TraceCheckUtils]: 23: Hoare triple {37#false} call #t~ret12 := max(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-23 12:16:24,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {36#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {36#true} is VALID [2018-11-23 12:16:24,185 INFO L273 TraceCheckUtils]: 25: Hoare triple {36#true} assume !true; {36#true} is VALID [2018-11-23 12:16:24,185 INFO L273 TraceCheckUtils]: 26: Hoare triple {36#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {36#true} is VALID [2018-11-23 12:16:24,186 INFO L273 TraceCheckUtils]: 27: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 12:16:24,186 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {36#true} {37#false} #75#return; {37#false} is VALID [2018-11-23 12:16:24,186 INFO L273 TraceCheckUtils]: 29: Hoare triple {37#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {37#false} is VALID [2018-11-23 12:16:24,187 INFO L273 TraceCheckUtils]: 30: Hoare triple {37#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {37#false} is VALID [2018-11-23 12:16:24,188 INFO L273 TraceCheckUtils]: 31: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-23 12:16:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:16:24,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:24,209 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 12:16:24,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:24,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:24,450 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-23 12:16:24,451 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {36#true} is VALID [2018-11-23 12:16:24,451 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 12:16:24,452 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #67#return; {36#true} is VALID [2018-11-23 12:16:24,452 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret13 := main(); {36#true} is VALID [2018-11-23 12:16:24,452 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {36#true} is VALID [2018-11-23 12:16:24,453 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {36#true} is VALID [2018-11-23 12:16:24,453 INFO L256 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~ret5 := max(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-23 12:16:24,454 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {36#true} is VALID [2018-11-23 12:16:24,463 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-23 12:16:24,463 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {37#false} is VALID [2018-11-23 12:16:24,464 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-23 12:16:24,464 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#false} {36#true} #71#return; {37#false} is VALID [2018-11-23 12:16:24,464 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {37#false} is VALID [2018-11-23 12:16:24,465 INFO L256 TraceCheckUtils]: 14: Hoare triple {37#false} call #t~ret8 := max(~#x~0.base, ~#x~0.offset); {37#false} is VALID [2018-11-23 12:16:24,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {37#false} is VALID [2018-11-23 12:16:24,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-23 12:16:24,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {37#false} is VALID [2018-11-23 12:16:24,466 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-23 12:16:24,466 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {37#false} {37#false} #73#return; {37#false} is VALID [2018-11-23 12:16:24,467 INFO L273 TraceCheckUtils]: 20: Hoare triple {37#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0; {37#false} is VALID [2018-11-23 12:16:24,467 INFO L273 TraceCheckUtils]: 21: Hoare triple {37#false} assume !(~i~1 < ~N~0 - 1); {37#false} is VALID [2018-11-23 12:16:24,467 INFO L273 TraceCheckUtils]: 22: Hoare triple {37#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {37#false} is VALID [2018-11-23 12:16:24,468 INFO L256 TraceCheckUtils]: 23: Hoare triple {37#false} call #t~ret12 := max(~#x~0.base, ~#x~0.offset); {37#false} is VALID [2018-11-23 12:16:24,468 INFO L273 TraceCheckUtils]: 24: Hoare triple {37#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {37#false} is VALID [2018-11-23 12:16:24,468 INFO L273 TraceCheckUtils]: 25: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-23 12:16:24,469 INFO L273 TraceCheckUtils]: 26: Hoare triple {37#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {37#false} is VALID [2018-11-23 12:16:24,469 INFO L273 TraceCheckUtils]: 27: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-23 12:16:24,469 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {37#false} {37#false} #75#return; {37#false} is VALID [2018-11-23 12:16:24,470 INFO L273 TraceCheckUtils]: 29: Hoare triple {37#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {37#false} is VALID [2018-11-23 12:16:24,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {37#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {37#false} is VALID [2018-11-23 12:16:24,470 INFO L273 TraceCheckUtils]: 31: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-23 12:16:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 12:16:24,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:16:24,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2018-11-23 12:16:24,509 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:16:24,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:24,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:16:24,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:24,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:16:24,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:16:24,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:16:24,743 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-23 12:16:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:24,922 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2018-11-23 12:16:24,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:16:24,922 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:16:24,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:16:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 12:16:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:16:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 12:16:24,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 75 transitions. [2018-11-23 12:16:25,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:25,384 INFO L225 Difference]: With dead ends: 58 [2018-11-23 12:16:25,384 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:16:25,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 33 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 12:16:25,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:16:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:16:25,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:25,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:25,561 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:25,562 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:25,574 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 12:16:25,575 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:16:25,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:25,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:25,576 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:25,576 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:25,584 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 12:16:25,584 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:16:25,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:25,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:25,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:25,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:16:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:16:25,591 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:16:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:25,592 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:16:25,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:16:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:16:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:16:25,594 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:25,594 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:25,595 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:25,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:25,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1312973782, now seen corresponding path program 1 times [2018-11-23 12:16:25,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:25,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:25,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:25,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:25,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:25,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 12:16:25,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {297#true} is VALID [2018-11-23 12:16:25,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 12:16:25,826 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #67#return; {297#true} is VALID [2018-11-23 12:16:25,826 INFO L256 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret13 := main(); {297#true} is VALID [2018-11-23 12:16:25,826 INFO L273 TraceCheckUtils]: 5: Hoare triple {297#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {297#true} is VALID [2018-11-23 12:16:25,830 INFO L273 TraceCheckUtils]: 6: Hoare triple {297#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {299#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:25,830 INFO L256 TraceCheckUtils]: 7: Hoare triple {299#(<= 2 ~N~0)} call #t~ret5 := max(~#x~0.base, ~#x~0.offset); {297#true} is VALID [2018-11-23 12:16:25,831 INFO L273 TraceCheckUtils]: 8: Hoare triple {297#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {300#(= max_~i~0 0)} is VALID [2018-11-23 12:16:25,831 INFO L273 TraceCheckUtils]: 9: Hoare triple {300#(= max_~i~0 0)} assume !(~i~0 < ~N~0); {301#(<= ~N~0 0)} is VALID [2018-11-23 12:16:25,833 INFO L273 TraceCheckUtils]: 10: Hoare triple {301#(<= ~N~0 0)} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {301#(<= ~N~0 0)} is VALID [2018-11-23 12:16:25,833 INFO L273 TraceCheckUtils]: 11: Hoare triple {301#(<= ~N~0 0)} assume true; {301#(<= ~N~0 0)} is VALID [2018-11-23 12:16:25,845 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {301#(<= ~N~0 0)} {299#(<= 2 ~N~0)} #71#return; {298#false} is VALID [2018-11-23 12:16:25,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {298#false} is VALID [2018-11-23 12:16:25,846 INFO L256 TraceCheckUtils]: 14: Hoare triple {298#false} call #t~ret8 := max(~#x~0.base, ~#x~0.offset); {297#true} is VALID [2018-11-23 12:16:25,846 INFO L273 TraceCheckUtils]: 15: Hoare triple {297#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {297#true} is VALID [2018-11-23 12:16:25,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {297#true} assume !(~i~0 < ~N~0); {297#true} is VALID [2018-11-23 12:16:25,848 INFO L273 TraceCheckUtils]: 17: Hoare triple {297#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {297#true} is VALID [2018-11-23 12:16:25,848 INFO L273 TraceCheckUtils]: 18: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 12:16:25,848 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {297#true} {298#false} #73#return; {298#false} is VALID [2018-11-23 12:16:25,849 INFO L273 TraceCheckUtils]: 20: Hoare triple {298#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0; {298#false} is VALID [2018-11-23 12:16:25,849 INFO L273 TraceCheckUtils]: 21: Hoare triple {298#false} assume !(~i~1 < ~N~0 - 1); {298#false} is VALID [2018-11-23 12:16:25,849 INFO L273 TraceCheckUtils]: 22: Hoare triple {298#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {298#false} is VALID [2018-11-23 12:16:25,850 INFO L256 TraceCheckUtils]: 23: Hoare triple {298#false} call #t~ret12 := max(~#x~0.base, ~#x~0.offset); {297#true} is VALID [2018-11-23 12:16:25,850 INFO L273 TraceCheckUtils]: 24: Hoare triple {297#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {297#true} is VALID [2018-11-23 12:16:25,850 INFO L273 TraceCheckUtils]: 25: Hoare triple {297#true} assume !(~i~0 < ~N~0); {297#true} is VALID [2018-11-23 12:16:25,851 INFO L273 TraceCheckUtils]: 26: Hoare triple {297#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {297#true} is VALID [2018-11-23 12:16:25,851 INFO L273 TraceCheckUtils]: 27: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 12:16:25,851 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {297#true} {298#false} #75#return; {298#false} is VALID [2018-11-23 12:16:25,853 INFO L273 TraceCheckUtils]: 29: Hoare triple {298#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {298#false} is VALID [2018-11-23 12:16:25,854 INFO L273 TraceCheckUtils]: 30: Hoare triple {298#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {298#false} is VALID [2018-11-23 12:16:25,854 INFO L273 TraceCheckUtils]: 31: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 12:16:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:16:25,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:25,859 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 12:16:25,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:25,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:26,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 12:16:26,280 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {297#true} is VALID [2018-11-23 12:16:26,281 INFO L273 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 12:16:26,281 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #67#return; {297#true} is VALID [2018-11-23 12:16:26,281 INFO L256 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret13 := main(); {297#true} is VALID [2018-11-23 12:16:26,281 INFO L273 TraceCheckUtils]: 5: Hoare triple {297#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {297#true} is VALID [2018-11-23 12:16:26,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {297#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {299#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:26,283 INFO L256 TraceCheckUtils]: 7: Hoare triple {299#(<= 2 ~N~0)} call #t~ret5 := max(~#x~0.base, ~#x~0.offset); {299#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:26,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {299#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {329#(and (<= 2 ~N~0) (<= max_~i~0 0))} is VALID [2018-11-23 12:16:26,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {329#(and (<= 2 ~N~0) (<= max_~i~0 0))} assume !(~i~0 < ~N~0); {298#false} is VALID [2018-11-23 12:16:26,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {298#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {298#false} is VALID [2018-11-23 12:16:26,291 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-23 12:16:26,291 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {298#false} {299#(<= 2 ~N~0)} #71#return; {298#false} is VALID [2018-11-23 12:16:26,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {298#false} is VALID [2018-11-23 12:16:26,292 INFO L256 TraceCheckUtils]: 14: Hoare triple {298#false} call #t~ret8 := max(~#x~0.base, ~#x~0.offset); {298#false} is VALID [2018-11-23 12:16:26,292 INFO L273 TraceCheckUtils]: 15: Hoare triple {298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {298#false} is VALID [2018-11-23 12:16:26,292 INFO L273 TraceCheckUtils]: 16: Hoare triple {298#false} assume !(~i~0 < ~N~0); {298#false} is VALID [2018-11-23 12:16:26,293 INFO L273 TraceCheckUtils]: 17: Hoare triple {298#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {298#false} is VALID [2018-11-23 12:16:26,293 INFO L273 TraceCheckUtils]: 18: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-23 12:16:26,293 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {298#false} {298#false} #73#return; {298#false} is VALID [2018-11-23 12:16:26,294 INFO L273 TraceCheckUtils]: 20: Hoare triple {298#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0; {298#false} is VALID [2018-11-23 12:16:26,295 INFO L273 TraceCheckUtils]: 21: Hoare triple {298#false} assume !(~i~1 < ~N~0 - 1); {298#false} is VALID [2018-11-23 12:16:26,295 INFO L273 TraceCheckUtils]: 22: Hoare triple {298#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {298#false} is VALID [2018-11-23 12:16:26,295 INFO L256 TraceCheckUtils]: 23: Hoare triple {298#false} call #t~ret12 := max(~#x~0.base, ~#x~0.offset); {298#false} is VALID [2018-11-23 12:16:26,295 INFO L273 TraceCheckUtils]: 24: Hoare triple {298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {298#false} is VALID [2018-11-23 12:16:26,296 INFO L273 TraceCheckUtils]: 25: Hoare triple {298#false} assume !(~i~0 < ~N~0); {298#false} is VALID [2018-11-23 12:16:26,296 INFO L273 TraceCheckUtils]: 26: Hoare triple {298#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {298#false} is VALID [2018-11-23 12:16:26,296 INFO L273 TraceCheckUtils]: 27: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-23 12:16:26,297 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {298#false} {298#false} #75#return; {298#false} is VALID [2018-11-23 12:16:26,297 INFO L273 TraceCheckUtils]: 29: Hoare triple {298#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {298#false} is VALID [2018-11-23 12:16:26,297 INFO L273 TraceCheckUtils]: 30: Hoare triple {298#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {298#false} is VALID [2018-11-23 12:16:26,298 INFO L273 TraceCheckUtils]: 31: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 12:16:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 12:16:26,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:16:26,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2018-11-23 12:16:26,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-23 12:16:26,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:26,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:16:26,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:26,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:16:26,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:16:26,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:16:26,504 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2018-11-23 12:16:26,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:26,996 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-11-23 12:16:26,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:16:26,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-23 12:16:26,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:16:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2018-11-23 12:16:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:16:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2018-11-23 12:16:27,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2018-11-23 12:16:27,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:27,169 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:16:27,169 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:16:27,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:16:27,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:16:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-23 12:16:27,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:27,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2018-11-23 12:16:27,202 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2018-11-23 12:16:27,202 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2018-11-23 12:16:27,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:27,210 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 12:16:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:16:27,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:27,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:27,211 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2018-11-23 12:16:27,212 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2018-11-23 12:16:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:27,215 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 12:16:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:16:27,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:27,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:27,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:27,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:16:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:16:27,221 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 32 [2018-11-23 12:16:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:27,221 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:16:27,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:16:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:16:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:16:27,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:27,223 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:27,224 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:27,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:27,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2020573253, now seen corresponding path program 1 times [2018-11-23 12:16:27,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:27,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:27,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:27,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2018-11-23 12:16:27,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {568#true} is VALID [2018-11-23 12:16:27,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {568#true} assume true; {568#true} is VALID [2018-11-23 12:16:27,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {568#true} {568#true} #67#return; {568#true} is VALID [2018-11-23 12:16:27,403 INFO L256 TraceCheckUtils]: 4: Hoare triple {568#true} call #t~ret13 := main(); {568#true} is VALID [2018-11-23 12:16:27,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {568#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {568#true} is VALID [2018-11-23 12:16:27,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {568#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {570#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:27,404 INFO L256 TraceCheckUtils]: 7: Hoare triple {570#(<= 2 ~N~0)} call #t~ret5 := max(~#x~0.base, ~#x~0.offset); {568#true} is VALID [2018-11-23 12:16:27,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {571#(= max_~i~0 0)} is VALID [2018-11-23 12:16:27,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {571#(= max_~i~0 0)} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {571#(= max_~i~0 0)} is VALID [2018-11-23 12:16:27,408 INFO L273 TraceCheckUtils]: 10: Hoare triple {571#(= max_~i~0 0)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {571#(= max_~i~0 0)} is VALID [2018-11-23 12:16:27,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {571#(= max_~i~0 0)} ~ret~0 := #t~ite3;havoc #t~ite3;havoc #t~mem1;havoc #t~mem2; {571#(= max_~i~0 0)} is VALID [2018-11-23 12:16:27,410 INFO L273 TraceCheckUtils]: 12: Hoare triple {571#(= max_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {572#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:27,410 INFO L273 TraceCheckUtils]: 13: Hoare triple {572#(<= max_~i~0 1)} assume !(~i~0 < ~N~0); {573#(<= ~N~0 1)} is VALID [2018-11-23 12:16:27,412 INFO L273 TraceCheckUtils]: 14: Hoare triple {573#(<= ~N~0 1)} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {573#(<= ~N~0 1)} is VALID [2018-11-23 12:16:27,412 INFO L273 TraceCheckUtils]: 15: Hoare triple {573#(<= ~N~0 1)} assume true; {573#(<= ~N~0 1)} is VALID [2018-11-23 12:16:27,414 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {573#(<= ~N~0 1)} {570#(<= 2 ~N~0)} #71#return; {569#false} is VALID [2018-11-23 12:16:27,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {569#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {569#false} is VALID [2018-11-23 12:16:27,415 INFO L256 TraceCheckUtils]: 18: Hoare triple {569#false} call #t~ret8 := max(~#x~0.base, ~#x~0.offset); {568#true} is VALID [2018-11-23 12:16:27,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {568#true} is VALID [2018-11-23 12:16:27,415 INFO L273 TraceCheckUtils]: 20: Hoare triple {568#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {568#true} is VALID [2018-11-23 12:16:27,416 INFO L273 TraceCheckUtils]: 21: Hoare triple {568#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {568#true} is VALID [2018-11-23 12:16:27,416 INFO L273 TraceCheckUtils]: 22: Hoare triple {568#true} ~ret~0 := #t~ite3;havoc #t~ite3;havoc #t~mem1;havoc #t~mem2; {568#true} is VALID [2018-11-23 12:16:27,416 INFO L273 TraceCheckUtils]: 23: Hoare triple {568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {568#true} is VALID [2018-11-23 12:16:27,417 INFO L273 TraceCheckUtils]: 24: Hoare triple {568#true} assume !(~i~0 < ~N~0); {568#true} is VALID [2018-11-23 12:16:27,417 INFO L273 TraceCheckUtils]: 25: Hoare triple {568#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {568#true} is VALID [2018-11-23 12:16:27,418 INFO L273 TraceCheckUtils]: 26: Hoare triple {568#true} assume true; {568#true} is VALID [2018-11-23 12:16:27,418 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {568#true} {569#false} #73#return; {569#false} is VALID [2018-11-23 12:16:27,419 INFO L273 TraceCheckUtils]: 28: Hoare triple {569#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0; {569#false} is VALID [2018-11-23 12:16:27,419 INFO L273 TraceCheckUtils]: 29: Hoare triple {569#false} assume !(~i~1 < ~N~0 - 1); {569#false} is VALID [2018-11-23 12:16:27,419 INFO L273 TraceCheckUtils]: 30: Hoare triple {569#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {569#false} is VALID [2018-11-23 12:16:27,419 INFO L256 TraceCheckUtils]: 31: Hoare triple {569#false} call #t~ret12 := max(~#x~0.base, ~#x~0.offset); {568#true} is VALID [2018-11-23 12:16:27,419 INFO L273 TraceCheckUtils]: 32: Hoare triple {568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {568#true} is VALID [2018-11-23 12:16:27,420 INFO L273 TraceCheckUtils]: 33: Hoare triple {568#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {568#true} is VALID [2018-11-23 12:16:27,420 INFO L273 TraceCheckUtils]: 34: Hoare triple {568#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {568#true} is VALID [2018-11-23 12:16:27,420 INFO L273 TraceCheckUtils]: 35: Hoare triple {568#true} ~ret~0 := #t~ite3;havoc #t~ite3;havoc #t~mem1;havoc #t~mem2; {568#true} is VALID [2018-11-23 12:16:27,420 INFO L273 TraceCheckUtils]: 36: Hoare triple {568#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {568#true} is VALID [2018-11-23 12:16:27,420 INFO L273 TraceCheckUtils]: 37: Hoare triple {568#true} assume !(~i~0 < ~N~0); {568#true} is VALID [2018-11-23 12:16:27,421 INFO L273 TraceCheckUtils]: 38: Hoare triple {568#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {568#true} is VALID [2018-11-23 12:16:27,421 INFO L273 TraceCheckUtils]: 39: Hoare triple {568#true} assume true; {568#true} is VALID [2018-11-23 12:16:27,421 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {568#true} {569#false} #75#return; {569#false} is VALID [2018-11-23 12:16:27,421 INFO L273 TraceCheckUtils]: 41: Hoare triple {569#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {569#false} is VALID [2018-11-23 12:16:27,422 INFO L273 TraceCheckUtils]: 42: Hoare triple {569#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {569#false} is VALID [2018-11-23 12:16:27,422 INFO L273 TraceCheckUtils]: 43: Hoare triple {569#false} assume !false; {569#false} is VALID [2018-11-23 12:16:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:16:27,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:27,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:16:27,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:27,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:27,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2018-11-23 12:16:27,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {568#true} is VALID [2018-11-23 12:16:27,700 INFO L273 TraceCheckUtils]: 2: Hoare triple {568#true} assume true; {568#true} is VALID [2018-11-23 12:16:27,701 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {568#true} {568#true} #67#return; {568#true} is VALID [2018-11-23 12:16:27,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {568#true} call #t~ret13 := main(); {568#true} is VALID [2018-11-23 12:16:27,701 INFO L273 TraceCheckUtils]: 5: Hoare triple {568#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {568#true} is VALID [2018-11-23 12:16:27,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {568#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {570#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:27,703 INFO L256 TraceCheckUtils]: 7: Hoare triple {570#(<= 2 ~N~0)} call #t~ret5 := max(~#x~0.base, ~#x~0.offset); {570#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:27,703 INFO L273 TraceCheckUtils]: 8: Hoare triple {570#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {601#(and (<= 2 ~N~0) (<= max_~i~0 0))} is VALID [2018-11-23 12:16:27,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {601#(and (<= 2 ~N~0) (<= max_~i~0 0))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {601#(and (<= 2 ~N~0) (<= max_~i~0 0))} is VALID [2018-11-23 12:16:27,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {601#(and (<= 2 ~N~0) (<= max_~i~0 0))} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {601#(and (<= 2 ~N~0) (<= max_~i~0 0))} is VALID [2018-11-23 12:16:27,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {601#(and (<= 2 ~N~0) (<= max_~i~0 0))} ~ret~0 := #t~ite3;havoc #t~ite3;havoc #t~mem1;havoc #t~mem2; {601#(and (<= 2 ~N~0) (<= max_~i~0 0))} is VALID [2018-11-23 12:16:27,707 INFO L273 TraceCheckUtils]: 12: Hoare triple {601#(and (<= 2 ~N~0) (<= max_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {614#(and (<= 2 ~N~0) (<= max_~i~0 1))} is VALID [2018-11-23 12:16:27,708 INFO L273 TraceCheckUtils]: 13: Hoare triple {614#(and (<= 2 ~N~0) (<= max_~i~0 1))} assume !(~i~0 < ~N~0); {569#false} is VALID [2018-11-23 12:16:27,709 INFO L273 TraceCheckUtils]: 14: Hoare triple {569#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {569#false} is VALID [2018-11-23 12:16:27,709 INFO L273 TraceCheckUtils]: 15: Hoare triple {569#false} assume true; {569#false} is VALID [2018-11-23 12:16:27,710 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {569#false} {570#(<= 2 ~N~0)} #71#return; {569#false} is VALID [2018-11-23 12:16:27,710 INFO L273 TraceCheckUtils]: 17: Hoare triple {569#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {569#false} is VALID [2018-11-23 12:16:27,711 INFO L256 TraceCheckUtils]: 18: Hoare triple {569#false} call #t~ret8 := max(~#x~0.base, ~#x~0.offset); {569#false} is VALID [2018-11-23 12:16:27,711 INFO L273 TraceCheckUtils]: 19: Hoare triple {569#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {569#false} is VALID [2018-11-23 12:16:27,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {569#false} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {569#false} is VALID [2018-11-23 12:16:27,712 INFO L273 TraceCheckUtils]: 21: Hoare triple {569#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {569#false} is VALID [2018-11-23 12:16:27,713 INFO L273 TraceCheckUtils]: 22: Hoare triple {569#false} ~ret~0 := #t~ite3;havoc #t~ite3;havoc #t~mem1;havoc #t~mem2; {569#false} is VALID [2018-11-23 12:16:27,713 INFO L273 TraceCheckUtils]: 23: Hoare triple {569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {569#false} is VALID [2018-11-23 12:16:27,713 INFO L273 TraceCheckUtils]: 24: Hoare triple {569#false} assume !(~i~0 < ~N~0); {569#false} is VALID [2018-11-23 12:16:27,714 INFO L273 TraceCheckUtils]: 25: Hoare triple {569#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {569#false} is VALID [2018-11-23 12:16:27,714 INFO L273 TraceCheckUtils]: 26: Hoare triple {569#false} assume true; {569#false} is VALID [2018-11-23 12:16:27,714 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {569#false} {569#false} #73#return; {569#false} is VALID [2018-11-23 12:16:27,715 INFO L273 TraceCheckUtils]: 28: Hoare triple {569#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0; {569#false} is VALID [2018-11-23 12:16:27,715 INFO L273 TraceCheckUtils]: 29: Hoare triple {569#false} assume !(~i~1 < ~N~0 - 1); {569#false} is VALID [2018-11-23 12:16:27,715 INFO L273 TraceCheckUtils]: 30: Hoare triple {569#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {569#false} is VALID [2018-11-23 12:16:27,715 INFO L256 TraceCheckUtils]: 31: Hoare triple {569#false} call #t~ret12 := max(~#x~0.base, ~#x~0.offset); {569#false} is VALID [2018-11-23 12:16:27,716 INFO L273 TraceCheckUtils]: 32: Hoare triple {569#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {569#false} is VALID [2018-11-23 12:16:27,716 INFO L273 TraceCheckUtils]: 33: Hoare triple {569#false} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {569#false} is VALID [2018-11-23 12:16:27,716 INFO L273 TraceCheckUtils]: 34: Hoare triple {569#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {569#false} is VALID [2018-11-23 12:16:27,717 INFO L273 TraceCheckUtils]: 35: Hoare triple {569#false} ~ret~0 := #t~ite3;havoc #t~ite3;havoc #t~mem1;havoc #t~mem2; {569#false} is VALID [2018-11-23 12:16:27,717 INFO L273 TraceCheckUtils]: 36: Hoare triple {569#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {569#false} is VALID [2018-11-23 12:16:27,717 INFO L273 TraceCheckUtils]: 37: Hoare triple {569#false} assume !(~i~0 < ~N~0); {569#false} is VALID [2018-11-23 12:16:27,717 INFO L273 TraceCheckUtils]: 38: Hoare triple {569#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {569#false} is VALID [2018-11-23 12:16:27,718 INFO L273 TraceCheckUtils]: 39: Hoare triple {569#false} assume true; {569#false} is VALID [2018-11-23 12:16:27,718 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {569#false} {569#false} #75#return; {569#false} is VALID [2018-11-23 12:16:27,718 INFO L273 TraceCheckUtils]: 41: Hoare triple {569#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {569#false} is VALID [2018-11-23 12:16:27,719 INFO L273 TraceCheckUtils]: 42: Hoare triple {569#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {569#false} is VALID [2018-11-23 12:16:27,719 INFO L273 TraceCheckUtils]: 43: Hoare triple {569#false} assume !false; {569#false} is VALID [2018-11-23 12:16:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 12:16:27,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:27,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-23 12:16:27,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-11-23 12:16:27,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:27,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:16:27,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:27,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:16:27,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:16:27,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:27,819 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 8 states. [2018-11-23 12:16:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:28,257 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2018-11-23 12:16:28,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:16:28,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-11-23 12:16:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:28,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-23 12:16:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-23 12:16:28,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 67 transitions. [2018-11-23 12:16:28,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:28,400 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:16:28,400 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:16:28,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:16:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:16:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-23 12:16:28,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:28,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2018-11-23 12:16:28,418 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2018-11-23 12:16:28,418 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2018-11-23 12:16:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:28,421 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 12:16:28,422 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 12:16:28,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:28,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:28,423 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2018-11-23 12:16:28,423 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2018-11-23 12:16:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:28,426 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 12:16:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 12:16:28,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:28,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:28,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:28,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:16:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 12:16:28,430 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 44 [2018-11-23 12:16:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:28,430 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 12:16:28,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:16:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 12:16:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:16:28,432 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:28,433 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:28,433 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:28,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:28,433 INFO L82 PathProgramCache]: Analyzing trace with hash -543091744, now seen corresponding path program 2 times [2018-11-23 12:16:28,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:28,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:28,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:28,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:28,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:28,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {897#true} call ULTIMATE.init(); {897#true} is VALID [2018-11-23 12:16:28,709 INFO L273 TraceCheckUtils]: 1: Hoare triple {897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {897#true} is VALID [2018-11-23 12:16:28,709 INFO L273 TraceCheckUtils]: 2: Hoare triple {897#true} assume true; {897#true} is VALID [2018-11-23 12:16:28,710 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {897#true} {897#true} #67#return; {897#true} is VALID [2018-11-23 12:16:28,710 INFO L256 TraceCheckUtils]: 4: Hoare triple {897#true} call #t~ret13 := main(); {897#true} is VALID [2018-11-23 12:16:28,710 INFO L273 TraceCheckUtils]: 5: Hoare triple {897#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; {897#true} is VALID [2018-11-23 12:16:28,712 INFO L273 TraceCheckUtils]: 6: Hoare triple {897#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {899#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:28,712 INFO L256 TraceCheckUtils]: 7: Hoare triple {899#(<= 2 ~N~0)} call #t~ret5 := max(~#x~0.base, ~#x~0.offset); {897#true} is VALID [2018-11-23 12:16:28,712 INFO L273 TraceCheckUtils]: 8: Hoare triple {897#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {897#true} is VALID [2018-11-23 12:16:28,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {897#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {897#true} is VALID [2018-11-23 12:16:28,713 INFO L273 TraceCheckUtils]: 10: Hoare triple {897#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {897#true} is VALID [2018-11-23 12:16:28,713 INFO L273 TraceCheckUtils]: 11: Hoare triple {897#true} ~ret~0 := #t~ite3;havoc #t~ite3;havoc #t~mem1;havoc #t~mem2; {897#true} is VALID [2018-11-23 12:16:28,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {897#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {897#true} is VALID [2018-11-23 12:16:28,713 INFO L273 TraceCheckUtils]: 13: Hoare triple {897#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {897#true} is VALID [2018-11-23 12:16:28,714 INFO L273 TraceCheckUtils]: 14: Hoare triple {897#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {897#true} is VALID [2018-11-23 12:16:28,714 INFO L273 TraceCheckUtils]: 15: Hoare triple {897#true} ~ret~0 := #t~ite3;havoc #t~ite3;havoc #t~mem1;havoc #t~mem2; {897#true} is VALID [2018-11-23 12:16:28,714 INFO L273 TraceCheckUtils]: 16: Hoare triple {897#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {897#true} is VALID [2018-11-23 12:16:28,714 INFO L273 TraceCheckUtils]: 17: Hoare triple {897#true} assume !(~i~0 < ~N~0); {897#true} is VALID [2018-11-23 12:16:28,715 INFO L273 TraceCheckUtils]: 18: Hoare triple {897#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {897#true} is VALID [2018-11-23 12:16:28,715 INFO L273 TraceCheckUtils]: 19: Hoare triple {897#true} assume true; {897#true} is VALID [2018-11-23 12:16:28,716 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {897#true} {899#(<= 2 ~N~0)} #71#return; {899#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:28,718 INFO L273 TraceCheckUtils]: 21: Hoare triple {899#(<= 2 ~N~0)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {899#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:28,718 INFO L256 TraceCheckUtils]: 22: Hoare triple {899#(<= 2 ~N~0)} call #t~ret8 := max(~#x~0.base, ~#x~0.offset); {897#true} is VALID [2018-11-23 12:16:28,718 INFO L273 TraceCheckUtils]: 23: Hoare triple {897#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {897#true} is VALID [2018-11-23 12:16:28,718 INFO L273 TraceCheckUtils]: 24: Hoare triple {897#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {897#true} is VALID [2018-11-23 12:16:28,719 INFO L273 TraceCheckUtils]: 25: Hoare triple {897#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {897#true} is VALID [2018-11-23 12:16:28,719 INFO L273 TraceCheckUtils]: 26: Hoare triple {897#true} ~ret~0 := #t~ite3;havoc #t~ite3;havoc #t~mem1;havoc #t~mem2; {897#true} is VALID [2018-11-23 12:16:28,719 INFO L273 TraceCheckUtils]: 27: Hoare triple {897#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {897#true} is VALID [2018-11-23 12:16:28,720 INFO L273 TraceCheckUtils]: 28: Hoare triple {897#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {897#true} is VALID [2018-11-23 12:16:28,720 INFO L273 TraceCheckUtils]: 29: Hoare triple {897#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {897#true} is VALID [2018-11-23 12:16:28,720 INFO L273 TraceCheckUtils]: 30: Hoare triple {897#true} ~ret~0 := #t~ite3;havoc #t~ite3;havoc #t~mem1;havoc #t~mem2; {897#true} is VALID [2018-11-23 12:16:28,721 INFO L273 TraceCheckUtils]: 31: Hoare triple {897#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {897#true} is VALID [2018-11-23 12:16:28,721 INFO L273 TraceCheckUtils]: 32: Hoare triple {897#true} assume !(~i~0 < ~N~0); {897#true} is VALID [2018-11-23 12:16:28,721 INFO L273 TraceCheckUtils]: 33: Hoare triple {897#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {897#true} is VALID [2018-11-23 12:16:28,721 INFO L273 TraceCheckUtils]: 34: Hoare triple {897#true} assume true; {897#true} is VALID [2018-11-23 12:16:28,726 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {897#true} {899#(<= 2 ~N~0)} #73#return; {899#(<= 2 ~N~0)} is VALID [2018-11-23 12:16:28,729 INFO L273 TraceCheckUtils]: 36: Hoare triple {899#(<= 2 ~N~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0; {900#(and (<= 2 ~N~0) (= main_~i~1 0))} is VALID [2018-11-23 12:16:28,730 INFO L273 TraceCheckUtils]: 37: Hoare triple {900#(and (<= 2 ~N~0) (= main_~i~1 0))} assume !(~i~1 < ~N~0 - 1); {898#false} is VALID [2018-11-23 12:16:28,730 INFO L273 TraceCheckUtils]: 38: Hoare triple {898#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {898#false} is VALID [2018-11-23 12:16:28,730 INFO L256 TraceCheckUtils]: 39: Hoare triple {898#false} call #t~ret12 := max(~#x~0.base, ~#x~0.offset); {897#true} is VALID [2018-11-23 12:16:28,731 INFO L273 TraceCheckUtils]: 40: Hoare triple {897#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {897#true} is VALID [2018-11-23 12:16:28,731 INFO L273 TraceCheckUtils]: 41: Hoare triple {897#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {897#true} is VALID [2018-11-23 12:16:28,731 INFO L273 TraceCheckUtils]: 42: Hoare triple {897#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {897#true} is VALID [2018-11-23 12:16:28,732 INFO L273 TraceCheckUtils]: 43: Hoare triple {897#true} ~ret~0 := #t~ite3;havoc #t~ite3;havoc #t~mem1;havoc #t~mem2; {897#true} is VALID [2018-11-23 12:16:28,732 INFO L273 TraceCheckUtils]: 44: Hoare triple {897#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {897#true} is VALID [2018-11-23 12:16:28,732 INFO L273 TraceCheckUtils]: 45: Hoare triple {897#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {897#true} is VALID [2018-11-23 12:16:28,732 INFO L273 TraceCheckUtils]: 46: Hoare triple {897#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {897#true} is VALID [2018-11-23 12:16:28,733 INFO L273 TraceCheckUtils]: 47: Hoare triple {897#true} ~ret~0 := #t~ite3;havoc #t~ite3;havoc #t~mem1;havoc #t~mem2; {897#true} is VALID [2018-11-23 12:16:28,733 INFO L273 TraceCheckUtils]: 48: Hoare triple {897#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {897#true} is VALID [2018-11-23 12:16:28,733 INFO L273 TraceCheckUtils]: 49: Hoare triple {897#true} assume !(~i~0 < ~N~0); {897#true} is VALID [2018-11-23 12:16:28,734 INFO L273 TraceCheckUtils]: 50: Hoare triple {897#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {897#true} is VALID [2018-11-23 12:16:28,734 INFO L273 TraceCheckUtils]: 51: Hoare triple {897#true} assume true; {897#true} is VALID [2018-11-23 12:16:28,734 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {897#true} {898#false} #75#return; {898#false} is VALID [2018-11-23 12:16:28,734 INFO L273 TraceCheckUtils]: 53: Hoare triple {898#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {898#false} is VALID [2018-11-23 12:16:28,735 INFO L273 TraceCheckUtils]: 54: Hoare triple {898#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {898#false} is VALID [2018-11-23 12:16:28,735 INFO L273 TraceCheckUtils]: 55: Hoare triple {898#false} assume !false; {898#false} is VALID [2018-11-23 12:16:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-23 12:16:28,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:28,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:16:28,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-23 12:16:28,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:28,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:16:28,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:28,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:16:28,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:16:28,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:16:28,801 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2018-11-23 12:16:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:28,954 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-23 12:16:28,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:16:28,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-23 12:16:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:16:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2018-11-23 12:16:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:16:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2018-11-23 12:16:28,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2018-11-23 12:16:29,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:29,043 INFO L225 Difference]: With dead ends: 53 [2018-11-23 12:16:29,043 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:16:29,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:16:29,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:16:29,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:16:29,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:29,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:16:29,074 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:16:29,074 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:16:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:29,078 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 12:16:29,078 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:16:29,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:29,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:29,080 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:16:29,080 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:16:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:29,083 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 12:16:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:16:29,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:29,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:29,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:29,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:16:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-23 12:16:29,087 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 56 [2018-11-23 12:16:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:29,087 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-23 12:16:29,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:16:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 12:16:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:16:29,089 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:29,089 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:29,090 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:29,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:29,090 INFO L82 PathProgramCache]: Analyzing trace with hash 423524670, now seen corresponding path program 1 times [2018-11-23 12:16:29,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:29,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:29,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:29,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:29,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:30,624 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-11-23 12:16:30,629 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 12:16:30,634 INFO L168 Benchmark]: Toolchain (without parser) took 8012.01 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -234.5 MB). Peak memory consumption was 471.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:16:30,636 INFO L168 Benchmark]: CDTParser took 0.23 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 12:16:30,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.19 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 12:16:30,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.78 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 12:16:30,638 INFO L168 Benchmark]: Boogie Preprocessor took 34.41 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 12:16:30,638 INFO L168 Benchmark]: RCFGBuilder took 778.01 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -738.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:16:30,639 INFO L168 Benchmark]: TraceAbstraction took 6826.04 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 493.8 MB). Peak memory consumption was 493.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:16:30,644 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.23 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 341.19 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 26.78 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 34.41 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 778.01 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -738.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6826.04 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 493.8 MB). Peak memory consumption was 493.8 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...