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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/reducercommutativity/sum_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:03:42,401 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:03:42,405 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:03:42,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:03:42,424 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:03:42,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:03:42,426 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:03:42,429 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:03:42,430 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:03:42,432 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:03:42,433 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:03:42,433 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:03:42,435 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:03:42,438 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:03:42,446 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:03:42,447 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:03:42,448 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:03:42,451 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:03:42,456 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:03:42,458 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:03:42,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:03:42,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:03:42,466 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:03:42,467 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:03:42,467 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:03:42,468 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:03:42,470 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:03:42,471 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:03:42,472 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:03:42,473 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:03:42,473 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:03:42,473 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:03:42,474 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:03:42,474 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:03:42,476 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:03:42,477 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:03:42,477 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-14 17:03:42,496 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:03:42,496 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:03:42,498 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:03:42,498 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:03:42,499 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:03:42,499 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:03:42,499 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:03:42,499 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:03:42,500 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:03:42,501 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:03:42,501 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:03:42,501 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:03:42,501 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:03:42,501 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:03:42,502 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:03:42,502 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:03:42,502 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:03:42,502 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:03:42,502 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:03:42,504 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:03:42,504 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:03:42,504 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:03:42,504 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:03:42,505 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:03:42,505 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:03:42,505 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:03:42,505 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:03:42,506 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:03:42,506 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:03:42,506 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:03:42,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:03:42,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:03:42,598 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:03:42,599 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:03:42,600 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:03:42,601 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum_true-unreach-call_true-termination.i [2018-11-14 17:03:42,665 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e639d69ab/6f7c063e28474403b1f40c1ed2905295/FLAG55e625fc0 [2018-11-14 17:03:43,158 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:03:43,159 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum_true-unreach-call_true-termination.i [2018-11-14 17:03:43,166 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e639d69ab/6f7c063e28474403b1f40c1ed2905295/FLAG55e625fc0 [2018-11-14 17:03:43,180 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e639d69ab/6f7c063e28474403b1f40c1ed2905295 [2018-11-14 17:03:43,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:03:43,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:03:43,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:03:43,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:03:43,197 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:03:43,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:03:43" (1/1) ... [2018-11-14 17:03:43,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4111f80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:43, skipping insertion in model container [2018-11-14 17:03:43,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:03:43" (1/1) ... [2018-11-14 17:03:43,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:03:43,235 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:03:43,496 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:03:43,514 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:03:43,544 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:03:43,566 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:03:43,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:43 WrapperNode [2018-11-14 17:03:43,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:03:43,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:03:43,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:03:43,568 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:03:43,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:43" (1/1) ... [2018-11-14 17:03:43,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:43" (1/1) ... [2018-11-14 17:03:43,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:43" (1/1) ... [2018-11-14 17:03:43,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:43" (1/1) ... [2018-11-14 17:03:43,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:43" (1/1) ... [2018-11-14 17:03:43,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:43" (1/1) ... [2018-11-14 17:03:43,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:43" (1/1) ... [2018-11-14 17:03:43,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:03:43,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:03:43,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:03:43,617 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:03:43,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:43" (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-14 17:03:43,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:03:43,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:03:43,753 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-14 17:03:43,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:03:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:03:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:03:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-14 17:03:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:03:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:03:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:03:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:03:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:03:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:03:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:03:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:03:44,440 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:03:44,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:03:44 BoogieIcfgContainer [2018-11-14 17:03:44,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:03:44,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:03:44,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:03:44,446 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:03:44,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:03:43" (1/3) ... [2018-11-14 17:03:44,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c711a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:03:44, skipping insertion in model container [2018-11-14 17:03:44,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:43" (2/3) ... [2018-11-14 17:03:44,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c711a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:03:44, skipping insertion in model container [2018-11-14 17:03:44,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:03:44" (3/3) ... [2018-11-14 17:03:44,450 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_true-unreach-call_true-termination.i [2018-11-14 17:03:44,461 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:03:44,469 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:03:44,487 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:03:44,521 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:03:44,522 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:03:44,522 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:03:44,522 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:03:44,523 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:03:44,523 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:03:44,523 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:03:44,524 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:03:44,524 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:03:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-14 17:03:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:03:44,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:03:44,554 INFO L375 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-14 17:03:44,556 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:03:44,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:03:44,564 INFO L82 PathProgramCache]: Analyzing trace with hash -451853065, now seen corresponding path program 1 times [2018-11-14 17:03:44,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:03:44,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:03:44,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:03:44,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:03:44,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:03:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:03:44,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-14 17:03:44,768 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-14 17:03:44,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 17:03:44,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #62#return; {36#true} is VALID [2018-11-14 17:03:44,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret11 := main(); {36#true} is VALID [2018-11-14 17:03:44,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2018-11-14 17:03:44,771 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~N~0 * 4);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {36#true} is VALID [2018-11-14 17:03:44,771 INFO L256 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-14 17:03:44,771 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-14 17:03:44,785 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-14 17:03:44,785 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-14 17:03:44,786 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 17:03:44,786 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#false} {36#true} #66#return; {37#false} is VALID [2018-11-14 17:03:44,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {37#false} is VALID [2018-11-14 17:03:44,787 INFO L256 TraceCheckUtils]: 14: Hoare triple {37#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-14 17:03:44,787 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-14 17:03:44,787 INFO L273 TraceCheckUtils]: 16: Hoare triple {36#true} assume !true; {36#true} is VALID [2018-11-14 17:03:44,788 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-14 17:03:44,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 17:03:44,788 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {36#true} {37#false} #68#return; {37#false} is VALID [2018-11-14 17:03:44,789 INFO L273 TraceCheckUtils]: 20: Hoare triple {37#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {37#false} is VALID [2018-11-14 17:03:44,789 INFO L273 TraceCheckUtils]: 21: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 17:03:44,789 INFO L273 TraceCheckUtils]: 22: Hoare triple {37#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + (~N~0 - 1) * 4, 4); {37#false} is VALID [2018-11-14 17:03:44,790 INFO L256 TraceCheckUtils]: 23: Hoare triple {37#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-14 17:03:44,790 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-14 17:03:44,790 INFO L273 TraceCheckUtils]: 25: Hoare triple {36#true} assume !true; {36#true} is VALID [2018-11-14 17:03:44,791 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-14 17:03:44,791 INFO L273 TraceCheckUtils]: 27: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 17:03:44,791 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {36#true} {37#false} #70#return; {37#false} is VALID [2018-11-14 17:03:44,792 INFO L273 TraceCheckUtils]: 29: Hoare triple {37#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {37#false} is VALID [2018-11-14 17:03:44,792 INFO L273 TraceCheckUtils]: 30: Hoare triple {37#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {37#false} is VALID [2018-11-14 17:03:44,793 INFO L273 TraceCheckUtils]: 31: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-14 17:03:44,799 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-14 17:03:44,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:03:44,802 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-14 17:03:44,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:03:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:03:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:03:44,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:03:45,190 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-14 17:03:45,191 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-14 17:03:45,191 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 17:03:45,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #62#return; {36#true} is VALID [2018-11-14 17:03:45,192 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret11 := main(); {36#true} is VALID [2018-11-14 17:03:45,192 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2018-11-14 17:03:45,192 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~N~0 * 4);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {36#true} is VALID [2018-11-14 17:03:45,192 INFO L256 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-14 17:03:45,193 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-14 17:03:45,193 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-14 17:03:45,194 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-14 17:03:45,194 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 17:03:45,195 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#false} {36#true} #66#return; {37#false} is VALID [2018-11-14 17:03:45,195 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {37#false} is VALID [2018-11-14 17:03:45,196 INFO L256 TraceCheckUtils]: 14: Hoare triple {37#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {37#false} is VALID [2018-11-14 17:03:45,197 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-14 17:03:45,197 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 17:03:45,198 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-14 17:03:45,198 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 17:03:45,199 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {37#false} {37#false} #68#return; {37#false} is VALID [2018-11-14 17:03:45,199 INFO L273 TraceCheckUtils]: 20: Hoare triple {37#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {37#false} is VALID [2018-11-14 17:03:45,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 17:03:45,199 INFO L273 TraceCheckUtils]: 22: Hoare triple {37#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + (~N~0 - 1) * 4, 4); {37#false} is VALID [2018-11-14 17:03:45,200 INFO L256 TraceCheckUtils]: 23: Hoare triple {37#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {37#false} is VALID [2018-11-14 17:03:45,200 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-14 17:03:45,200 INFO L273 TraceCheckUtils]: 25: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 17:03:45,201 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-14 17:03:45,201 INFO L273 TraceCheckUtils]: 27: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 17:03:45,201 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {37#false} {37#false} #70#return; {37#false} is VALID [2018-11-14 17:03:45,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {37#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {37#false} is VALID [2018-11-14 17:03:45,202 INFO L273 TraceCheckUtils]: 30: Hoare triple {37#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {37#false} is VALID [2018-11-14 17:03:45,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-14 17:03:45,204 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-14 17:03:45,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:03:45,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2018-11-14 17:03:45,239 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:03:45,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:03:45,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:03:45,342 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-14 17:03:45,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:03:45,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:03:45,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:03:45,356 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-14 17:03:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:03:45,508 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-14 17:03:45,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:03:45,509 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:03:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:03:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:03:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 17:03:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:03:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 17:03:45,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 73 transitions. [2018-11-14 17:03:45,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:03:45,695 INFO L225 Difference]: With dead ends: 58 [2018-11-14 17:03:45,696 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 17:03:45,699 INFO L604 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-14 17:03:45,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 17:03:45,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 17:03:45,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:03:45,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 17:03:45,761 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 17:03:45,762 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 17:03:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:03:45,768 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 17:03:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 17:03:45,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:03:45,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:03:45,770 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 17:03:45,770 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 17:03:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:03:45,776 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 17:03:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 17:03:45,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:03:45,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:03:45,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:03:45,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:03:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:03:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-14 17:03:45,783 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 32 [2018-11-14 17:03:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:03:45,783 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-14 17:03:45,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:03:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 17:03:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 17:03:45,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:03:45,786 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-11-14 17:03:45,786 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:03:45,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:03:45,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1864375029, now seen corresponding path program 1 times [2018-11-14 17:03:45,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:03:45,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:03:45,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:03:45,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:03:45,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:03:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:03:46,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-14 17:03:46,098 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-14 17:03:46,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 17:03:46,099 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #62#return; {297#true} is VALID [2018-11-14 17:03:46,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret11 := main(); {297#true} is VALID [2018-11-14 17:03:46,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {297#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {297#true} is VALID [2018-11-14 17:03:46,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {297#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~N~0 * 4);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {299#(<= 2 ~N~0)} is VALID [2018-11-14 17:03:46,110 INFO L256 TraceCheckUtils]: 7: Hoare triple {299#(<= 2 ~N~0)} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {297#true} is VALID [2018-11-14 17:03:46,123 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#(= sum_~i~0 0)} is VALID [2018-11-14 17:03:46,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {300#(= sum_~i~0 0)} assume true; {300#(= sum_~i~0 0)} is VALID [2018-11-14 17:03:46,149 INFO L273 TraceCheckUtils]: 10: Hoare triple {300#(= sum_~i~0 0)} assume !(~i~0 < ~N~0); {301#(<= ~N~0 0)} is VALID [2018-11-14 17:03:46,162 INFO L273 TraceCheckUtils]: 11: 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-14 17:03:46,175 INFO L273 TraceCheckUtils]: 12: Hoare triple {301#(<= ~N~0 0)} assume true; {301#(<= ~N~0 0)} is VALID [2018-11-14 17:03:46,189 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {301#(<= ~N~0 0)} {299#(<= 2 ~N~0)} #66#return; {298#false} is VALID [2018-11-14 17:03:46,189 INFO L273 TraceCheckUtils]: 14: Hoare triple {298#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {298#false} is VALID [2018-11-14 17:03:46,190 INFO L256 TraceCheckUtils]: 15: Hoare triple {298#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {297#true} is VALID [2018-11-14 17:03:46,190 INFO L273 TraceCheckUtils]: 16: 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-14 17:03:46,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 17:03:46,191 INFO L273 TraceCheckUtils]: 18: Hoare triple {297#true} assume !(~i~0 < ~N~0); {297#true} is VALID [2018-11-14 17:03:46,191 INFO L273 TraceCheckUtils]: 19: 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-14 17:03:46,192 INFO L273 TraceCheckUtils]: 20: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 17:03:46,192 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {297#true} {298#false} #68#return; {298#false} is VALID [2018-11-14 17:03:46,192 INFO L273 TraceCheckUtils]: 22: Hoare triple {298#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {298#false} is VALID [2018-11-14 17:03:46,193 INFO L273 TraceCheckUtils]: 23: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 17:03:46,193 INFO L273 TraceCheckUtils]: 24: Hoare triple {298#false} assume !(~i~1 < ~N~0 - 1); {298#false} is VALID [2018-11-14 17:03:46,193 INFO L273 TraceCheckUtils]: 25: Hoare triple {298#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + (~N~0 - 1) * 4, 4); {298#false} is VALID [2018-11-14 17:03:46,194 INFO L256 TraceCheckUtils]: 26: Hoare triple {298#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {297#true} is VALID [2018-11-14 17:03:46,194 INFO L273 TraceCheckUtils]: 27: 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-14 17:03:46,194 INFO L273 TraceCheckUtils]: 28: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 17:03:46,195 INFO L273 TraceCheckUtils]: 29: Hoare triple {297#true} assume !(~i~0 < ~N~0); {297#true} is VALID [2018-11-14 17:03:46,195 INFO L273 TraceCheckUtils]: 30: 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-14 17:03:46,195 INFO L273 TraceCheckUtils]: 31: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 17:03:46,196 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {297#true} {298#false} #70#return; {298#false} is VALID [2018-11-14 17:03:46,196 INFO L273 TraceCheckUtils]: 33: Hoare triple {298#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {298#false} is VALID [2018-11-14 17:03:46,196 INFO L273 TraceCheckUtils]: 34: Hoare triple {298#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {298#false} is VALID [2018-11-14 17:03:46,197 INFO L273 TraceCheckUtils]: 35: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-14 17:03:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 17:03:46,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:03:46,200 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-14 17:03:46,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:03:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:03:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:03:46,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:03:46,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-14 17:03:46,554 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-14 17:03:46,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 17:03:46,555 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #62#return; {297#true} is VALID [2018-11-14 17:03:46,555 INFO L256 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret11 := main(); {297#true} is VALID [2018-11-14 17:03:46,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {297#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {297#true} is VALID [2018-11-14 17:03:46,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {297#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~N~0 * 4);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {299#(<= 2 ~N~0)} is VALID [2018-11-14 17:03:46,587 INFO L256 TraceCheckUtils]: 7: Hoare triple {299#(<= 2 ~N~0)} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {299#(<= 2 ~N~0)} is VALID [2018-11-14 17:03:46,601 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 (<= sum_~i~0 0) (<= 2 ~N~0))} is VALID [2018-11-14 17:03:46,602 INFO L273 TraceCheckUtils]: 9: Hoare triple {329#(and (<= sum_~i~0 0) (<= 2 ~N~0))} assume true; {329#(and (<= sum_~i~0 0) (<= 2 ~N~0))} is VALID [2018-11-14 17:03:46,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {329#(and (<= sum_~i~0 0) (<= 2 ~N~0))} assume !(~i~0 < ~N~0); {298#false} is VALID [2018-11-14 17:03:46,604 INFO L273 TraceCheckUtils]: 11: 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-14 17:03:46,604 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 17:03:46,604 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {298#false} {299#(<= 2 ~N~0)} #66#return; {298#false} is VALID [2018-11-14 17:03:46,604 INFO L273 TraceCheckUtils]: 14: Hoare triple {298#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {298#false} is VALID [2018-11-14 17:03:46,605 INFO L256 TraceCheckUtils]: 15: Hoare triple {298#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {298#false} is VALID [2018-11-14 17:03:46,605 INFO L273 TraceCheckUtils]: 16: 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-14 17:03:46,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 17:03:46,605 INFO L273 TraceCheckUtils]: 18: Hoare triple {298#false} assume !(~i~0 < ~N~0); {298#false} is VALID [2018-11-14 17:03:46,606 INFO L273 TraceCheckUtils]: 19: 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-14 17:03:46,606 INFO L273 TraceCheckUtils]: 20: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 17:03:46,606 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {298#false} {298#false} #68#return; {298#false} is VALID [2018-11-14 17:03:46,606 INFO L273 TraceCheckUtils]: 22: Hoare triple {298#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {298#false} is VALID [2018-11-14 17:03:46,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 17:03:46,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {298#false} assume !(~i~1 < ~N~0 - 1); {298#false} is VALID [2018-11-14 17:03:46,607 INFO L273 TraceCheckUtils]: 25: Hoare triple {298#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + (~N~0 - 1) * 4, 4); {298#false} is VALID [2018-11-14 17:03:46,608 INFO L256 TraceCheckUtils]: 26: Hoare triple {298#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {298#false} is VALID [2018-11-14 17:03:46,608 INFO L273 TraceCheckUtils]: 27: 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-14 17:03:46,608 INFO L273 TraceCheckUtils]: 28: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 17:03:46,609 INFO L273 TraceCheckUtils]: 29: Hoare triple {298#false} assume !(~i~0 < ~N~0); {298#false} is VALID [2018-11-14 17:03:46,609 INFO L273 TraceCheckUtils]: 30: 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-14 17:03:46,609 INFO L273 TraceCheckUtils]: 31: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 17:03:46,609 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {298#false} {298#false} #70#return; {298#false} is VALID [2018-11-14 17:03:46,610 INFO L273 TraceCheckUtils]: 33: Hoare triple {298#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {298#false} is VALID [2018-11-14 17:03:46,610 INFO L273 TraceCheckUtils]: 34: Hoare triple {298#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {298#false} is VALID [2018-11-14 17:03:46,610 INFO L273 TraceCheckUtils]: 35: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-14 17:03:46,613 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 17:03:46,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:03:46,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2018-11-14 17:03:46,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-11-14 17:03:46,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:03:46,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:03:47,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:03:47,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:03:47,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:03:47,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:03:47,069 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2018-11-14 17:03:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:03:47,563 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-14 17:03:47,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:03:47,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-11-14 17:03:47,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:03:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:03:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-14 17:03:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:03:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-14 17:03:47,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-14 17:03:47,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:03:47,686 INFO L225 Difference]: With dead ends: 49 [2018-11-14 17:03:47,686 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 17:03:47,688 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:03:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 17:03:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-14 17:03:47,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:03:47,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-14 17:03:47,709 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-14 17:03:47,709 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-14 17:03:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:03:47,713 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 17:03:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 17:03:47,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:03:47,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:03:47,715 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-14 17:03:47,715 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-14 17:03:47,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:03:47,718 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 17:03:47,719 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 17:03:47,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:03:47,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:03:47,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:03:47,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:03:47,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:03:47,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-14 17:03:47,723 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 36 [2018-11-14 17:03:47,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:03:47,724 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-14 17:03:47,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:03:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 17:03:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 17:03:47,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:03:47,726 INFO L375 BasicCegarLoop]: trace histogram [6, 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, 1] [2018-11-14 17:03:47,726 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:03:47,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:03:47,727 INFO L82 PathProgramCache]: Analyzing trace with hash -23086158, now seen corresponding path program 1 times [2018-11-14 17:03:47,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:03:47,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:03:47,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:03:47,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:03:47,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:03:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:03:47,936 INFO L256 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2018-11-14 17:03:47,937 INFO L273 TraceCheckUtils]: 1: Hoare triple {578#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {578#true} is VALID [2018-11-14 17:03:47,937 INFO L273 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 17:03:47,937 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #62#return; {578#true} is VALID [2018-11-14 17:03:47,938 INFO L256 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret11 := main(); {578#true} is VALID [2018-11-14 17:03:47,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {578#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {578#true} is VALID [2018-11-14 17:03:47,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {578#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~N~0 * 4);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {580#(<= 2 ~N~0)} is VALID [2018-11-14 17:03:47,940 INFO L256 TraceCheckUtils]: 7: Hoare triple {580#(<= 2 ~N~0)} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {578#true} is VALID [2018-11-14 17:03:47,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {578#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {581#(= sum_~i~0 0)} is VALID [2018-11-14 17:03:47,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {581#(= sum_~i~0 0)} assume true; {581#(= sum_~i~0 0)} is VALID [2018-11-14 17:03:47,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {581#(= sum_~i~0 0)} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {581#(= sum_~i~0 0)} is VALID [2018-11-14 17:03:47,946 INFO L273 TraceCheckUtils]: 11: Hoare triple {581#(= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {582#(<= sum_~i~0 1)} is VALID [2018-11-14 17:03:47,946 INFO L273 TraceCheckUtils]: 12: Hoare triple {582#(<= sum_~i~0 1)} assume true; {582#(<= sum_~i~0 1)} is VALID [2018-11-14 17:03:47,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {582#(<= sum_~i~0 1)} assume !(~i~0 < ~N~0); {583#(<= ~N~0 1)} is VALID [2018-11-14 17:03:47,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {583#(<= ~N~0 1)} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {583#(<= ~N~0 1)} is VALID [2018-11-14 17:03:47,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {583#(<= ~N~0 1)} assume true; {583#(<= ~N~0 1)} is VALID [2018-11-14 17:03:47,951 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {583#(<= ~N~0 1)} {580#(<= 2 ~N~0)} #66#return; {579#false} is VALID [2018-11-14 17:03:47,951 INFO L273 TraceCheckUtils]: 17: Hoare triple {579#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {579#false} is VALID [2018-11-14 17:03:47,952 INFO L256 TraceCheckUtils]: 18: Hoare triple {579#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {578#true} is VALID [2018-11-14 17:03:47,952 INFO L273 TraceCheckUtils]: 19: Hoare triple {578#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {578#true} is VALID [2018-11-14 17:03:47,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 17:03:47,952 INFO L273 TraceCheckUtils]: 21: Hoare triple {578#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {578#true} is VALID [2018-11-14 17:03:47,952 INFO L273 TraceCheckUtils]: 22: Hoare triple {578#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {578#true} is VALID [2018-11-14 17:03:47,953 INFO L273 TraceCheckUtils]: 23: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 17:03:47,953 INFO L273 TraceCheckUtils]: 24: Hoare triple {578#true} assume !(~i~0 < ~N~0); {578#true} is VALID [2018-11-14 17:03:47,953 INFO L273 TraceCheckUtils]: 25: Hoare triple {578#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {578#true} is VALID [2018-11-14 17:03:47,954 INFO L273 TraceCheckUtils]: 26: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 17:03:47,954 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {578#true} {579#false} #68#return; {579#false} is VALID [2018-11-14 17:03:47,954 INFO L273 TraceCheckUtils]: 28: Hoare triple {579#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {579#false} is VALID [2018-11-14 17:03:47,955 INFO L273 TraceCheckUtils]: 29: Hoare triple {579#false} assume true; {579#false} is VALID [2018-11-14 17:03:47,955 INFO L273 TraceCheckUtils]: 30: Hoare triple {579#false} assume !(~i~1 < ~N~0 - 1); {579#false} is VALID [2018-11-14 17:03:47,955 INFO L273 TraceCheckUtils]: 31: Hoare triple {579#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + (~N~0 - 1) * 4, 4); {579#false} is VALID [2018-11-14 17:03:47,956 INFO L256 TraceCheckUtils]: 32: Hoare triple {579#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {578#true} is VALID [2018-11-14 17:03:47,956 INFO L273 TraceCheckUtils]: 33: Hoare triple {578#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {578#true} is VALID [2018-11-14 17:03:47,956 INFO L273 TraceCheckUtils]: 34: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 17:03:47,956 INFO L273 TraceCheckUtils]: 35: Hoare triple {578#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {578#true} is VALID [2018-11-14 17:03:47,957 INFO L273 TraceCheckUtils]: 36: Hoare triple {578#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {578#true} is VALID [2018-11-14 17:03:47,957 INFO L273 TraceCheckUtils]: 37: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 17:03:47,957 INFO L273 TraceCheckUtils]: 38: Hoare triple {578#true} assume !(~i~0 < ~N~0); {578#true} is VALID [2018-11-14 17:03:47,958 INFO L273 TraceCheckUtils]: 39: Hoare triple {578#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {578#true} is VALID [2018-11-14 17:03:47,958 INFO L273 TraceCheckUtils]: 40: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 17:03:47,958 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {578#true} {579#false} #70#return; {579#false} is VALID [2018-11-14 17:03:47,959 INFO L273 TraceCheckUtils]: 42: Hoare triple {579#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {579#false} is VALID [2018-11-14 17:03:47,959 INFO L273 TraceCheckUtils]: 43: Hoare triple {579#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {579#false} is VALID [2018-11-14 17:03:47,959 INFO L273 TraceCheckUtils]: 44: Hoare triple {579#false} assume !false; {579#false} is VALID [2018-11-14 17:03:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-14 17:03:47,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:03:47,964 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-14 17:03:47,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:03:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:03:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:03:48,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:03:48,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2018-11-14 17:03:48,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {578#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {578#true} is VALID [2018-11-14 17:03:48,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-14 17:03:48,179 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #62#return; {578#true} is VALID [2018-11-14 17:03:48,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret11 := main(); {578#true} is VALID [2018-11-14 17:03:48,180 INFO L273 TraceCheckUtils]: 5: Hoare triple {578#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {578#true} is VALID [2018-11-14 17:03:48,181 INFO L273 TraceCheckUtils]: 6: Hoare triple {578#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~N~0 * 4);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {580#(<= 2 ~N~0)} is VALID [2018-11-14 17:03:48,182 INFO L256 TraceCheckUtils]: 7: Hoare triple {580#(<= 2 ~N~0)} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {580#(<= 2 ~N~0)} is VALID [2018-11-14 17:03:48,183 INFO L273 TraceCheckUtils]: 8: Hoare triple {580#(<= 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; {611#(and (<= sum_~i~0 0) (<= 2 ~N~0))} is VALID [2018-11-14 17:03:48,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {611#(and (<= sum_~i~0 0) (<= 2 ~N~0))} assume true; {611#(and (<= sum_~i~0 0) (<= 2 ~N~0))} is VALID [2018-11-14 17:03:48,189 INFO L273 TraceCheckUtils]: 10: Hoare triple {611#(and (<= sum_~i~0 0) (<= 2 ~N~0))} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {611#(and (<= sum_~i~0 0) (<= 2 ~N~0))} is VALID [2018-11-14 17:03:48,194 INFO L273 TraceCheckUtils]: 11: Hoare triple {611#(and (<= sum_~i~0 0) (<= 2 ~N~0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {621#(and (<= 2 ~N~0) (<= sum_~i~0 1))} is VALID [2018-11-14 17:03:48,194 INFO L273 TraceCheckUtils]: 12: Hoare triple {621#(and (<= 2 ~N~0) (<= sum_~i~0 1))} assume true; {621#(and (<= 2 ~N~0) (<= sum_~i~0 1))} is VALID [2018-11-14 17:03:48,196 INFO L273 TraceCheckUtils]: 13: Hoare triple {621#(and (<= 2 ~N~0) (<= sum_~i~0 1))} assume !(~i~0 < ~N~0); {579#false} is VALID [2018-11-14 17:03:48,196 INFO L273 TraceCheckUtils]: 14: Hoare triple {579#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {579#false} is VALID [2018-11-14 17:03:48,196 INFO L273 TraceCheckUtils]: 15: Hoare triple {579#false} assume true; {579#false} is VALID [2018-11-14 17:03:48,196 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {579#false} {580#(<= 2 ~N~0)} #66#return; {579#false} is VALID [2018-11-14 17:03:48,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {579#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {579#false} is VALID [2018-11-14 17:03:48,197 INFO L256 TraceCheckUtils]: 18: Hoare triple {579#false} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {579#false} is VALID [2018-11-14 17:03:48,197 INFO L273 TraceCheckUtils]: 19: Hoare triple {579#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {579#false} is VALID [2018-11-14 17:03:48,197 INFO L273 TraceCheckUtils]: 20: Hoare triple {579#false} assume true; {579#false} is VALID [2018-11-14 17:03:48,197 INFO L273 TraceCheckUtils]: 21: Hoare triple {579#false} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {579#false} is VALID [2018-11-14 17:03:48,198 INFO L273 TraceCheckUtils]: 22: Hoare triple {579#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {579#false} is VALID [2018-11-14 17:03:48,198 INFO L273 TraceCheckUtils]: 23: Hoare triple {579#false} assume true; {579#false} is VALID [2018-11-14 17:03:48,198 INFO L273 TraceCheckUtils]: 24: Hoare triple {579#false} assume !(~i~0 < ~N~0); {579#false} is VALID [2018-11-14 17:03:48,199 INFO L273 TraceCheckUtils]: 25: Hoare triple {579#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {579#false} is VALID [2018-11-14 17:03:48,199 INFO L273 TraceCheckUtils]: 26: Hoare triple {579#false} assume true; {579#false} is VALID [2018-11-14 17:03:48,199 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {579#false} {579#false} #68#return; {579#false} is VALID [2018-11-14 17:03:48,200 INFO L273 TraceCheckUtils]: 28: Hoare triple {579#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {579#false} is VALID [2018-11-14 17:03:48,200 INFO L273 TraceCheckUtils]: 29: Hoare triple {579#false} assume true; {579#false} is VALID [2018-11-14 17:03:48,200 INFO L273 TraceCheckUtils]: 30: Hoare triple {579#false} assume !(~i~1 < ~N~0 - 1); {579#false} is VALID [2018-11-14 17:03:48,200 INFO L273 TraceCheckUtils]: 31: Hoare triple {579#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + (~N~0 - 1) * 4, 4); {579#false} is VALID [2018-11-14 17:03:48,201 INFO L256 TraceCheckUtils]: 32: Hoare triple {579#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {579#false} is VALID [2018-11-14 17:03:48,201 INFO L273 TraceCheckUtils]: 33: Hoare triple {579#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {579#false} is VALID [2018-11-14 17:03:48,201 INFO L273 TraceCheckUtils]: 34: Hoare triple {579#false} assume true; {579#false} is VALID [2018-11-14 17:03:48,201 INFO L273 TraceCheckUtils]: 35: Hoare triple {579#false} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {579#false} is VALID [2018-11-14 17:03:48,202 INFO L273 TraceCheckUtils]: 36: Hoare triple {579#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {579#false} is VALID [2018-11-14 17:03:48,202 INFO L273 TraceCheckUtils]: 37: Hoare triple {579#false} assume true; {579#false} is VALID [2018-11-14 17:03:48,202 INFO L273 TraceCheckUtils]: 38: Hoare triple {579#false} assume !(~i~0 < ~N~0); {579#false} is VALID [2018-11-14 17:03:48,202 INFO L273 TraceCheckUtils]: 39: Hoare triple {579#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {579#false} is VALID [2018-11-14 17:03:48,203 INFO L273 TraceCheckUtils]: 40: Hoare triple {579#false} assume true; {579#false} is VALID [2018-11-14 17:03:48,203 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {579#false} {579#false} #70#return; {579#false} is VALID [2018-11-14 17:03:48,203 INFO L273 TraceCheckUtils]: 42: Hoare triple {579#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {579#false} is VALID [2018-11-14 17:03:48,204 INFO L273 TraceCheckUtils]: 43: Hoare triple {579#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {579#false} is VALID [2018-11-14 17:03:48,204 INFO L273 TraceCheckUtils]: 44: Hoare triple {579#false} assume !false; {579#false} is VALID [2018-11-14 17:03:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-14 17:03:48,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:03:48,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-14 17:03:48,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-14 17:03:48,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:03:48,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:03:48,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:03:48,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:03:48,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:03:48,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:03:48,302 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2018-11-14 17:03:48,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:03:48,704 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-14 17:03:48,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:03:48,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-14 17:03:48,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:03:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:03:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-14 17:03:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:03:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-14 17:03:48,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2018-11-14 17:03:48,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:03:48,863 INFO L225 Difference]: With dead ends: 54 [2018-11-14 17:03:48,863 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 17:03:48,864 INFO L604 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-14 17:03:48,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 17:03:48,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-14 17:03:48,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:03:48,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-14 17:03:48,883 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-14 17:03:48,883 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-14 17:03:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:03:48,886 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-14 17:03:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 17:03:48,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:03:48,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:03:48,888 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-14 17:03:48,888 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-14 17:03:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:03:48,891 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-14 17:03:48,891 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 17:03:48,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:03:48,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:03:48,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:03:48,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:03:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:03:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-14 17:03:48,895 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 45 [2018-11-14 17:03:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:03:48,896 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-14 17:03:48,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:03:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 17:03:48,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 17:03:48,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:03:48,898 INFO L375 BasicCegarLoop]: trace histogram [9, 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] [2018-11-14 17:03:48,898 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:03:48,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:03:48,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1557143659, now seen corresponding path program 2 times [2018-11-14 17:03:48,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:03:48,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:03:48,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:03:48,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:03:48,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:03:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:03:49,053 INFO L256 TraceCheckUtils]: 0: Hoare triple {904#true} call ULTIMATE.init(); {904#true} is VALID [2018-11-14 17:03:49,053 INFO L273 TraceCheckUtils]: 1: Hoare triple {904#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {904#true} is VALID [2018-11-14 17:03:49,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {904#true} assume true; {904#true} is VALID [2018-11-14 17:03:49,054 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {904#true} {904#true} #62#return; {904#true} is VALID [2018-11-14 17:03:49,054 INFO L256 TraceCheckUtils]: 4: Hoare triple {904#true} call #t~ret11 := main(); {904#true} is VALID [2018-11-14 17:03:49,054 INFO L273 TraceCheckUtils]: 5: Hoare triple {904#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~N~0 := #t~nondet2;havoc #t~nondet2; {904#true} is VALID [2018-11-14 17:03:49,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {904#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~N~0 * 4);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {906#(<= 2 ~N~0)} is VALID [2018-11-14 17:03:49,057 INFO L256 TraceCheckUtils]: 7: Hoare triple {906#(<= 2 ~N~0)} call #t~ret3 := sum(~#x~0.base, ~#x~0.offset); {904#true} is VALID [2018-11-14 17:03:49,058 INFO L273 TraceCheckUtils]: 8: Hoare triple {904#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {904#true} is VALID [2018-11-14 17:03:49,058 INFO L273 TraceCheckUtils]: 9: Hoare triple {904#true} assume true; {904#true} is VALID [2018-11-14 17:03:49,058 INFO L273 TraceCheckUtils]: 10: Hoare triple {904#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {904#true} is VALID [2018-11-14 17:03:49,058 INFO L273 TraceCheckUtils]: 11: Hoare triple {904#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {904#true} is VALID [2018-11-14 17:03:49,059 INFO L273 TraceCheckUtils]: 12: Hoare triple {904#true} assume true; {904#true} is VALID [2018-11-14 17:03:49,059 INFO L273 TraceCheckUtils]: 13: Hoare triple {904#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {904#true} is VALID [2018-11-14 17:03:49,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {904#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {904#true} is VALID [2018-11-14 17:03:49,059 INFO L273 TraceCheckUtils]: 15: Hoare triple {904#true} assume true; {904#true} is VALID [2018-11-14 17:03:49,060 INFO L273 TraceCheckUtils]: 16: Hoare triple {904#true} assume !(~i~0 < ~N~0); {904#true} is VALID [2018-11-14 17:03:49,060 INFO L273 TraceCheckUtils]: 17: Hoare triple {904#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {904#true} is VALID [2018-11-14 17:03:49,060 INFO L273 TraceCheckUtils]: 18: Hoare triple {904#true} assume true; {904#true} is VALID [2018-11-14 17:03:49,061 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {904#true} {906#(<= 2 ~N~0)} #66#return; {906#(<= 2 ~N~0)} is VALID [2018-11-14 17:03:49,062 INFO L273 TraceCheckUtils]: 20: Hoare triple {906#(<= 2 ~N~0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem5, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem5;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {906#(<= 2 ~N~0)} is VALID [2018-11-14 17:03:49,062 INFO L256 TraceCheckUtils]: 21: Hoare triple {906#(<= 2 ~N~0)} call #t~ret6 := sum(~#x~0.base, ~#x~0.offset); {904#true} is VALID [2018-11-14 17:03:49,062 INFO L273 TraceCheckUtils]: 22: Hoare triple {904#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {904#true} is VALID [2018-11-14 17:03:49,062 INFO L273 TraceCheckUtils]: 23: Hoare triple {904#true} assume true; {904#true} is VALID [2018-11-14 17:03:49,063 INFO L273 TraceCheckUtils]: 24: Hoare triple {904#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {904#true} is VALID [2018-11-14 17:03:49,063 INFO L273 TraceCheckUtils]: 25: Hoare triple {904#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {904#true} is VALID [2018-11-14 17:03:49,063 INFO L273 TraceCheckUtils]: 26: Hoare triple {904#true} assume true; {904#true} is VALID [2018-11-14 17:03:49,063 INFO L273 TraceCheckUtils]: 27: Hoare triple {904#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {904#true} is VALID [2018-11-14 17:03:49,064 INFO L273 TraceCheckUtils]: 28: Hoare triple {904#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {904#true} is VALID [2018-11-14 17:03:49,064 INFO L273 TraceCheckUtils]: 29: Hoare triple {904#true} assume true; {904#true} is VALID [2018-11-14 17:03:49,064 INFO L273 TraceCheckUtils]: 30: Hoare triple {904#true} assume !(~i~0 < ~N~0); {904#true} is VALID [2018-11-14 17:03:49,064 INFO L273 TraceCheckUtils]: 31: Hoare triple {904#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {904#true} is VALID [2018-11-14 17:03:49,065 INFO L273 TraceCheckUtils]: 32: Hoare triple {904#true} assume true; {904#true} is VALID [2018-11-14 17:03:49,067 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {904#true} {906#(<= 2 ~N~0)} #68#return; {906#(<= 2 ~N~0)} is VALID [2018-11-14 17:03:49,068 INFO L273 TraceCheckUtils]: 34: Hoare triple {906#(<= 2 ~N~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0; {907#(and (<= 2 ~N~0) (= main_~i~1 0))} is VALID [2018-11-14 17:03:49,068 INFO L273 TraceCheckUtils]: 35: Hoare triple {907#(and (<= 2 ~N~0) (= main_~i~1 0))} assume true; {907#(and (<= 2 ~N~0) (= main_~i~1 0))} is VALID [2018-11-14 17:03:49,069 INFO L273 TraceCheckUtils]: 36: Hoare triple {907#(and (<= 2 ~N~0) (= main_~i~1 0))} assume !(~i~1 < ~N~0 - 1); {905#false} is VALID [2018-11-14 17:03:49,069 INFO L273 TraceCheckUtils]: 37: Hoare triple {905#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + (~N~0 - 1) * 4, 4); {905#false} is VALID [2018-11-14 17:03:49,069 INFO L256 TraceCheckUtils]: 38: Hoare triple {905#false} call #t~ret10 := sum(~#x~0.base, ~#x~0.offset); {904#true} is VALID [2018-11-14 17:03:49,069 INFO L273 TraceCheckUtils]: 39: Hoare triple {904#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {904#true} is VALID [2018-11-14 17:03:49,070 INFO L273 TraceCheckUtils]: 40: Hoare triple {904#true} assume true; {904#true} is VALID [2018-11-14 17:03:49,070 INFO L273 TraceCheckUtils]: 41: Hoare triple {904#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {904#true} is VALID [2018-11-14 17:03:49,070 INFO L273 TraceCheckUtils]: 42: Hoare triple {904#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {904#true} is VALID [2018-11-14 17:03:49,071 INFO L273 TraceCheckUtils]: 43: Hoare triple {904#true} assume true; {904#true} is VALID [2018-11-14 17:03:49,071 INFO L273 TraceCheckUtils]: 44: Hoare triple {904#true} assume !!(~i~0 < ~N~0);call #t~mem1 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {904#true} is VALID [2018-11-14 17:03:49,071 INFO L273 TraceCheckUtils]: 45: Hoare triple {904#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {904#true} is VALID [2018-11-14 17:03:49,071 INFO L273 TraceCheckUtils]: 46: Hoare triple {904#true} assume true; {904#true} is VALID [2018-11-14 17:03:49,072 INFO L273 TraceCheckUtils]: 47: Hoare triple {904#true} assume !(~i~0 < ~N~0); {904#true} is VALID [2018-11-14 17:03:49,072 INFO L273 TraceCheckUtils]: 48: Hoare triple {904#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {904#true} is VALID [2018-11-14 17:03:49,072 INFO L273 TraceCheckUtils]: 49: Hoare triple {904#true} assume true; {904#true} is VALID [2018-11-14 17:03:49,072 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {904#true} {905#false} #70#return; {905#false} is VALID [2018-11-14 17:03:49,073 INFO L273 TraceCheckUtils]: 51: Hoare triple {905#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~ret5~0 := #t~ret10;havoc #t~ret10; {905#false} is VALID [2018-11-14 17:03:49,073 INFO L273 TraceCheckUtils]: 52: Hoare triple {905#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {905#false} is VALID [2018-11-14 17:03:49,073 INFO L273 TraceCheckUtils]: 53: Hoare triple {905#false} assume !false; {905#false} is VALID [2018-11-14 17:03:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-14 17:03:49,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:03:49,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:03:49,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-14 17:03:49,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:03:49,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:03:49,136 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-14 17:03:49,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:03:49,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:03:49,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:03:49,137 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 4 states. [2018-11-14 17:03:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:03:49,267 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-14 17:03:49,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:03:49,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-14 17:03:49,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:03:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:03:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-14 17:03:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:03:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-14 17:03:49,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2018-11-14 17:03:49,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:03:49,407 INFO L225 Difference]: With dead ends: 53 [2018-11-14 17:03:49,407 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 17:03:49,409 INFO L604 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-14 17:03:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 17:03:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-14 17:03:49,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:03:49,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-14 17:03:49,451 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-14 17:03:49,452 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-14 17:03:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:03:49,454 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 17:03:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 17:03:49,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:03:49,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:03:49,456 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-14 17:03:49,456 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-14 17:03:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:03:49,458 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 17:03:49,458 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 17:03:49,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:03:49,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:03:49,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:03:49,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:03:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:03:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-14 17:03:49,463 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 54 [2018-11-14 17:03:49,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:03:49,463 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-14 17:03:49,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:03:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 17:03:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-14 17:03:49,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:03:49,465 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:03:49,465 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:03:49,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:03:49,466 INFO L82 PathProgramCache]: Analyzing trace with hash -864027724, now seen corresponding path program 1 times [2018-11-14 17:03:49,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:03:49,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:03:49,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:03:49,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:03:49,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:03:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:03:50,781 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-11-14 17:03:51,893 WARN L179 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 17 [2018-11-14 17:03:52,915 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2018-11-14 17:03:52,928 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:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) 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:152) 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:429) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-14 17:03:52,933 INFO L168 Benchmark]: Toolchain (without parser) took 9741.06 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -162.7 MB). Peak memory consumption was 556.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:03:52,934 INFO L168 Benchmark]: CDTParser took 0.20 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-14 17:03:52,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.55 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-14 17:03:52,935 INFO L168 Benchmark]: Boogie Preprocessor took 48.83 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-14 17:03:52,936 INFO L168 Benchmark]: RCFGBuilder took 824.71 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -751.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:03:52,937 INFO L168 Benchmark]: TraceAbstraction took 8489.26 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 578.3 MB). Peak memory consumption was 578.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:03:52,941 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.20 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 373.55 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 Preprocessor took 48.83 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 824.71 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -751.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8489.26 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 578.3 MB). Peak memory consumption was 578.3 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:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...