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_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_vardep_true-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:31:59,074 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:31:59,076 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:31:59,088 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:31:59,089 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:31:59,090 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:31:59,091 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:31:59,093 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:31:59,095 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:31:59,096 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:31:59,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:31:59,097 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:31:59,098 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:31:59,099 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:31:59,100 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:31:59,101 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:31:59,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:31:59,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:31:59,106 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:31:59,111 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:31:59,112 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:31:59,113 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:31:59,116 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:31:59,116 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:31:59,116 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:31:59,117 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:31:59,118 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:31:59,119 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:31:59,120 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:31:59,121 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:31:59,121 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:31:59,122 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:31:59,122 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:31:59,123 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:31:59,123 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:31:59,124 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:31:59,125 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-23 11:31:59,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:31:59,140 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:31:59,141 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:31:59,142 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:31:59,142 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:31:59,142 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:31:59,143 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:31:59,143 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:31:59,143 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:31:59,143 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:31:59,143 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:31:59,144 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:31:59,144 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:31:59,144 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:31:59,144 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:31:59,144 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:31:59,145 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:31:59,145 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:31:59,145 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:31:59,145 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:31:59,145 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:31:59,146 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:31:59,146 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:31:59,146 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:31:59,146 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:31:59,146 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:31:59,147 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:31:59,147 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:31:59,147 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:31:59,147 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:31:59,147 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:31:59,148 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:31:59,148 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:31:59,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:31:59,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:31:59,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:31:59,222 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:31:59,222 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:31:59,223 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_vardep_true-unreach-call2_true-termination.i [2018-11-23 11:31:59,282 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45c8d7d77/47dc6d198ece43cc9478fa349bcd9a38/FLAGf75fbf68c [2018-11-23 11:31:59,744 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:31:59,746 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_vardep_true-unreach-call2_true-termination.i [2018-11-23 11:31:59,753 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45c8d7d77/47dc6d198ece43cc9478fa349bcd9a38/FLAGf75fbf68c [2018-11-23 11:32:00,104 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45c8d7d77/47dc6d198ece43cc9478fa349bcd9a38 [2018-11-23 11:32:00,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:32:00,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:32:00,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:00,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:32:00,129 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:32:00,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:00" (1/1) ... [2018-11-23 11:32:00,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@437ab0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00, skipping insertion in model container [2018-11-23 11:32:00,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:00" (1/1) ... [2018-11-23 11:32:00,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:32:00,177 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:32:00,397 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:00,405 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:32:00,425 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:00,444 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:32:00,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00 WrapperNode [2018-11-23 11:32:00,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:00,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:00,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:32:00,446 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:32:00,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2018-11-23 11:32:00,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2018-11-23 11:32:00,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:00,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:32:00,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:32:00,476 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:32:00,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2018-11-23 11:32:00,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2018-11-23 11:32:00,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2018-11-23 11:32:00,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2018-11-23 11:32:00,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2018-11-23 11:32:00,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2018-11-23 11:32:00,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (1/1) ... [2018-11-23 11:32:00,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:32:00,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:32:00,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:32:00,507 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:32:00,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (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 11:32:00,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:32:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:32:00,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:32:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:32:00,633 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:32:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:32:00,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:32:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:32:01,035 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:32:01,035 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:32:01,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:01 BoogieIcfgContainer [2018-11-23 11:32:01,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:32:01,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:32:01,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:32:01,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:32:01,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:00" (1/3) ... [2018-11-23 11:32:01,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709e6094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:01, skipping insertion in model container [2018-11-23 11:32:01,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00" (2/3) ... [2018-11-23 11:32:01,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709e6094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:01, skipping insertion in model container [2018-11-23 11:32:01,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:01" (3/3) ... [2018-11-23 11:32:01,043 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_vardep_true-unreach-call2_true-termination.i [2018-11-23 11:32:01,051 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:32:01,062 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:32:01,082 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:32:01,125 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:32:01,126 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:32:01,127 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:32:01,127 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:32:01,127 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:32:01,127 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:32:01,127 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:32:01,128 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:32:01,128 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:32:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 11:32:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:32:01,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:01,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:01,165 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:01,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:01,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1847991872, now seen corresponding path program 1 times [2018-11-23 11:32:01,175 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:01,175 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-23 11:32:01,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:01,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:01,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 11:32:01,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 11:32:01,748 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 11:32:01,748 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret0 := main(); {20#true} is VALID [2018-11-23 11:32:01,750 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {37#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:01,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !!~bvult32(~k~0, 268435455bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(2bv32, ~j~0);~k~0 := ~bvadd32(3bv32, ~k~0); {41#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:01,765 INFO L256 TraceCheckUtils]: 6: Hoare triple {41#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~k~0 == ~bvmul32(3bv32, ~i~0) && ~j~0 == ~bvmul32(2bv32, ~i~0) then 1bv32 else 0bv32)); {45#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:01,780 INFO L273 TraceCheckUtils]: 7: Hoare triple {45#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {49#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:01,795 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {21#false} is VALID [2018-11-23 11:32:01,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 11:32:01,800 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 11:32:01,800 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:01,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:01,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:32:01,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-11-23 11:32:01,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:01,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:32:01,972 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 11:32:01,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:32:01,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:32:01,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:32:01,984 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 6 states. [2018-11-23 11:32:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:02,764 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2018-11-23 11:32:02,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:32:02,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-11-23 11:32:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:32:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2018-11-23 11:32:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:32:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2018-11-23 11:32:02,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2018-11-23 11:32:02,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:02,950 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:32:02,950 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 11:32:02,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:32:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 11:32:03,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-23 11:32:03,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:03,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 19 states. [2018-11-23 11:32:03,215 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 19 states. [2018-11-23 11:32:03,215 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 19 states. [2018-11-23 11:32:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:03,220 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 11:32:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 11:32:03,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:03,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:03,224 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 20 states. [2018-11-23 11:32:03,224 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 20 states. [2018-11-23 11:32:03,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:03,234 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 11:32:03,234 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 11:32:03,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:03,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:03,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:03,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:32:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 11:32:03,240 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 10 [2018-11-23 11:32:03,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:03,241 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 11:32:03,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:32:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 11:32:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:32:03,242 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:03,242 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:03,243 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:03,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:03,243 INFO L82 PathProgramCache]: Analyzing trace with hash 982254813, now seen corresponding path program 1 times [2018-11-23 11:32:03,244 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:03,244 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-23 11:32:03,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:03,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:03,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {176#true} call ULTIMATE.init(); {176#true} is VALID [2018-11-23 11:32:03,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {176#true} assume true; {176#true} is VALID [2018-11-23 11:32:03,747 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {176#true} {176#true} #31#return; {176#true} is VALID [2018-11-23 11:32:03,748 INFO L256 TraceCheckUtils]: 3: Hoare triple {176#true} call #t~ret0 := main(); {176#true} is VALID [2018-11-23 11:32:03,750 INFO L273 TraceCheckUtils]: 4: Hoare triple {176#true} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {193#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:03,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {193#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !!~bvult32(~k~0, 268435455bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(2bv32, ~j~0);~k~0 := ~bvadd32(3bv32, ~k~0); {197#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:03,751 INFO L256 TraceCheckUtils]: 6: Hoare triple {197#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~k~0 == ~bvmul32(3bv32, ~i~0) && ~j~0 == ~bvmul32(2bv32, ~i~0) then 1bv32 else 0bv32)); {176#true} is VALID [2018-11-23 11:32:03,752 INFO L273 TraceCheckUtils]: 7: Hoare triple {176#true} ~cond := #in~cond; {176#true} is VALID [2018-11-23 11:32:03,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {176#true} assume !(0bv32 == ~cond); {176#true} is VALID [2018-11-23 11:32:03,753 INFO L273 TraceCheckUtils]: 9: Hoare triple {176#true} assume true; {176#true} is VALID [2018-11-23 11:32:03,773 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {176#true} {197#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #35#return; {197#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:03,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {197#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvult32(~k~0, 268435455bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(2bv32, ~j~0);~k~0 := ~bvadd32(3bv32, ~k~0); {216#(and (= (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:03,786 INFO L256 TraceCheckUtils]: 12: Hoare triple {216#(and (= (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~k~0 == ~bvmul32(3bv32, ~i~0) && ~j~0 == ~bvmul32(2bv32, ~i~0) then 1bv32 else 0bv32)); {220#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:03,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {220#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {224#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:03,787 INFO L273 TraceCheckUtils]: 14: Hoare triple {224#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {177#false} is VALID [2018-11-23 11:32:03,788 INFO L273 TraceCheckUtils]: 15: Hoare triple {177#false} assume !false; {177#false} is VALID [2018-11-23 11:32:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:03,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:32:08,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {177#false} assume !false; {177#false} is VALID [2018-11-23 11:32:08,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {234#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {177#false} is VALID [2018-11-23 11:32:08,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {238#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {234#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:32:08,132 INFO L256 TraceCheckUtils]: 12: Hoare triple {242#(and (= main_~k~0 (bvmul (_ bv3 32) main_~i~0)) (= (bvmul (_ bv2 32) main_~i~0) main_~j~0))} call __VERIFIER_assert((if ~k~0 == ~bvmul32(3bv32, ~i~0) && ~j~0 == ~bvmul32(2bv32, ~i~0) then 1bv32 else 0bv32)); {238#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:08,741 INFO L273 TraceCheckUtils]: 11: Hoare triple {242#(and (= main_~k~0 (bvmul (_ bv3 32) main_~i~0)) (= (bvmul (_ bv2 32) main_~i~0) main_~j~0))} assume !!~bvult32(~k~0, 268435455bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(2bv32, ~j~0);~k~0 := ~bvadd32(3bv32, ~k~0); {242#(and (= main_~k~0 (bvmul (_ bv3 32) main_~i~0)) (= (bvmul (_ bv2 32) main_~i~0) main_~j~0))} is VALID [2018-11-23 11:32:08,742 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {176#true} {242#(and (= main_~k~0 (bvmul (_ bv3 32) main_~i~0)) (= (bvmul (_ bv2 32) main_~i~0) main_~j~0))} #35#return; {242#(and (= main_~k~0 (bvmul (_ bv3 32) main_~i~0)) (= (bvmul (_ bv2 32) main_~i~0) main_~j~0))} is VALID [2018-11-23 11:32:08,743 INFO L273 TraceCheckUtils]: 9: Hoare triple {176#true} assume true; {176#true} is VALID [2018-11-23 11:32:08,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {176#true} assume !(0bv32 == ~cond); {176#true} is VALID [2018-11-23 11:32:08,744 INFO L273 TraceCheckUtils]: 7: Hoare triple {176#true} ~cond := #in~cond; {176#true} is VALID [2018-11-23 11:32:08,744 INFO L256 TraceCheckUtils]: 6: Hoare triple {242#(and (= main_~k~0 (bvmul (_ bv3 32) main_~i~0)) (= (bvmul (_ bv2 32) main_~i~0) main_~j~0))} call __VERIFIER_assert((if ~k~0 == ~bvmul32(3bv32, ~i~0) && ~j~0 == ~bvmul32(2bv32, ~i~0) then 1bv32 else 0bv32)); {176#true} is VALID [2018-11-23 11:32:10,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {242#(and (= main_~k~0 (bvmul (_ bv3 32) main_~i~0)) (= (bvmul (_ bv2 32) main_~i~0) main_~j~0))} assume !!~bvult32(~k~0, 268435455bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(2bv32, ~j~0);~k~0 := ~bvadd32(3bv32, ~k~0); {242#(and (= main_~k~0 (bvmul (_ bv3 32) main_~i~0)) (= (bvmul (_ bv2 32) main_~i~0) main_~j~0))} is VALID [2018-11-23 11:32:10,124 INFO L273 TraceCheckUtils]: 4: Hoare triple {176#true} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {242#(and (= main_~k~0 (bvmul (_ bv3 32) main_~i~0)) (= (bvmul (_ bv2 32) main_~i~0) main_~j~0))} is VALID [2018-11-23 11:32:10,125 INFO L256 TraceCheckUtils]: 3: Hoare triple {176#true} call #t~ret0 := main(); {176#true} is VALID [2018-11-23 11:32:10,125 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {176#true} {176#true} #31#return; {176#true} is VALID [2018-11-23 11:32:10,125 INFO L273 TraceCheckUtils]: 1: Hoare triple {176#true} assume true; {176#true} is VALID [2018-11-23 11:32:10,126 INFO L256 TraceCheckUtils]: 0: Hoare triple {176#true} call ULTIMATE.init(); {176#true} is VALID [2018-11-23 11:32:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:32:10,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:32:10,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-11-23 11:32:10,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 11:32:10,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:10,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:32:10,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:10,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:32:10,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:32:10,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:32:10,767 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-11-23 11:32:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:11,347 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 11:32:11,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:32:11,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 11:32:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:32:11,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-23 11:32:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:32:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-23 11:32:11,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2018-11-23 11:32:12,869 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-23 11:32:12,869 INFO L225 Difference]: With dead ends: 22 [2018-11-23 11:32:12,869 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:32:12,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:32:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:32:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:32:12,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:12,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:32:12,872 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:32:12,873 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:32:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:12,873 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:32:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:32:12,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:12,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:12,874 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:32:12,874 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:32:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:12,875 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:32:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:32:12,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:12,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:12,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:12,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:12,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:32:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:32:12,876 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-11-23 11:32:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:12,877 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:32:12,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:32:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:32:12,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:12,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:32:13,167 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 10 [2018-11-23 11:32:13,292 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:32:13,292 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:32:13,292 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:32:13,292 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:32:13,292 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:32:13,292 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:32:13,293 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 15 28) the Hoare annotation is: true [2018-11-23 11:32:13,293 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (and (= main_~k~0 (bvmul (_ bv3 32) main_~i~0)) (= (bvmul (_ bv2 32) main_~i~0) main_~j~0)) [2018-11-23 11:32:13,293 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 15 28) no Hoare annotation was computed. [2018-11-23 11:32:13,293 INFO L444 ceAbstractionStarter]: At program point L25-1(lines 21 26) the Hoare annotation is: (and (= main_~k~0 (bvmul (_ bv3 32) main_~i~0)) (= (bvmul (_ bv2 32) main_~i~0) main_~j~0)) [2018-11-23 11:32:13,293 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 15 28) no Hoare annotation was computed. [2018-11-23 11:32:13,293 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 7 13) the Hoare annotation is: true [2018-11-23 11:32:13,294 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-11-23 11:32:13,294 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 7 13) no Hoare annotation was computed. [2018-11-23 11:32:13,294 INFO L448 ceAbstractionStarter]: For program point L9(lines 9 11) no Hoare annotation was computed. [2018-11-23 11:32:13,294 INFO L448 ceAbstractionStarter]: For program point L9-2(lines 7 13) no Hoare annotation was computed. [2018-11-23 11:32:13,294 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-23 11:32:13,296 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:32:13,312 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2018-11-23 11:32:13,312 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:32:13,312 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:32:13,313 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-23 11:32:13,313 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-23 11:32:14,052 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2018-11-23 11:32:14,052 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2018-11-23 11:32:14,052 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:32:14,052 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-23 11:32:14,052 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2018-11-23 11:32:14,052 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2018-11-23 11:32:14,053 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2018-11-23 11:32:14,053 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:32:14,053 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:32:14,053 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 11:32:14,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:14 BoogieIcfgContainer [2018-11-23 11:32:14,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:32:14,068 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:32:14,069 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:32:14,069 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:32:14,070 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:01" (3/4) ... [2018-11-23 11:32:14,073 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:32:14,080 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:32:14,081 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:32:14,081 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:32:14,085 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 11:32:14,085 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 11:32:14,085 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:32:14,130 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-crafted/simple_vardep_true-unreach-call2_true-termination.i-witness.graphml [2018-11-23 11:32:14,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:32:14,132 INFO L168 Benchmark]: Toolchain (without parser) took 14013.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -568.3 MB). Peak memory consumption was 166.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:14,133 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 11:32:14,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.41 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 11:32:14,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.36 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 11:32:14,135 INFO L168 Benchmark]: Boogie Preprocessor took 30.71 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 11:32:14,136 INFO L168 Benchmark]: RCFGBuilder took 529.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:14,137 INFO L168 Benchmark]: TraceAbstraction took 13031.68 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: 191.2 MB). Peak memory consumption was 191.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:14,137 INFO L168 Benchmark]: Witness Printer took 62.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:14,142 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 322.41 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 29.36 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 30.71 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 529.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13031.68 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: 191.2 MB). Peak memory consumption was 191.2 MB. Max. memory is 7.1 GB. * Witness Printer took 62.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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: 21]: Loop Invariant Derived loop invariant: k == ~bvmul32(3bv32, i) && ~bvmul32(2bv32, i) == j - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. SAFE Result, 12.1s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 22 SDtfs, 10 SDslu, 89 SDs, 0 SdLazy, 79 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=1, 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.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 27 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 76 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 2439 SizeOfPredicates, 4 NumberOfNonLiveVariables, 57 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...