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/loop-invariants/odd_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:38:48,514 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:38:48,517 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:38:48,532 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:38:48,532 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:38:48,533 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:38:48,534 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:38:48,536 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:38:48,538 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:38:48,539 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:38:48,540 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:38:48,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:38:48,541 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:38:48,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:38:48,543 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:38:48,544 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:38:48,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:38:48,547 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:38:48,556 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:38:48,558 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:38:48,559 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:38:48,560 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:38:48,563 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:38:48,563 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:38:48,563 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:38:48,564 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:38:48,565 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:38:48,566 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:38:48,566 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:38:48,567 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:38:48,568 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:38:48,568 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:38:48,568 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:38:48,569 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:38:48,570 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:38:48,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:38:48,571 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:38:48,585 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:38:48,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:38:48,586 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:38:48,587 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:38:48,587 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:38:48,588 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:38:48,588 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:38:48,588 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:38:48,588 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:38:48,588 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:38:48,589 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:38:48,589 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:38:48,589 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:38:48,589 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:38:48,589 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:38:48,589 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:38:48,590 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:38:48,590 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:38:48,590 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:38:48,590 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:38:48,590 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:38:48,591 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:38:48,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:38:48,591 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:38:48,591 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:38:48,591 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:38:48,592 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:38:48,592 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:38:48,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:38:48,592 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:38:48,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:38:48,649 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:38:48,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:38:48,653 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:38:48,654 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:38:48,654 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/odd_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c [2018-11-14 17:38:48,716 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8aa67b7d/6398230a722940edb9d9cb579a1084da/FLAGcf714bb09 [2018-11-14 17:38:49,115 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:38:49,116 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/odd_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c [2018-11-14 17:38:49,122 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8aa67b7d/6398230a722940edb9d9cb579a1084da/FLAGcf714bb09 [2018-11-14 17:38:49,137 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8aa67b7d/6398230a722940edb9d9cb579a1084da [2018-11-14 17:38:49,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:38:49,148 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:38:49,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:38:49,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:38:49,153 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:38:49,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:38:49" (1/1) ... [2018-11-14 17:38:49,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67112aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:49, skipping insertion in model container [2018-11-14 17:38:49,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:38:49" (1/1) ... [2018-11-14 17:38:49,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:38:49,187 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:38:49,424 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:38:49,430 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:38:49,450 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:38:49,467 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:38:49,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:49 WrapperNode [2018-11-14 17:38:49,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:38:49,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:38:49,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:38:49,469 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:38:49,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:49" (1/1) ... [2018-11-14 17:38:49,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:49" (1/1) ... [2018-11-14 17:38:49,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:49" (1/1) ... [2018-11-14 17:38:49,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:49" (1/1) ... [2018-11-14 17:38:49,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:49" (1/1) ... [2018-11-14 17:38:49,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:49" (1/1) ... [2018-11-14 17:38:49,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:49" (1/1) ... [2018-11-14 17:38:49,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:38:49,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:38:49,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:38:49,508 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:38:49,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:49" (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:38:49,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:38:49,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:38:49,685 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:38:49,685 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:38:49,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:38:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:38:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:38:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:38:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:38:49,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:38:50,109 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:38:50,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:38:50 BoogieIcfgContainer [2018-11-14 17:38:50,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:38:50,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:38:50,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:38:50,114 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:38:50,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:38:49" (1/3) ... [2018-11-14 17:38:50,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f94a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:38:50, skipping insertion in model container [2018-11-14 17:38:50,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:38:49" (2/3) ... [2018-11-14 17:38:50,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f94a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:38:50, skipping insertion in model container [2018-11-14 17:38:50,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:38:50" (3/3) ... [2018-11-14 17:38:50,117 INFO L112 eAbstractionObserver]: Analyzing ICFG odd_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c [2018-11-14 17:38:50,127 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:38:50,135 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:38:50,151 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:38:50,181 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:38:50,182 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:38:50,182 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:38:50,182 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:38:50,183 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:38:50,183 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:38:50,183 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:38:50,183 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:38:50,183 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:38:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-14 17:38:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 17:38:50,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:38:50,209 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:38:50,211 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:38:50,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:38:50,217 INFO L82 PathProgramCache]: Analyzing trace with hash 563245249, now seen corresponding path program 1 times [2018-11-14 17:38:50,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:38:50,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:38:50,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:38:50,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:38:50,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:38:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:38:50,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-14 17:38:50,331 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-14 17:38:50,332 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #34#return; {23#true} is VALID [2018-11-14 17:38:50,332 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret1 := main(); {23#true} is VALID [2018-11-14 17:38:50,332 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} ~x~0 := 1; {23#true} is VALID [2018-11-14 17:38:50,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-14 17:38:50,334 INFO L256 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {24#false} is VALID [2018-11-14 17:38:50,334 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-14 17:38:50,334 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} assume ~cond == 0; {24#false} is VALID [2018-11-14 17:38:50,335 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-14 17:38:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:38:50,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:38:50,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:38:50,346 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:38:50,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:38:50,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:38:50,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:38:50,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:38:50,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:38:50,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:38:50,419 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-14 17:38:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:50,499 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 17:38:50,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:38:50,499 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:38:50,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:38:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:38:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-14 17:38:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:38:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-14 17:38:50,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2018-11-14 17:38:50,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:38:50,787 INFO L225 Difference]: With dead ends: 32 [2018-11-14 17:38:50,787 INFO L226 Difference]: Without dead ends: 13 [2018-11-14 17:38:50,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:38:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-14 17:38:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-14 17:38:50,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:38:50,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-14 17:38:50,863 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 17:38:50,863 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 17:38:50,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:50,866 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-14 17:38:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 17:38:50,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:38:50,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:38:50,868 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 17:38:50,868 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 17:38:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:50,871 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-14 17:38:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 17:38:50,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:38:50,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:38:50,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:38:50,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:38:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:38:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-14 17:38:50,876 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-11-14 17:38:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:38:50,877 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-14 17:38:50,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:38:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 17:38:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 17:38:50,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:38:50,878 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:38:50,878 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:38:50,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:38:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash -65738821, now seen corresponding path program 1 times [2018-11-14 17:38:50,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:38:50,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:38:50,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:38:50,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:38:50,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:38:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:38:57,521 WARN L179 SmtUtils]: Spent 6.27 s on a formula simplification. DAG size of input: 63 DAG size of output: 13 [2018-11-14 17:38:57,593 INFO L256 TraceCheckUtils]: 0: Hoare triple {114#true} call ULTIMATE.init(); {114#true} is VALID [2018-11-14 17:38:57,593 INFO L273 TraceCheckUtils]: 1: Hoare triple {114#true} assume true; {114#true} is VALID [2018-11-14 17:38:57,593 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {114#true} {114#true} #34#return; {114#true} is VALID [2018-11-14 17:38:57,594 INFO L256 TraceCheckUtils]: 3: Hoare triple {114#true} call #t~ret1 := main(); {114#true} is VALID [2018-11-14 17:38:57,594 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#true} ~x~0 := 1; {116#(not (= main_~x~0 (+ (* 2 (div main_~x~0 2)) (* 4294967296 (div (+ main_~x~0 (* (- 2) (div main_~x~0 2))) 4294967296)))))} is VALID [2018-11-14 17:38:57,595 INFO L273 TraceCheckUtils]: 5: Hoare triple {116#(not (= main_~x~0 (+ (* 2 (div main_~x~0 2)) (* 4294967296 (div (+ main_~x~0 (* (- 2) (div main_~x~0 2))) 4294967296)))))} assume true; {116#(not (= main_~x~0 (+ (* 2 (div main_~x~0 2)) (* 4294967296 (div (+ main_~x~0 (* (- 2) (div main_~x~0 2))) 4294967296)))))} is VALID [2018-11-14 17:38:57,598 INFO L273 TraceCheckUtils]: 6: Hoare triple {116#(not (= main_~x~0 (+ (* 2 (div main_~x~0 2)) (* 4294967296 (div (+ main_~x~0 (* (- 2) (div main_~x~0 2))) 4294967296)))))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {116#(not (= main_~x~0 (+ (* 2 (div main_~x~0 2)) (* 4294967296 (div (+ main_~x~0 (* (- 2) (div main_~x~0 2))) 4294967296)))))} is VALID [2018-11-14 17:38:57,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {116#(not (= main_~x~0 (+ (* 2 (div main_~x~0 2)) (* 4294967296 (div (+ main_~x~0 (* (- 2) (div main_~x~0 2))) 4294967296)))))} assume !(#t~nondet0 != 0);havoc #t~nondet0; {116#(not (= main_~x~0 (+ (* 2 (div main_~x~0 2)) (* 4294967296 (div (+ main_~x~0 (* (- 2) (div main_~x~0 2))) 4294967296)))))} is VALID [2018-11-14 17:38:57,603 INFO L256 TraceCheckUtils]: 8: Hoare triple {116#(not (= main_~x~0 (+ (* 2 (div main_~x~0 2)) (* 4294967296 (div (+ main_~x~0 (* (- 2) (div main_~x~0 2))) 4294967296)))))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {117#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:38:57,604 INFO L273 TraceCheckUtils]: 9: Hoare triple {117#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {118#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:38:57,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {118#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {115#false} is VALID [2018-11-14 17:38:57,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {115#false} assume !false; {115#false} is VALID [2018-11-14 17:38:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:38:57,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:38:57,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:38:57,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 17:38:57,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:38:57,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:38:57,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:38:57,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:38:57,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:38:57,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:38:57,734 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 5 states. [2018-11-14 17:38:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:57,834 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-14 17:38:57,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:38:57,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 17:38:57,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:38:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:38:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-14 17:38:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:38:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-14 17:38:57,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 13 transitions. [2018-11-14 17:38:57,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:38:57,867 INFO L225 Difference]: With dead ends: 13 [2018-11-14 17:38:57,867 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 17:38:57,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:38:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 17:38:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 17:38:57,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:38:57,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 17:38:57,869 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:38:57,869 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:38:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:57,869 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:38:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:38:57,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:38:57,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:38:57,871 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:38:57,871 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:38:57,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:57,872 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:38:57,872 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:38:57,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:38:57,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:38:57,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:38:57,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:38:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 17:38:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 17:38:57,873 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-11-14 17:38:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:38:57,873 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 17:38:57,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:38:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:38:57,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:38:57,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 17:38:57,925 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 17:38:57,926 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:38:57,926 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:38:57,926 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 17:38:57,926 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:38:57,926 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:38:57,926 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 16) the Hoare annotation is: true [2018-11-14 17:38:57,926 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 16) no Hoare annotation was computed. [2018-11-14 17:38:57,926 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-14 17:38:57,926 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 16) no Hoare annotation was computed. [2018-11-14 17:38:57,927 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2018-11-14 17:38:57,927 INFO L425 ceAbstractionStarter]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2018-11-14 17:38:57,927 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 13) the Hoare annotation is: (not (= main_~x~0 (let ((.cse0 (div main_~x~0 2))) (+ (* 2 .cse0) (* 4294967296 (div (+ main_~x~0 (* (- 2) .cse0)) 4294967296)))))) [2018-11-14 17:38:57,927 INFO L421 ceAbstractionStarter]: At program point L11-5(lines 11 13) the Hoare annotation is: (not (= main_~x~0 (let ((.cse0 (div main_~x~0 2))) (+ (* 2 .cse0) (* 4294967296 (div (+ main_~x~0 (* (- 2) .cse0)) 4294967296)))))) [2018-11-14 17:38:57,927 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-14 17:38:57,928 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-14 17:38:57,928 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-14 17:38:57,928 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-14 17:38:57,928 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-14 17:38:57,928 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-14 17:38:57,930 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:38:57,935 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:38:57,935 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:38:57,935 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:38:57,935 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 17:38:57,938 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:38:57,938 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:38:57,938 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:38:57,938 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 17:38:57,938 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 17:38:57,939 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:38:57,939 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:38:57,939 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 17:38:57,939 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-14 17:38:57,939 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-14 17:38:57,939 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 17:38:57,939 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:38:57,939 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:38:57,939 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:38:57,940 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:38:57,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:38:57 BoogieIcfgContainer [2018-11-14 17:38:57,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:38:57,950 INFO L168 Benchmark]: Toolchain (without parser) took 8802.65 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -717.1 MB). Peak memory consumption was 60.4 MB. Max. memory is 7.1 GB. [2018-11-14 17:38:57,952 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:38:57,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.63 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:38:57,954 INFO L168 Benchmark]: Boogie Preprocessor took 36.63 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:38:57,955 INFO L168 Benchmark]: RCFGBuilder took 601.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:38:57,956 INFO L168 Benchmark]: TraceAbstraction took 7838.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 85.5 MB). Peak memory consumption was 85.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:38:57,961 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 318.63 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 36.63 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 601.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7838.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 85.5 MB). Peak memory consumption was 85.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: !(x == 2 * (x / 2) + 4294967296 * ((x + -2 * (x / 2)) / 4294967296)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 7.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 29 SDtfs, 1 SDslu, 22 SDs, 0 SdLazy, 5 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 8 PreInvPairs, 9 NumberOfFragments, 45 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 1104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...