java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invariants/even_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:17:01,053 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:17:01,055 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:17:01,069 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:17:01,070 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:17:01,071 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:17:01,072 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:17:01,074 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:17:01,075 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:17:01,076 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:17:01,077 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:17:01,077 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:17:01,078 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:17:01,080 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:17:01,081 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:17:01,081 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:17:01,082 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:17:01,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:17:01,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:17:01,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:17:01,089 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:17:01,090 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:17:01,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:17:01,093 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:17:01,093 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:17:01,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:17:01,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:17:01,096 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:17:01,097 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:17:01,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:17:01,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:17:01,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:17:01,099 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:17:01,099 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:17:01,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:17:01,101 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:17:01,101 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:17:01,117 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:17:01,117 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:17:01,118 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:17:01,118 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:17:01,118 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:17:01,119 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:17:01,119 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:17:01,119 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:17:01,119 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:17:01,119 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:17:01,120 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:17:01,120 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:17:01,120 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:17:01,120 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:17:01,121 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:17:01,121 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:17:01,121 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:17:01,121 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:17:01,121 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:17:01,121 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:17:01,122 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:17:01,122 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:17:01,122 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:17:01,122 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:17:01,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:17:01,123 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:17:01,123 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:17:01,123 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:17:01,123 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:17:01,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:17:01,124 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:17:01,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:17:01,201 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:17:01,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:17:01,207 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:17:01,207 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:17:01,208 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/even_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c [2018-11-23 13:17:01,275 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01b9864b/f81a06aee2644ab58fadc4f376b1dce0/FLAGc80458286 [2018-11-23 13:17:01,757 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:17:01,758 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/even_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c [2018-11-23 13:17:01,765 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01b9864b/f81a06aee2644ab58fadc4f376b1dce0/FLAGc80458286 [2018-11-23 13:17:02,111 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01b9864b/f81a06aee2644ab58fadc4f376b1dce0 [2018-11-23 13:17:02,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:17:02,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:17:02,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:17:02,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:17:02,128 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:17:02,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:17:02" (1/1) ... [2018-11-23 13:17:02,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a805ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:02, skipping insertion in model container [2018-11-23 13:17:02,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:17:02" (1/1) ... [2018-11-23 13:17:02,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:17:02,166 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:17:02,373 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:17:02,378 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:17:02,395 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:17:02,413 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:17:02,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:02 WrapperNode [2018-11-23 13:17:02,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:17:02,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:17:02,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:17:02,415 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:17:02,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:02" (1/1) ... [2018-11-23 13:17:02,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:02" (1/1) ... [2018-11-23 13:17:02,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:17:02,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:17:02,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:17:02,439 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:17:02,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:02" (1/1) ... [2018-11-23 13:17:02,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:02" (1/1) ... [2018-11-23 13:17:02,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:02" (1/1) ... [2018-11-23 13:17:02,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:02" (1/1) ... [2018-11-23 13:17:02,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:02" (1/1) ... [2018-11-23 13:17:02,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:02" (1/1) ... [2018-11-23 13:17:02,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:02" (1/1) ... [2018-11-23 13:17:02,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:17:02,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:17:02,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:17:02,463 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:17:02,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:17:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:17:02,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:17:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:17:02,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:17:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:17:02,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:17:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:17:02,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:17:02,969 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:17:02,969 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:17:02,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:17:02 BoogieIcfgContainer [2018-11-23 13:17:02,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:17:02,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:17:02,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:17:02,974 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:17:02,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:17:02" (1/3) ... [2018-11-23 13:17:02,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb298c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:17:02, skipping insertion in model container [2018-11-23 13:17:02,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:02" (2/3) ... [2018-11-23 13:17:02,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb298c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:17:02, skipping insertion in model container [2018-11-23 13:17:02,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:17:02" (3/3) ... [2018-11-23 13:17:02,978 INFO L112 eAbstractionObserver]: Analyzing ICFG even_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c [2018-11-23 13:17:02,987 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:17:02,994 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:17:03,010 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:17:03,043 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:17:03,044 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:17:03,045 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:17:03,045 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:17:03,045 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:17:03,045 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:17:03,045 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:17:03,045 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:17:03,045 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:17:03,065 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:17:03,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:17:03,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:17:03,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:17:03,074 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:17:03,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:17:03,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2018-11-23 13:17:03,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:17:03,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:17:03,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:03,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:17:03,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:03,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 13:17:03,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 13:17:03,197 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #33#return; {22#true} is VALID [2018-11-23 13:17:03,197 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2018-11-23 13:17:03,198 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} ~x~0 := 0; {22#true} is VALID [2018-11-23 13:17:03,209 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 13:17:03,210 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23#false} is VALID [2018-11-23 13:17:03,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 13:17:03,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2018-11-23 13:17:03,211 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 13:17:03,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:17:03,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:17:03,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:17:03,222 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:17:03,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:17:03,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:17:03,291 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-23 13:17:03,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:17:03,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:17:03,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:17:03,303 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 13:17:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:03,382 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 13:17:03,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:17:03,382 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:17:03,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:17:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:17:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 13:17:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:17:03,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 13:17:03,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-23 13:17:03,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:03,700 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:17:03,701 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:17:03,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:17:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:17:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:17:03,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:17:03,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:17:03,838 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:17:03,838 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:17:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:03,841 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:17:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:17:03,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:03,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:03,843 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:17:03,843 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:17:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:03,846 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:17:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:17:03,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:03,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:03,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:17:03,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:17:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:17:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:17:03,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:17:03,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:17:03,851 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:17:03,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:17:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:17:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:17:03,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:17:03,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:17:03,853 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:17:03,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:17:03,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1890620952, now seen corresponding path program 1 times [2018-11-23 13:17:03,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:17:03,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:17:03,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:03,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:17:03,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:04,397 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 15 [2018-11-23 13:17:04,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {109#true} call ULTIMATE.init(); {109#true} is VALID [2018-11-23 13:17:04,465 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#true} assume true; {109#true} is VALID [2018-11-23 13:17:04,465 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {109#true} {109#true} #33#return; {109#true} is VALID [2018-11-23 13:17:04,466 INFO L256 TraceCheckUtils]: 3: Hoare triple {109#true} call #t~ret1 := main(); {109#true} is VALID [2018-11-23 13:17:04,485 INFO L273 TraceCheckUtils]: 4: Hoare triple {109#true} ~x~0 := 0; {111#(and (<= main_~x~0 (+ (* 2 (div main_~x~0 2)) (* 4294967296 (div (+ main_~x~0 (* (- 2) (div main_~x~0 2))) 4294967296)))) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:04,500 INFO L273 TraceCheckUtils]: 5: Hoare triple {111#(and (<= main_~x~0 (+ (* 2 (div main_~x~0 2)) (* 4294967296 (div (+ main_~x~0 (* (- 2) (div main_~x~0 2))) 4294967296)))) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {111#(and (<= main_~x~0 (+ (* 2 (div main_~x~0 2)) (* 4294967296 (div (+ main_~x~0 (* (- 2) (div main_~x~0 2))) 4294967296)))) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:04,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {111#(and (<= main_~x~0 (+ (* 2 (div main_~x~0 2)) (* 4294967296 (div (+ main_~x~0 (* (- 2) (div main_~x~0 2))) 4294967296)))) (<= 0 main_~x~0))} assume !(0 != #t~nondet0);havoc #t~nondet0; {111#(and (<= main_~x~0 (+ (* 2 (div main_~x~0 2)) (* 4294967296 (div (+ main_~x~0 (* (- 2) (div main_~x~0 2))) 4294967296)))) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:04,529 INFO L256 TraceCheckUtils]: 7: Hoare triple {111#(and (<= main_~x~0 (+ (* 2 (div main_~x~0 2)) (* 4294967296 (div (+ main_~x~0 (* (- 2) (div main_~x~0 2))) 4294967296)))) (<= 0 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {112#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:17:04,538 INFO L273 TraceCheckUtils]: 8: Hoare triple {112#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {113#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:17:04,551 INFO L273 TraceCheckUtils]: 9: Hoare triple {113#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {110#false} is VALID [2018-11-23 13:17:04,552 INFO L273 TraceCheckUtils]: 10: Hoare triple {110#false} assume !false; {110#false} is VALID [2018-11-23 13:17:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:17:04,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:17:04,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:17:04,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:17:04,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:17:04,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:17:04,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:04,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:17:04,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:17:04,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:17:04,643 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2018-11-23 13:17:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:04,873 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:17:04,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:17:04,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:17:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:17:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:17:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-23 13:17:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:17:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-23 13:17:04,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 12 transitions. [2018-11-23 13:17:04,918 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-23 13:17:04,918 INFO L225 Difference]: With dead ends: 12 [2018-11-23 13:17:04,918 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:17:04,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:17:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:17:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:17:04,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:17:04,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:17:04,921 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:17:04,921 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:17:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:04,921 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:17:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:17:04,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:04,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:04,922 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:17:04,922 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:17:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:04,923 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:17:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:17:04,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:04,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:04,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:17:04,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:17:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:17:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:17:04,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-11-23 13:17:04,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:17:04,925 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:17:04,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:17:04,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:17:04,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:04,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:17:05,025 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:17:05,026 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:17:05,026 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:17:05,026 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:17:05,026 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:17:05,026 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:17:05,026 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 16) the Hoare annotation is: true [2018-11-23 13:17:05,027 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 16) no Hoare annotation was computed. [2018-11-23 13:17:05,027 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-23 13:17:05,027 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 16) no Hoare annotation was computed. [2018-11-23 13:17:05,027 INFO L448 ceAbstractionStarter]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2018-11-23 13:17:05,027 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 11 13) the Hoare annotation is: (and (<= main_~x~0 (let ((.cse0 (div main_~x~0 2))) (+ (* 2 .cse0) (* 4294967296 (div (+ main_~x~0 (* (- 2) .cse0)) 4294967296))))) (<= 0 main_~x~0)) [2018-11-23 13:17:05,028 INFO L444 ceAbstractionStarter]: At program point L11-4(lines 11 13) the Hoare annotation is: (and (<= main_~x~0 (let ((.cse0 (div main_~x~0 2))) (+ (* 2 .cse0) (* 4294967296 (div (+ main_~x~0 (* (- 2) .cse0)) 4294967296))))) (<= 0 main_~x~0)) [2018-11-23 13:17:05,028 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:17:05,028 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:17:05,028 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:17:05,028 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:17:05,028 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:17:05,029 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:17:05,030 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:17:05,033 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:17:05,033 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:17:05,033 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:17:05,034 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-23 13:17:05,034 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:17:05,034 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:17:05,034 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:17:05,034 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:17:05,034 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-23 13:17:05,035 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-23 13:17:05,035 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:17:05,035 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:17:05,035 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:17:05,035 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:17:05,035 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:17:05,036 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:17:05,036 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:17:05,036 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-23 13:17:05,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:17:05 BoogieIcfgContainer [2018-11-23 13:17:05,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:17:05,047 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:17:05,047 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:17:05,047 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:17:05,048 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:17:02" (3/4) ... [2018-11-23 13:17:05,052 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:17:05,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:17:05,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:17:05,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:17:05,071 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 13:17:05,072 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 13:17:05,072 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:17:05,116 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invariants/even_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c-witness.graphml [2018-11-23 13:17:05,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:17:05,117 INFO L168 Benchmark]: Toolchain (without parser) took 2995.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -692.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:17:05,119 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:17:05,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:17:05,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:17:05,121 INFO L168 Benchmark]: Boogie Preprocessor took 23.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:17:05,121 INFO L168 Benchmark]: RCFGBuilder took 507.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:17:05,122 INFO L168 Benchmark]: TraceAbstraction took 2075.77 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: 81.9 MB). Peak memory consumption was 81.9 MB. Max. memory is 7.1 GB. [2018-11-23 13:17:05,123 INFO L168 Benchmark]: Witness Printer took 69.14 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:17:05,127 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 290.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 23.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.67 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 507.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2075.77 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: 81.9 MB). Peak memory consumption was 81.9 MB. Max. memory is 7.1 GB. * Witness Printer took 69.14 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. 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) && 0 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 1.9s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27 SDtfs, 1 SDslu, 20 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, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 8 PreInvPairs, 9 NumberOfFragments, 51 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 881 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...