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_Bitvector.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-18e5b2d-m [2018-11-18 22:40:22,967 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:40:22,969 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:40:22,980 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:40:22,981 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:40:22,982 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:40:22,983 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:40:22,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:40:22,986 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:40:22,987 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:40:22,988 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:40:22,988 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:40:22,989 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:40:22,990 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:40:22,991 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:40:22,992 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:40:22,993 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:40:23,001 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:40:23,003 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:40:23,005 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:40:23,009 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:40:23,010 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:40:23,017 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:40:23,017 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:40:23,017 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:40:23,018 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:40:23,021 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:40:23,022 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:40:23,024 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:40:23,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:40:23,025 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:40:23,027 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:40:23,027 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:40:23,027 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:40:23,028 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:40:23,029 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:40:23,030 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 22:40:23,058 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:40:23,058 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:40:23,059 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:40:23,059 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:40:23,060 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:40:23,060 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:40:23,060 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:40:23,061 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:40:23,061 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:40:23,061 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:40:23,061 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:40:23,061 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:40:23,062 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:40:23,062 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:40:23,062 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:40:23,062 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:40:23,062 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:40:23,062 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:40:23,063 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:40:23,063 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:40:23,063 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:40:23,063 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:40:23,063 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:40:23,064 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:40:23,064 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:40:23,064 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:40:23,064 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:40:23,064 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:40:23,065 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:40:23,065 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:40:23,065 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:40:23,065 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:40:23,065 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:40:23,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:40:23,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:40:23,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:40:23,139 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:40:23,140 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:40:23,140 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-18 22:40:23,197 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ebdeea9/6107b9e711fb4df6973895c428cd682c/FLAG0fe86177e [2018-11-18 22:40:23,641 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:40:23,642 INFO L161 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-18 22:40:23,647 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ebdeea9/6107b9e711fb4df6973895c428cd682c/FLAG0fe86177e [2018-11-18 22:40:24,026 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ebdeea9/6107b9e711fb4df6973895c428cd682c [2018-11-18 22:40:24,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:40:24,041 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:40:24,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:40:24,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:40:24,048 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:40:24,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:40:24" (1/1) ... [2018-11-18 22:40:24,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@787ad231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:40:24, skipping insertion in model container [2018-11-18 22:40:24,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:40:24" (1/1) ... [2018-11-18 22:40:24,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:40:24,091 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:40:24,297 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:40:24,302 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:40:24,320 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:40:24,336 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:40:24,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:40:24 WrapperNode [2018-11-18 22:40:24,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:40:24,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:40:24,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:40:24,338 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:40:24,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:40:24" (1/1) ... [2018-11-18 22:40:24,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:40:24" (1/1) ... [2018-11-18 22:40:24,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:40:24" (1/1) ... [2018-11-18 22:40:24,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:40:24" (1/1) ... [2018-11-18 22:40:24,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:40:24" (1/1) ... [2018-11-18 22:40:24,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:40:24" (1/1) ... [2018-11-18 22:40:24,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:40:24" (1/1) ... [2018-11-18 22:40:24,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:40:24,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:40:24,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:40:24,376 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:40:24,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:40:24" (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-18 22:40:24,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:40:24,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:40:24,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:40:24,529 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:40:24,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:40:24,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 22:40:24,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:40:24,530 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:40:24,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:40:24,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:40:24,946 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:40:24,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:40:24 BoogieIcfgContainer [2018-11-18 22:40:24,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:40:24,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:40:24,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:40:24,951 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:40:24,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:40:24" (1/3) ... [2018-11-18 22:40:24,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536faa7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:40:24, skipping insertion in model container [2018-11-18 22:40:24,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:40:24" (2/3) ... [2018-11-18 22:40:24,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536faa7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:40:24, skipping insertion in model container [2018-11-18 22:40:24,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:40:24" (3/3) ... [2018-11-18 22:40:24,955 INFO L112 eAbstractionObserver]: Analyzing ICFG odd_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c [2018-11-18 22:40:24,965 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:40:24,974 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:40:24,991 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:40:25,024 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:40:25,025 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:40:25,025 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:40:25,025 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:40:25,025 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:40:25,025 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:40:25,026 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:40:25,026 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:40:25,026 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:40:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-18 22:40:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 22:40:25,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:40:25,052 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:40:25,054 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:40:25,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:40:25,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2018-11-18 22:40:25,065 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:40:25,065 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:40:25,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:40:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:40:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:40:25,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:40:25,186 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-18 22:40:25,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-18 22:40:25,190 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #33#return; {22#true} is VALID [2018-11-18 22:40:25,190 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2018-11-18 22:40:25,191 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} ~x~0 := 1bv32; {22#true} is VALID [2018-11-18 22:40:25,203 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-18 22:40:25,203 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {23#false} is VALID [2018-11-18 22:40:25,204 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-18 22:40:25,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0bv32 == ~cond; {23#false} is VALID [2018-11-18 22:40:25,205 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-18 22:40:25,209 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-18 22:40:25,209 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:40:25,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:40:25,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:40:25,226 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 22:40:25,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:40:25,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:40:25,276 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-18 22:40:25,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:40:25,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:40:25,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:40:25,288 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 22:40:25,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:40:25,367 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-18 22:40:25,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:40:25,368 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 22:40:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:40:25,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:40:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-18 22:40:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:40:25,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-18 22:40:25,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-18 22:40:25,644 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-18 22:40:25,655 INFO L225 Difference]: With dead ends: 31 [2018-11-18 22:40:25,655 INFO L226 Difference]: Without dead ends: 12 [2018-11-18 22:40:25,659 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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-18 22:40:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-18 22:40:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 22:40:25,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:40:25,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-18 22:40:25,784 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-18 22:40:25,784 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-18 22:40:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:40:25,788 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-18 22:40:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-18 22:40:25,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:40:25,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:40:25,789 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-18 22:40:25,789 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-18 22:40:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:40:25,792 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-18 22:40:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-18 22:40:25,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:40:25,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:40:25,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:40:25,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:40:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:40:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-18 22:40:25,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-18 22:40:25,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:40:25,797 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-18 22:40:25,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:40:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-18 22:40:25,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 22:40:25,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:40:25,799 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:40:25,799 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:40:25,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:40:25,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1861991801, now seen corresponding path program 1 times [2018-11-18 22:40:25,800 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:40:25,800 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:40:25,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:40:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:40:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:40:25,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:40:26,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2018-11-18 22:40:26,018 INFO L273 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2018-11-18 22:40:26,018 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #33#return; {136#true} is VALID [2018-11-18 22:40:26,019 INFO L256 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret1 := main(); {136#true} is VALID [2018-11-18 22:40:26,023 INFO L273 TraceCheckUtils]: 4: Hoare triple {136#true} ~x~0 := 1bv32; {153#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:40:26,036 INFO L273 TraceCheckUtils]: 5: Hoare triple {153#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {153#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:40:26,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {153#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet0);havoc #t~nondet0; {153#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:40:26,038 INFO L256 TraceCheckUtils]: 7: Hoare triple {153#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {163#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:40:26,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {163#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {167#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:40:26,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {167#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {137#false} is VALID [2018-11-18 22:40:26,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {137#false} assume !false; {137#false} is VALID [2018-11-18 22:40:26,065 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-18 22:40:26,065 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:40:26,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:40:26,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:40:26,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-18 22:40:26,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:40:26,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:40:26,126 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-18 22:40:26,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:40:26,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:40:26,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:40:26,127 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2018-11-18 22:40:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:40:26,360 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-18 22:40:26,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:40:26,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-18 22:40:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:40:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:40:26,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 22:40:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:40:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 22:40:26,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2018-11-18 22:40:26,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:40:26,417 INFO L225 Difference]: With dead ends: 19 [2018-11-18 22:40:26,417 INFO L226 Difference]: Without dead ends: 14 [2018-11-18 22:40:26,418 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:40:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-18 22:40:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 22:40:26,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:40:26,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-18 22:40:26,432 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-18 22:40:26,432 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-18 22:40:26,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:40:26,434 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-18 22:40:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 22:40:26,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:40:26,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:40:26,435 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-18 22:40:26,435 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-18 22:40:26,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:40:26,437 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-18 22:40:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 22:40:26,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:40:26,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:40:26,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:40:26,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:40:26,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:40:26,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-18 22:40:26,440 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-18 22:40:26,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:40:26,440 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-18 22:40:26,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:40:26,440 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 22:40:26,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 22:40:26,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:40:26,441 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:40:26,441 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:40:26,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:40:26,442 INFO L82 PathProgramCache]: Analyzing trace with hash -661808769, now seen corresponding path program 1 times [2018-11-18 22:40:26,442 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:40:26,442 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:40:26,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:40:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:40:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:40:26,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:40:26,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {254#true} is VALID [2018-11-18 22:40:26,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {254#true} assume true; {254#true} is VALID [2018-11-18 22:40:26,909 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {254#true} {254#true} #33#return; {254#true} is VALID [2018-11-18 22:40:26,909 INFO L256 TraceCheckUtils]: 3: Hoare triple {254#true} call #t~ret1 := main(); {254#true} is VALID [2018-11-18 22:40:26,918 INFO L273 TraceCheckUtils]: 4: Hoare triple {254#true} ~x~0 := 1bv32; {271#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:40:26,931 INFO L273 TraceCheckUtils]: 5: Hoare triple {271#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {271#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:40:26,945 INFO L273 TraceCheckUtils]: 6: Hoare triple {271#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;~x~0 := ~bvadd32(2bv32, ~x~0); {278#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 22:40:26,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {278#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {278#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 22:40:26,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {278#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet0);havoc #t~nondet0; {278#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 22:40:26,973 INFO L256 TraceCheckUtils]: 9: Hoare triple {278#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {288#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:40:26,973 INFO L273 TraceCheckUtils]: 10: Hoare triple {288#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {292#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:40:26,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {292#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {255#false} is VALID [2018-11-18 22:40:26,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {255#false} assume !false; {255#false} is VALID [2018-11-18 22:40:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:40:26,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:40:27,353 INFO L273 TraceCheckUtils]: 12: Hoare triple {255#false} assume !false; {255#false} is VALID [2018-11-18 22:40:27,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {302#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {255#false} is VALID [2018-11-18 22:40:27,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {306#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {302#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-18 22:40:27,356 INFO L256 TraceCheckUtils]: 9: Hoare triple {310#(not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))))} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {306#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 22:40:27,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {310#(not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))))} assume !(0bv32 != #t~nondet0);havoc #t~nondet0; {310#(not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))))} is VALID [2018-11-18 22:40:27,366 INFO L273 TraceCheckUtils]: 7: Hoare triple {310#(not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))))} assume true; {310#(not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))))} is VALID [2018-11-18 22:40:27,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {310#(not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;~x~0 := ~bvadd32(2bv32, ~x~0); {310#(not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))))} is VALID [2018-11-18 22:40:27,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {310#(not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))))} assume true; {310#(not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))))} is VALID [2018-11-18 22:40:27,370 INFO L273 TraceCheckUtils]: 4: Hoare triple {254#true} ~x~0 := 1bv32; {310#(not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))))} is VALID [2018-11-18 22:40:27,370 INFO L256 TraceCheckUtils]: 3: Hoare triple {254#true} call #t~ret1 := main(); {254#true} is VALID [2018-11-18 22:40:27,370 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {254#true} {254#true} #33#return; {254#true} is VALID [2018-11-18 22:40:27,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {254#true} assume true; {254#true} is VALID [2018-11-18 22:40:27,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {254#true} is VALID [2018-11-18 22:40:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:40:27,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 22:40:27,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-11-18 22:40:27,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-11-18 22:40:27,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:40:27,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:40:27,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:40:27,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:40:27,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:40:27,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:40:27,413 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 9 states. [2018-11-18 22:40:27,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:40:27,609 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-18 22:40:27,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:40:27,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-11-18 22:40:27,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:40:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:40:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2018-11-18 22:40:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:40:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2018-11-18 22:40:27,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 18 transitions. [2018-11-18 22:40:27,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:40:27,647 INFO L225 Difference]: With dead ends: 17 [2018-11-18 22:40:27,647 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 22:40:27,648 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:40:27,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 22:40:27,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 22:40:27,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:40:27,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 22:40:27,649 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 22:40:27,650 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 22:40:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:40:27,650 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 22:40:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 22:40:27,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:40:27,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:40:27,651 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 22:40:27,651 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 22:40:27,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:40:27,651 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 22:40:27,652 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 22:40:27,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:40:27,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:40:27,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:40:27,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:40:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 22:40:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 22:40:27,653 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-11-18 22:40:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:40:27,653 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 22:40:27,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:40:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 22:40:27,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:40:27,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 22:40:27,922 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 22:40:27,923 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 22:40:27,923 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 22:40:27,923 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 22:40:27,923 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 22:40:27,923 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 22:40:27,923 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 16) the Hoare annotation is: true [2018-11-18 22:40:27,923 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 16) no Hoare annotation was computed. [2018-11-18 22:40:27,923 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-18 22:40:27,924 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 16) no Hoare annotation was computed. [2018-11-18 22:40:27,924 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2018-11-18 22:40:27,924 INFO L421 ceAbstractionStarter]: At program point L11-3(lines 11 13) the Hoare annotation is: (not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))) [2018-11-18 22:40:27,924 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 13) the Hoare annotation is: (not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))) [2018-11-18 22:40:27,924 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-18 22:40:27,924 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-18 22:40:27,924 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-18 22:40:27,925 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-18 22:40:27,925 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-18 22:40:27,925 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-18 22:40:27,926 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 22:40:27,928 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:40:27,928 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 22:40:27,928 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 22:40:27,928 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-18 22:40:27,928 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:40:27,928 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:40:27,929 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 22:40:27,929 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-18 22:40:27,929 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-18 22:40:27,929 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-18 22:40:27,929 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 22:40:27,929 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 22:40:27,929 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-18 22:40:27,929 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-18 22:40:27,929 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 22:40:27,930 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 22:40:27,930 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 22:40:27,930 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-18 22:40:27,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:40:27 BoogieIcfgContainer [2018-11-18 22:40:27,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 22:40:27,940 INFO L168 Benchmark]: Toolchain (without parser) took 3900.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -619.3 MB). Peak memory consumption was 118.9 MB. Max. memory is 7.1 GB. [2018-11-18 22:40:27,941 INFO L168 Benchmark]: CDTParser took 0.21 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-18 22:40:27,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.18 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-18 22:40:27,943 INFO L168 Benchmark]: Boogie Preprocessor took 37.66 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-18 22:40:27,943 INFO L168 Benchmark]: RCFGBuilder took 571.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-18 22:40:27,944 INFO L168 Benchmark]: TraceAbstraction took 2990.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 158.2 MB). Peak memory consumption was 158.2 MB. Max. memory is 7.1 GB. [2018-11-18 22:40:27,949 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.21 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 294.18 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 37.66 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 571.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2990.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 158.2 MB). Peak memory consumption was 158.2 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: !(0bv32 == ~bvurem32(x, 2bv32)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 2 SDslu, 70 SDs, 0 SdLazy, 26 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 15 NumberOfFragments, 17 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 22 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 1377 SizeOfPredicates, 4 NumberOfNonLiveVariables, 59 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...