java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInlineTransformed.xml --icfgtransformation.transformationtype MAP_ELIMINATION_MONNIAUX -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:56:00,384 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:56:00,386 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:56:00,398 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:56:00,399 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:56:00,400 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:56:00,401 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:56:00,403 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:56:00,405 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:56:00,406 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:56:00,407 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:56:00,407 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:56:00,408 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:56:00,409 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:56:00,411 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:56:00,411 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:56:00,412 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:56:00,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:56:00,417 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:56:00,421 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:56:00,422 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:56:00,424 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:56:00,429 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:56:00,429 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:56:00,430 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:56:00,431 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:56:00,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:56:00,432 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:56:00,433 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:56:00,435 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:56:00,437 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:56:00,438 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:56:00,440 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:56:00,440 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:56:00,441 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:56:00,441 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:56:00,441 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:56:00,443 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:56:00,444 INFO L181 SettingsManager]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: TransformationType -> MAP_ELIMINATION_MONNIAUX [2019-05-15 10:56:00,487 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:56:00,499 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:56:00,504 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:56:00,505 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:56:00,506 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:56:00,507 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_3.bpl [2019-05-15 10:56:00,507 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_3.bpl' [2019-05-15 10:56:00,602 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:56:00,604 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:56:00,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:00,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:56:00,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:56:00,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:00,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:56:00,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:56:00,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:56:00,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:56:00,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:56:00,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:56:00,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:56:00,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56: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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-05-15 10:56:00,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-05-15 10:56:00,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-05-15 10:56:01,299 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-15 10:56:01,299 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-05-15 10:56:01,300 INFO L202 PluginConnector]: Adding new model eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:01 BoogieIcfgContainer [2019-05-15 10:56:01,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:56:01,301 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:56:01,301 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:56:01,302 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:56:01,305 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:01" (1/1) ... [2019-05-15 10:56:01,375 INFO L632 onniauxMapEliminator]: ULTIMATE.startENTRY [2019-05-15 10:56:01,376 INFO L633 onniauxMapEliminator]: In Formula: (and (= v_~INFINITY_1 899) (<= 0 v_ULTIMATE.start_main_~edgecount~5_1) (= v_ULTIMATE.start_main_~i~5_1 0) (= v_ULTIMATE.start_main_~Weight~5_1 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store v_ULTIMATE.start_main_~Weight~5_22 0 0) 1 1) 2 2) 3 3) 4 4) 5 5) 6 6) 7 7) 8 8) 9 9) 10 10) 11 11) 12 12) 13 13) 14 14) 15 15) 16 16) 17 17) 18 18) 19 19)) (<= v_ULTIMATE.start_main_~edgecount~5_1 19) (<= v_ULTIMATE.start_main_~nodecount~5_1 2147483647) (<= 0 (+ v_ULTIMATE.start_main_~nodecount~5_1 2147483648)) (= v_ULTIMATE.start_main_~source~5_1 0) (<= v_ULTIMATE.start_main_~nodecount~5_1 4) (= (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store v_ULTIMATE.start_main_~Dest~5_22 0 1) 1 3) 2 4) 3 1) 4 1) 5 4) 6 3) 7 4) 8 3) 9 0) 10 0) 11 0) 12 0) 13 2) 14 3) 15 0) 16 2) 17 1) 18 0) 19 4) v_ULTIMATE.start_main_~Dest~5_1) (<= 0 (+ v_ULTIMATE.start_main_~edgecount~5_1 2147483648)) (<= v_ULTIMATE.start_main_~edgecount~5_1 2147483647) (= v_ULTIMATE.start_main_~Source~5_1 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store v_ULTIMATE.start_main_~Source~5_22 0 0) 1 4) 2 1) 3 1) 4 0) 5 0) 6 1) 7 3) 8 4) 9 4) 10 2) 11 2) 12 3) 13 0) 14 0) 15 3) 16 1) 17 2) 18 2) 19 3)) (<= 0 v_ULTIMATE.start_main_~nodecount~5_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~Dest~5=v_ULTIMATE.start_main_~Dest~5_1, ~INFINITY=v_~INFINITY_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_~source~5=v_ULTIMATE.start_main_~source~5_1, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_~x~5=v_ULTIMATE.start_main_~x~5_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_1, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_~Weight~5=v_ULTIMATE.start_main_~Weight~5_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~edgecount~5=v_ULTIMATE.start_main_~edgecount~5_1, ULTIMATE.start_main_~distance~5=v_ULTIMATE.start_main_~distance~5_1, ULTIMATE.start_main_~Source~5=v_ULTIMATE.start_main_~Source~5_1, ULTIMATE.start_main_~y~5=v_ULTIMATE.start_main_~y~5_1, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1} AuxVars[v_ULTIMATE.start_main_~Source~5_22, v_ULTIMATE.start_main_~Dest~5_22, v_ULTIMATE.start_main_~Weight~5_22] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~Dest~5, ~INFINITY, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~source~5, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~5, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~edgecount~5, ULTIMATE.start_main_~distance~5, ULTIMATE.start_main_~Source~5, ULTIMATE.start_main_~y~5, ULTIMATE.start_main_~nodecount~5, ULTIMATE.start_main_~j~5] [2019-05-15 10:56:01,376 INFO L634 onniauxMapEliminator]: Out Formula: (and (= v_~INFINITY_1 899) (<= 0 v_ULTIMATE.start_main_~edgecount~5_1) (= v_ULTIMATE.start_main_~i~5_1 0) (<= v_ULTIMATE.start_main_~edgecount~5_1 19) (<= v_ULTIMATE.start_main_~nodecount~5_1 2147483647) (<= 0 (+ v_ULTIMATE.start_main_~nodecount~5_1 2147483648)) (= v_ULTIMATE.start_main_~source~5_1 0) (<= v_ULTIMATE.start_main_~nodecount~5_1 4) (or (= 19 |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Weight~5_22_0_0)_1BAR_1_1)_1BAR_2_2)_1BAR_3_3)_1BAR_4_4)_1BAR_5_5)_1BAR_6_6)_1BAR_7_7)_1BAR_8_8)_1BAR_9_9)_1BAR_10_10)_1BAR_11_11)_1BAR_12_12)_1BAR_13_13)_1BAR_14_14)_1BAR_15_15)_1BAR_16_16)_1BAR_17_17)_1BAR_18_18)_1_val_0_1|) (not (= |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Weight~5_22_0_0)_1BAR_1_1)_1BAR_2_2)_1BAR_3_3)_1BAR_4_4)_1BAR_5_5)_1BAR_6_6)_1BAR_7_7)_1BAR_8_8)_1BAR_9_9)_1BAR_10_10)_1BAR_11_11)_1BAR_12_12)_1BAR_13_13)_1BAR_14_14)_1BAR_15_15)_1BAR_16_16)_1BAR_17_17)_1BAR_18_18)_1_idx_0_1| 19))) (<= 0 (+ v_ULTIMATE.start_main_~edgecount~5_1 2147483648)) (or (= 3 |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Source~5_22_0_0)_1BAR_1_4)_1BAR_2_1)_1BAR_3_1)_1BAR_4_0)_1BAR_5_0)_1BAR_6_1)_1BAR_7_3)_1BAR_8_4)_1BAR_9_4)_1BAR_10_2)_1BAR_11_2)_1BAR_12_3)_1BAR_13_0)_1BAR_14_0)_1BAR_15_3)_1BAR_16_1)_1BAR_17_2)_1BAR_18_2)_1_val_0_1|) (not (= |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Source~5_22_0_0)_1BAR_1_4)_1BAR_2_1)_1BAR_3_1)_1BAR_4_0)_1BAR_5_0)_1BAR_6_1)_1BAR_7_3)_1BAR_8_4)_1BAR_9_4)_1BAR_10_2)_1BAR_11_2)_1BAR_12_3)_1BAR_13_0)_1BAR_14_0)_1BAR_15_3)_1BAR_16_1)_1BAR_17_2)_1BAR_18_2)_1_idx_0_1| 19))) (<= v_ULTIMATE.start_main_~edgecount~5_1 2147483647) (or (= 4 |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Dest~5_22_0_1)_1BAR_1_3)_1BAR_2_4)_1BAR_3_1)_1BAR_4_1)_1BAR_5_4)_1BAR_6_3)_1BAR_7_4)_1BAR_8_3)_1BAR_9_0)_1BAR_10_0)_1BAR_11_0)_1BAR_12_0)_1BAR_13_2)_1BAR_14_3)_1BAR_15_0)_1BAR_16_2)_1BAR_17_1)_1BAR_18_0)_1_val_0_1|) (not (= 19 |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Dest~5_22_0_1)_1BAR_1_3)_1BAR_2_4)_1BAR_3_1)_1BAR_4_1)_1BAR_5_4)_1BAR_6_3)_1BAR_7_4)_1BAR_8_3)_1BAR_9_0)_1BAR_10_0)_1BAR_11_0)_1BAR_12_0)_1BAR_13_2)_1BAR_14_3)_1BAR_15_0)_1BAR_16_2)_1BAR_17_1)_1BAR_18_0)_1_idx_0_1|))) (<= 0 v_ULTIMATE.start_main_~nodecount~5_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_~edgecount~5=v_ULTIMATE.start_main_~edgecount~5_1, ULTIMATE.start_main_~distance~5_val_0=v_ULTIMATE.start_main_~distance~5_val_0_out_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1, ~INFINITY=v_~INFINITY_1, ULTIMATE.start_main_~Dest~5_val_0=v_ULTIMATE.start_main_~Dest~5_val_0_out_1, ULTIMATE.start_main_~source~5=v_ULTIMATE.start_main_~source~5_1, ULTIMATE.start_main_~x~5=v_ULTIMATE.start_main_~x~5_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~Source~5_val_0=v_ULTIMATE.start_main_~Source~5_val_0_out_1, ULTIMATE.start_main_~Weight~5_val_0=v_ULTIMATE.start_main_~Weight~5_val_0_out_1, ULTIMATE.start_main_~y~5=v_ULTIMATE.start_main_~y~5_1, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_1} AuxVars[|v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Source~5_22_0_0)_1BAR_1_4)_1BAR_2_1)_1BAR_3_1)_1BAR_4_0)_1BAR_5_0)_1BAR_6_1)_1BAR_7_3)_1BAR_8_4)_1BAR_9_4)_1BAR_10_2)_1BAR_11_2)_1BAR_12_3)_1BAR_13_0)_1BAR_14_0)_1BAR_15_3)_1BAR_16_1)_1BAR_17_2)_1BAR_18_2)_1_val_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Dest~5_22_0_1)_1BAR_1_3)_1BAR_2_4)_1BAR_3_1)_1BAR_4_1)_1BAR_5_4)_1BAR_6_3)_1BAR_7_4)_1BAR_8_3)_1BAR_9_0)_1BAR_10_0)_1BAR_11_0)_1BAR_12_0)_1BAR_13_2)_1BAR_14_3)_1BAR_15_0)_1BAR_16_2)_1BAR_17_1)_1BAR_18_0)_1_val_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Weight~5_22_0_0)_1BAR_1_1)_1BAR_2_2)_1BAR_3_3)_1BAR_4_4)_1BAR_5_5)_1BAR_6_6)_1BAR_7_7)_1BAR_8_8)_1BAR_9_9)_1BAR_10_10)_1BAR_11_11)_1BAR_12_12)_1BAR_13_13)_1BAR_14_14)_1BAR_15_15)_1BAR_16_16)_1BAR_17_17)_1BAR_18_18)_1_idx_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Source~5_22_0_0)_1BAR_1_4)_1BAR_2_1)_1BAR_3_1)_1BAR_4_0)_1BAR_5_0)_1BAR_6_1)_1BAR_7_3)_1BAR_8_4)_1BAR_9_4)_1BAR_10_2)_1BAR_11_2)_1BAR_12_3)_1BAR_13_0)_1BAR_14_0)_1BAR_15_3)_1BAR_16_1)_1BAR_17_2)_1BAR_18_2)_1_idx_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Weight~5_22_0_0)_1BAR_1_1)_1BAR_2_2)_1BAR_3_3)_1BAR_4_4)_1BAR_5_5)_1BAR_6_6)_1BAR_7_7)_1BAR_8_8)_1BAR_9_9)_1BAR_10_10)_1BAR_11_11)_1BAR_12_12)_1BAR_13_13)_1BAR_14_14)_1BAR_15_15)_1BAR_16_16)_1BAR_17_17)_1BAR_18_18)_1_val_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Dest~5_22_0_1)_1BAR_1_3)_1BAR_2_4)_1BAR_3_1)_1BAR_4_1)_1BAR_5_4)_1BAR_6_3)_1BAR_7_4)_1BAR_8_3)_1BAR_9_0)_1BAR_10_0)_1BAR_11_0)_1BAR_12_0)_1BAR_13_2)_1BAR_14_3)_1BAR_15_0)_1BAR_16_2)_1BAR_17_1)_1BAR_18_0)_1_idx_0_1|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ~INFINITY, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~Dest~5_val_0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~source~5, ULTIMATE.start_main_~x~5, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~edgecount~5, ULTIMATE.start_main_~Source~5_val_0, ULTIMATE.start_main_~distance~5_val_0, ULTIMATE.start_main_~Weight~5_val_0, ULTIMATE.start_main_~y~5, ULTIMATE.start_main_~nodecount~5, ULTIMATE.start_main_~j~5] [2019-05-15 10:56:01,377 INFO L635 onniauxMapEliminator]: L122 [2019-05-15 10:56:01,402 INFO L632 onniauxMapEliminator]: L122 [2019-05-15 10:56:01,402 INFO L633 onniauxMapEliminator]: In Formula: (and (= (+ v_ULTIMATE.start_main_~i~5_7 1) v_ULTIMATE.start_main_~i~5_6) (< v_ULTIMATE.start_main_~i~5_7 v_ULTIMATE.start_main_~nodecount~5_4) (= v_ULTIMATE.start_main_~source~5_3 v_ULTIMATE.start_main_~i~5_7) (= v_ULTIMATE.start_main_~distance~5_3 (store v_ULTIMATE.start_main_~distance~5_4 v_ULTIMATE.start_main_~i~5_7 0))) InVars {ULTIMATE.start_main_~source~5=v_ULTIMATE.start_main_~source~5_3, ULTIMATE.start_main_~distance~5=v_ULTIMATE.start_main_~distance~5_4, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_7} OutVars{ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~source~5=v_ULTIMATE.start_main_~source~5_3, ULTIMATE.start_main_~distance~5=v_ULTIMATE.start_main_~distance~5_3, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_4, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~distance~5, ULTIMATE.start_main_~i~5] [2019-05-15 10:56:01,402 INFO L634 onniauxMapEliminator]: Out Formula: (and v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1 (= (+ v_ULTIMATE.start_main_~i~5_7 1) v_ULTIMATE.start_main_~i~5_6) (or (not v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~i~5_7 v_ULTIMATE.start_main_~distance~5_idx_0_term_2)) (or (not (= v_ULTIMATE.start_main_~i~5_7 v_ULTIMATE.start_main_~distance~5_idx_0_term_2)) (= v_ULTIMATE.start_main_~distance~5_val_0_in_1 0)) (< v_ULTIMATE.start_main_~i~5_7 v_ULTIMATE.start_main_~nodecount~5_4) (= v_ULTIMATE.start_main_~source~5_3 v_ULTIMATE.start_main_~i~5_7) (= v_ULTIMATE.start_main_~distance~5_val_0_in_1 v_ULTIMATE.start_main_~distance~5_val_0_out_2)) InVars {ULTIMATE.start_main_~source~5=v_ULTIMATE.start_main_~source~5_3, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_7, ULTIMATE.start_main_~distance~5_idx_0=v_ULTIMATE.start_main_~distance~5_idx_0_term_2, ULTIMATE.start_main_~distance~5_val_0=v_ULTIMATE.start_main_~distance~5_val_0_in_1, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_4, ULTIMATE.start_main_~distance~5_idx_0_bool=v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1} OutVars{ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~source~5=v_ULTIMATE.start_main_~source~5_3, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6, ULTIMATE.start_main_~distance~5_idx_0=v_ULTIMATE.start_main_~distance~5_idx_0_term_2, ULTIMATE.start_main_~distance~5_val_0=v_ULTIMATE.start_main_~distance~5_val_0_out_2, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_4, ULTIMATE.start_main_~distance~5_idx_0_bool=v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~distance~5_val_0, ULTIMATE.start_main_~i~5] [2019-05-15 10:56:01,403 INFO L635 onniauxMapEliminator]: L122 [2019-05-15 10:56:01,413 INFO L632 onniauxMapEliminator]: L150 [2019-05-15 10:56:01,413 INFO L633 onniauxMapEliminator]: In Formula: (and (<= v_ULTIMATE.start_main_~edgecount~5_3 0) (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (< v_ULTIMATE.start_main_~i~5_8 v_ULTIMATE.start_main_~nodecount~5_5) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (<= 0 (select v_ULTIMATE.start_main_~distance~5_5 v_ULTIMATE.start_main_~i~5_8)) 1 0)) (not (< v_ULTIMATE.start_main_~i~5_10 v_ULTIMATE.start_main_~nodecount~5_5)) (= v_ULTIMATE.start_main_~i~5_8 0) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1)) InVars {ULTIMATE.start_main_~edgecount~5=v_ULTIMATE.start_main_~edgecount~5_3, ULTIMATE.start_main_~distance~5=v_ULTIMATE.start_main_~distance~5_5, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_5, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_10} OutVars{ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~edgecount~5=v_ULTIMATE.start_main_~edgecount~5_3, ULTIMATE.start_main_~distance~5=v_ULTIMATE.start_main_~distance~5_5, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_5, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~i~5] [2019-05-15 10:56:01,414 INFO L634 onniauxMapEliminator]: Out Formula: (and v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1 (<= v_ULTIMATE.start_main_~edgecount~5_3 0) (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (< v_ULTIMATE.start_main_~i~5_8 v_ULTIMATE.start_main_~nodecount~5_5) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (<= 0 v_v_ULTIMATE.start_main_~distance~5_5_aux_1) 1 0)) (not (< v_ULTIMATE.start_main_~i~5_10 v_ULTIMATE.start_main_~nodecount~5_5)) (= v_ULTIMATE.start_main_~i~5_8 0) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (or (not (= v_ULTIMATE.start_main_~i~5_8 v_ULTIMATE.start_main_~distance~5_idx_0_term_3)) (= v_ULTIMATE.start_main_~distance~5_val_0_in_2 v_v_ULTIMATE.start_main_~distance~5_5_aux_1)) (or (not v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1) (= v_ULTIMATE.start_main_~i~5_8 v_ULTIMATE.start_main_~distance~5_idx_0_term_3))) InVars {ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_10, ULTIMATE.start_main_~edgecount~5=v_ULTIMATE.start_main_~edgecount~5_3, ULTIMATE.start_main_~distance~5_idx_0=v_ULTIMATE.start_main_~distance~5_idx_0_term_3, ULTIMATE.start_main_~distance~5_val_0=v_ULTIMATE.start_main_~distance~5_val_0_in_2, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_5, ULTIMATE.start_main_~distance~5_idx_0_bool=v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1} OutVars{ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_8, ULTIMATE.start_main_~edgecount~5=v_ULTIMATE.start_main_~edgecount~5_3, ULTIMATE.start_main_~distance~5_idx_0=v_ULTIMATE.start_main_~distance~5_idx_0_term_3, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~distance~5_val_0=v_ULTIMATE.start_main_~distance~5_val_0_in_2, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_5, ULTIMATE.start_main_~distance~5_idx_0_bool=v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1} AuxVars[v_v_ULTIMATE.start_main_~distance~5_5_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~i~5] [2019-05-15 10:56:01,414 INFO L635 onniauxMapEliminator]: L141 [2019-05-15 10:56:01,455 INFO L202 PluginConnector]: Adding new model eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:01 BasicIcfg [2019-05-15 10:56:01,456 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:56:01,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:56:01,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:56:01,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:56:01,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/3) ... [2019-05-15 10:56:01,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d907e3c and model type eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:56:01, skipping insertion in model container [2019-05-15 10:56:01,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:01" (2/3) ... [2019-05-15 10:56:01,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d907e3c and model type eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:01, skipping insertion in model container [2019-05-15 10:56:01,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:01" (3/3) ... [2019-05-15 10:56:01,465 INFO L109 eAbstractionObserver]: Analyzing ICFG eureka_01.i_3.bplME [2019-05-15 10:56:01,475 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:56:01,485 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:56:01,500 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:56:01,523 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:56:01,524 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:56:01,524 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:56:01,524 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:56:01,525 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:56:01,525 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:56:01,525 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:56:01,525 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:56:01,525 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:56:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-05-15 10:56:01,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-05-15 10:56:01,548 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:01,549 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-05-15 10:56:01,552 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:01,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:01,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1540260, now seen corresponding path program 1 times [2019-05-15 10:56:01,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:01,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:56:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:01,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:01,917 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} [20] ULTIMATE.startENTRY-->L122: Formula: (and (= v_~INFINITY_1 899) (<= 0 v_ULTIMATE.start_main_~edgecount~5_1) (= v_ULTIMATE.start_main_~i~5_1 0) (<= v_ULTIMATE.start_main_~edgecount~5_1 19) (<= v_ULTIMATE.start_main_~nodecount~5_1 2147483647) (<= 0 (+ v_ULTIMATE.start_main_~nodecount~5_1 2147483648)) (= v_ULTIMATE.start_main_~source~5_1 0) (<= v_ULTIMATE.start_main_~nodecount~5_1 4) (or (= 19 |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Weight~5_22_0_0)_1BAR_1_1)_1BAR_2_2)_1BAR_3_3)_1BAR_4_4)_1BAR_5_5)_1BAR_6_6)_1BAR_7_7)_1BAR_8_8)_1BAR_9_9)_1BAR_10_10)_1BAR_11_11)_1BAR_12_12)_1BAR_13_13)_1BAR_14_14)_1BAR_15_15)_1BAR_16_16)_1BAR_17_17)_1BAR_18_18)_1_val_0_1|) (not (= |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Weight~5_22_0_0)_1BAR_1_1)_1BAR_2_2)_1BAR_3_3)_1BAR_4_4)_1BAR_5_5)_1BAR_6_6)_1BAR_7_7)_1BAR_8_8)_1BAR_9_9)_1BAR_10_10)_1BAR_11_11)_1BAR_12_12)_1BAR_13_13)_1BAR_14_14)_1BAR_15_15)_1BAR_16_16)_1BAR_17_17)_1BAR_18_18)_1_idx_0_1| 19))) (<= 0 (+ v_ULTIMATE.start_main_~edgecount~5_1 2147483648)) (or (= 3 |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Source~5_22_0_0)_1BAR_1_4)_1BAR_2_1)_1BAR_3_1)_1BAR_4_0)_1BAR_5_0)_1BAR_6_1)_1BAR_7_3)_1BAR_8_4)_1BAR_9_4)_1BAR_10_2)_1BAR_11_2)_1BAR_12_3)_1BAR_13_0)_1BAR_14_0)_1BAR_15_3)_1BAR_16_1)_1BAR_17_2)_1BAR_18_2)_1_val_0_1|) (not (= |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Source~5_22_0_0)_1BAR_1_4)_1BAR_2_1)_1BAR_3_1)_1BAR_4_0)_1BAR_5_0)_1BAR_6_1)_1BAR_7_3)_1BAR_8_4)_1BAR_9_4)_1BAR_10_2)_1BAR_11_2)_1BAR_12_3)_1BAR_13_0)_1BAR_14_0)_1BAR_15_3)_1BAR_16_1)_1BAR_17_2)_1BAR_18_2)_1_idx_0_1| 19))) (<= v_ULTIMATE.start_main_~edgecount~5_1 2147483647) (or (= 4 |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Dest~5_22_0_1)_1BAR_1_3)_1BAR_2_4)_1BAR_3_1)_1BAR_4_1)_1BAR_5_4)_1BAR_6_3)_1BAR_7_4)_1BAR_8_3)_1BAR_9_0)_1BAR_10_0)_1BAR_11_0)_1BAR_12_0)_1BAR_13_2)_1BAR_14_3)_1BAR_15_0)_1BAR_16_2)_1BAR_17_1)_1BAR_18_0)_1_val_0_1|) (not (= 19 |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Dest~5_22_0_1)_1BAR_1_3)_1BAR_2_4)_1BAR_3_1)_1BAR_4_1)_1BAR_5_4)_1BAR_6_3)_1BAR_7_4)_1BAR_8_3)_1BAR_9_0)_1BAR_10_0)_1BAR_11_0)_1BAR_12_0)_1BAR_13_2)_1BAR_14_3)_1BAR_15_0)_1BAR_16_2)_1BAR_17_1)_1BAR_18_0)_1_idx_0_1|))) (<= 0 v_ULTIMATE.start_main_~nodecount~5_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_~edgecount~5=v_ULTIMATE.start_main_~edgecount~5_1, ULTIMATE.start_main_~distance~5_val_0=v_ULTIMATE.start_main_~distance~5_val_0_out_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1, ~INFINITY=v_~INFINITY_1, ULTIMATE.start_main_~Dest~5_val_0=v_ULTIMATE.start_main_~Dest~5_val_0_out_1, ULTIMATE.start_main_~source~5=v_ULTIMATE.start_main_~source~5_1, ULTIMATE.start_main_~x~5=v_ULTIMATE.start_main_~x~5_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~Source~5_val_0=v_ULTIMATE.start_main_~Source~5_val_0_out_1, ULTIMATE.start_main_~Weight~5_val_0=v_ULTIMATE.start_main_~Weight~5_val_0_out_1, ULTIMATE.start_main_~y~5=v_ULTIMATE.start_main_~y~5_1, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_1} AuxVars[|v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Source~5_22_0_0)_1BAR_1_4)_1BAR_2_1)_1BAR_3_1)_1BAR_4_0)_1BAR_5_0)_1BAR_6_1)_1BAR_7_3)_1BAR_8_4)_1BAR_9_4)_1BAR_10_2)_1BAR_11_2)_1BAR_12_3)_1BAR_13_0)_1BAR_14_0)_1BAR_15_3)_1BAR_16_1)_1BAR_17_2)_1BAR_18_2)_1_val_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Dest~5_22_0_1)_1BAR_1_3)_1BAR_2_4)_1BAR_3_1)_1BAR_4_1)_1BAR_5_4)_1BAR_6_3)_1BAR_7_4)_1BAR_8_3)_1BAR_9_0)_1BAR_10_0)_1BAR_11_0)_1BAR_12_0)_1BAR_13_2)_1BAR_14_3)_1BAR_15_0)_1BAR_16_2)_1BAR_17_1)_1BAR_18_0)_1_val_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Weight~5_22_0_0)_1BAR_1_1)_1BAR_2_2)_1BAR_3_3)_1BAR_4_4)_1BAR_5_5)_1BAR_6_6)_1BAR_7_7)_1BAR_8_8)_1BAR_9_9)_1BAR_10_10)_1BAR_11_11)_1BAR_12_12)_1BAR_13_13)_1BAR_14_14)_1BAR_15_15)_1BAR_16_16)_1BAR_17_17)_1BAR_18_18)_1_idx_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Source~5_22_0_0)_1BAR_1_4)_1BAR_2_1)_1BAR_3_1)_1BAR_4_0)_1BAR_5_0)_1BAR_6_1)_1BAR_7_3)_1BAR_8_4)_1BAR_9_4)_1BAR_10_2)_1BAR_11_2)_1BAR_12_3)_1BAR_13_0)_1BAR_14_0)_1BAR_15_3)_1BAR_16_1)_1BAR_17_2)_1BAR_18_2)_1_idx_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Weight~5_22_0_0)_1BAR_1_1)_1BAR_2_2)_1BAR_3_3)_1BAR_4_4)_1BAR_5_5)_1BAR_6_6)_1BAR_7_7)_1BAR_8_8)_1BAR_9_9)_1BAR_10_10)_1BAR_11_11)_1BAR_12_12)_1BAR_13_13)_1BAR_14_14)_1BAR_15_15)_1BAR_16_16)_1BAR_17_17)_1BAR_18_18)_1_val_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Dest~5_22_0_1)_1BAR_1_3)_1BAR_2_4)_1BAR_3_1)_1BAR_4_1)_1BAR_5_4)_1BAR_6_3)_1BAR_7_4)_1BAR_8_3)_1BAR_9_0)_1BAR_10_0)_1BAR_11_0)_1BAR_12_0)_1BAR_13_2)_1BAR_14_3)_1BAR_15_0)_1BAR_16_2)_1BAR_17_1)_1BAR_18_0)_1_idx_0_1|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ~INFINITY, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~Dest~5_val_0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~source~5, ULTIMATE.start_main_~x~5, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~edgecount~5, ULTIMATE.start_main_~Source~5_val_0, ULTIMATE.start_main_~distance~5_val_0, ULTIMATE.start_main_~Weight~5_val_0, ULTIMATE.start_main_~y~5, ULTIMATE.start_main_~nodecount~5, ULTIMATE.start_main_~j~5] {14#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-05-15 10:56:01,920 INFO L273 TraceCheckUtils]: 1: Hoare triple {14#(<= ULTIMATE.start_main_~i~5 0)} [21] L122-->L150: Formula: (and (= v_ULTIMATE.start_main_~i~5_4 0) (not (< v_ULTIMATE.start_main_~i~5_5 v_ULTIMATE.start_main_~nodecount~5_3))) InVars {ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_3, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_5} OutVars{ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_3, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~5] {18#(<= ULTIMATE.start_main_~nodecount~5 0)} is VALID [2019-05-15 10:56:01,923 INFO L273 TraceCheckUtils]: 2: Hoare triple {18#(<= ULTIMATE.start_main_~nodecount~5 0)} [23] L150-->L141: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~i~5_8 v_ULTIMATE.start_main_~distance~5_idx_0_term_3))) (and v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1 (<= v_ULTIMATE.start_main_~edgecount~5_3 0) (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (< v_ULTIMATE.start_main_~i~5_8 v_ULTIMATE.start_main_~nodecount~5_5) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (<= 0 v_v_ULTIMATE.start_main_~distance~5_5_aux_1) 1 0)) (not (< v_ULTIMATE.start_main_~i~5_10 v_ULTIMATE.start_main_~nodecount~5_5)) (= v_ULTIMATE.start_main_~i~5_8 0) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (or (not .cse0) (= v_ULTIMATE.start_main_~distance~5_val_0_in_2 v_v_ULTIMATE.start_main_~distance~5_5_aux_1)) (or (not v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1) .cse0))) InVars {ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_10, ULTIMATE.start_main_~edgecount~5=v_ULTIMATE.start_main_~edgecount~5_3, ULTIMATE.start_main_~distance~5_idx_0=v_ULTIMATE.start_main_~distance~5_idx_0_term_3, ULTIMATE.start_main_~distance~5_val_0=v_ULTIMATE.start_main_~distance~5_val_0_in_2, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_5, ULTIMATE.start_main_~distance~5_idx_0_bool=v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1} OutVars{ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_8, ULTIMATE.start_main_~edgecount~5=v_ULTIMATE.start_main_~edgecount~5_3, ULTIMATE.start_main_~distance~5_idx_0=v_ULTIMATE.start_main_~distance~5_idx_0_term_3, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~distance~5_val_0=v_ULTIMATE.start_main_~distance~5_val_0_in_2, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_5, ULTIMATE.start_main_~distance~5_idx_0_bool=v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1} AuxVars[v_v_ULTIMATE.start_main_~distance~5_5_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~i~5] {10#false} is VALID [2019-05-15 10:56:01,924 INFO L273 TraceCheckUtils]: 3: Hoare triple {10#false} [25] L141-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10#false} is VALID [2019-05-15 10:56:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:01,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:01,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-15 10:56:01,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-05-15 10:56:01,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:01,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:56:01,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:01,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:56:01,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:56:01,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:56:01,987 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-05-15 10:56:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:02,446 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-05-15 10:56:02,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:56:02,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-05-15 10:56:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-05-15 10:56:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-05-15 10:56:02,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2019-05-15 10:56:02,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:02,647 INFO L225 Difference]: With dead ends: 8 [2019-05-15 10:56:02,648 INFO L226 Difference]: Without dead ends: 7 [2019-05-15 10:56:02,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-05-15 10:56:02,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-05-15 10:56:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-05-15 10:56:02,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:02,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-05-15 10:56:02,681 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-05-15 10:56:02,682 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-05-15 10:56:02,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:02,685 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-05-15 10:56:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-05-15 10:56:02,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:02,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:02,687 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-05-15 10:56:02,688 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-05-15 10:56:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:02,690 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-05-15 10:56:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-05-15 10:56:02,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:02,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:02,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:02,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:56:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-05-15 10:56:02,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-05-15 10:56:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:02,699 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-05-15 10:56:02,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:56:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-05-15 10:56:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-05-15 10:56:02,701 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:02,701 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-05-15 10:56:02,702 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:02,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:02,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1481053576, now seen corresponding path program 1 times [2019-05-15 10:56:02,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:02,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-15 10:56:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:02,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:02,978 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 5 [2019-05-15 10:56:03,039 INFO L273 TraceCheckUtils]: 0: Hoare triple {55#true} [20] ULTIMATE.startENTRY-->L122: Formula: (and (= v_~INFINITY_1 899) (<= 0 v_ULTIMATE.start_main_~edgecount~5_1) (= v_ULTIMATE.start_main_~i~5_1 0) (<= v_ULTIMATE.start_main_~edgecount~5_1 19) (<= v_ULTIMATE.start_main_~nodecount~5_1 2147483647) (<= 0 (+ v_ULTIMATE.start_main_~nodecount~5_1 2147483648)) (= v_ULTIMATE.start_main_~source~5_1 0) (<= v_ULTIMATE.start_main_~nodecount~5_1 4) (or (= 19 |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Weight~5_22_0_0)_1BAR_1_1)_1BAR_2_2)_1BAR_3_3)_1BAR_4_4)_1BAR_5_5)_1BAR_6_6)_1BAR_7_7)_1BAR_8_8)_1BAR_9_9)_1BAR_10_10)_1BAR_11_11)_1BAR_12_12)_1BAR_13_13)_1BAR_14_14)_1BAR_15_15)_1BAR_16_16)_1BAR_17_17)_1BAR_18_18)_1_val_0_1|) (not (= |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Weight~5_22_0_0)_1BAR_1_1)_1BAR_2_2)_1BAR_3_3)_1BAR_4_4)_1BAR_5_5)_1BAR_6_6)_1BAR_7_7)_1BAR_8_8)_1BAR_9_9)_1BAR_10_10)_1BAR_11_11)_1BAR_12_12)_1BAR_13_13)_1BAR_14_14)_1BAR_15_15)_1BAR_16_16)_1BAR_17_17)_1BAR_18_18)_1_idx_0_1| 19))) (<= 0 (+ v_ULTIMATE.start_main_~edgecount~5_1 2147483648)) (or (= 3 |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Source~5_22_0_0)_1BAR_1_4)_1BAR_2_1)_1BAR_3_1)_1BAR_4_0)_1BAR_5_0)_1BAR_6_1)_1BAR_7_3)_1BAR_8_4)_1BAR_9_4)_1BAR_10_2)_1BAR_11_2)_1BAR_12_3)_1BAR_13_0)_1BAR_14_0)_1BAR_15_3)_1BAR_16_1)_1BAR_17_2)_1BAR_18_2)_1_val_0_1|) (not (= |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Source~5_22_0_0)_1BAR_1_4)_1BAR_2_1)_1BAR_3_1)_1BAR_4_0)_1BAR_5_0)_1BAR_6_1)_1BAR_7_3)_1BAR_8_4)_1BAR_9_4)_1BAR_10_2)_1BAR_11_2)_1BAR_12_3)_1BAR_13_0)_1BAR_14_0)_1BAR_15_3)_1BAR_16_1)_1BAR_17_2)_1BAR_18_2)_1_idx_0_1| 19))) (<= v_ULTIMATE.start_main_~edgecount~5_1 2147483647) (or (= 4 |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Dest~5_22_0_1)_1BAR_1_3)_1BAR_2_4)_1BAR_3_1)_1BAR_4_1)_1BAR_5_4)_1BAR_6_3)_1BAR_7_4)_1BAR_8_3)_1BAR_9_0)_1BAR_10_0)_1BAR_11_0)_1BAR_12_0)_1BAR_13_2)_1BAR_14_3)_1BAR_15_0)_1BAR_16_2)_1BAR_17_1)_1BAR_18_0)_1_val_0_1|) (not (= 19 |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Dest~5_22_0_1)_1BAR_1_3)_1BAR_2_4)_1BAR_3_1)_1BAR_4_1)_1BAR_5_4)_1BAR_6_3)_1BAR_7_4)_1BAR_8_3)_1BAR_9_0)_1BAR_10_0)_1BAR_11_0)_1BAR_12_0)_1BAR_13_2)_1BAR_14_3)_1BAR_15_0)_1BAR_16_2)_1BAR_17_1)_1BAR_18_0)_1_idx_0_1|))) (<= 0 v_ULTIMATE.start_main_~nodecount~5_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_~edgecount~5=v_ULTIMATE.start_main_~edgecount~5_1, ULTIMATE.start_main_~distance~5_val_0=v_ULTIMATE.start_main_~distance~5_val_0_out_1, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_1, ~INFINITY=v_~INFINITY_1, ULTIMATE.start_main_~Dest~5_val_0=v_ULTIMATE.start_main_~Dest~5_val_0_out_1, ULTIMATE.start_main_~source~5=v_ULTIMATE.start_main_~source~5_1, ULTIMATE.start_main_~x~5=v_ULTIMATE.start_main_~x~5_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~Source~5_val_0=v_ULTIMATE.start_main_~Source~5_val_0_out_1, ULTIMATE.start_main_~Weight~5_val_0=v_ULTIMATE.start_main_~Weight~5_val_0_out_1, ULTIMATE.start_main_~y~5=v_ULTIMATE.start_main_~y~5_1, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_1} AuxVars[|v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Source~5_22_0_0)_1BAR_1_4)_1BAR_2_1)_1BAR_3_1)_1BAR_4_0)_1BAR_5_0)_1BAR_6_1)_1BAR_7_3)_1BAR_8_4)_1BAR_9_4)_1BAR_10_2)_1BAR_11_2)_1BAR_12_3)_1BAR_13_0)_1BAR_14_0)_1BAR_15_3)_1BAR_16_1)_1BAR_17_2)_1BAR_18_2)_1_val_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Dest~5_22_0_1)_1BAR_1_3)_1BAR_2_4)_1BAR_3_1)_1BAR_4_1)_1BAR_5_4)_1BAR_6_3)_1BAR_7_4)_1BAR_8_3)_1BAR_9_0)_1BAR_10_0)_1BAR_11_0)_1BAR_12_0)_1BAR_13_2)_1BAR_14_3)_1BAR_15_0)_1BAR_16_2)_1BAR_17_1)_1BAR_18_0)_1_val_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Weight~5_22_0_0)_1BAR_1_1)_1BAR_2_2)_1BAR_3_3)_1BAR_4_4)_1BAR_5_5)_1BAR_6_6)_1BAR_7_7)_1BAR_8_8)_1BAR_9_9)_1BAR_10_10)_1BAR_11_11)_1BAR_12_12)_1BAR_13_13)_1BAR_14_14)_1BAR_15_15)_1BAR_16_16)_1BAR_17_17)_1BAR_18_18)_1_idx_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Source~5_22_0_0)_1BAR_1_4)_1BAR_2_1)_1BAR_3_1)_1BAR_4_0)_1BAR_5_0)_1BAR_6_1)_1BAR_7_3)_1BAR_8_4)_1BAR_9_4)_1BAR_10_2)_1BAR_11_2)_1BAR_12_3)_1BAR_13_0)_1BAR_14_0)_1BAR_15_3)_1BAR_16_1)_1BAR_17_2)_1BAR_18_2)_1_idx_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Weight~5_22_0_0)_1BAR_1_1)_1BAR_2_2)_1BAR_3_3)_1BAR_4_4)_1BAR_5_5)_1BAR_6_6)_1BAR_7_7)_1BAR_8_8)_1BAR_9_9)_1BAR_10_10)_1BAR_11_11)_1BAR_12_12)_1BAR_13_13)_1BAR_14_14)_1BAR_15_15)_1BAR_16_16)_1BAR_17_17)_1BAR_18_18)_1_val_0_1|, |v_v_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_BARv_rep_(store_v_ULTIMATE.start_main_~Dest~5_22_0_1)_1BAR_1_3)_1BAR_2_4)_1BAR_3_1)_1BAR_4_1)_1BAR_5_4)_1BAR_6_3)_1BAR_7_4)_1BAR_8_3)_1BAR_9_0)_1BAR_10_0)_1BAR_11_0)_1BAR_12_0)_1BAR_13_2)_1BAR_14_3)_1BAR_15_0)_1BAR_16_2)_1BAR_17_1)_1BAR_18_0)_1_idx_0_1|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ~INFINITY, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~Dest~5_val_0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~source~5, ULTIMATE.start_main_~x~5, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~edgecount~5, ULTIMATE.start_main_~Source~5_val_0, ULTIMATE.start_main_~distance~5_val_0, ULTIMATE.start_main_~Weight~5_val_0, ULTIMATE.start_main_~y~5, ULTIMATE.start_main_~nodecount~5, ULTIMATE.start_main_~j~5] {55#true} is VALID [2019-05-15 10:56:03,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {55#true} [22] L122-->L122: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~i~5_7 v_ULTIMATE.start_main_~distance~5_idx_0_term_2))) (and v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1 (= (+ v_ULTIMATE.start_main_~i~5_7 1) v_ULTIMATE.start_main_~i~5_6) (or (not v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1) .cse0) (or (not .cse0) (= v_ULTIMATE.start_main_~distance~5_val_0_in_1 0)) (< v_ULTIMATE.start_main_~i~5_7 v_ULTIMATE.start_main_~nodecount~5_4) (= v_ULTIMATE.start_main_~source~5_3 v_ULTIMATE.start_main_~i~5_7) (= v_ULTIMATE.start_main_~distance~5_val_0_in_1 v_ULTIMATE.start_main_~distance~5_val_0_out_2))) InVars {ULTIMATE.start_main_~source~5=v_ULTIMATE.start_main_~source~5_3, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_7, ULTIMATE.start_main_~distance~5_idx_0=v_ULTIMATE.start_main_~distance~5_idx_0_term_2, ULTIMATE.start_main_~distance~5_val_0=v_ULTIMATE.start_main_~distance~5_val_0_in_1, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_4, ULTIMATE.start_main_~distance~5_idx_0_bool=v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1} OutVars{ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~source~5=v_ULTIMATE.start_main_~source~5_3, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_6, ULTIMATE.start_main_~distance~5_idx_0=v_ULTIMATE.start_main_~distance~5_idx_0_term_2, ULTIMATE.start_main_~distance~5_val_0=v_ULTIMATE.start_main_~distance~5_val_0_out_2, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_4, ULTIMATE.start_main_~distance~5_idx_0_bool=v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~distance~5_val_0, ULTIMATE.start_main_~i~5] {63#(and ULTIMATE.start_main_~distance~5_idx_0_bool (<= 0 ULTIMATE.start_main_~distance~5_val_0))} is VALID [2019-05-15 10:56:03,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {63#(and ULTIMATE.start_main_~distance~5_idx_0_bool (<= 0 ULTIMATE.start_main_~distance~5_val_0))} [21] L122-->L150: Formula: (and (= v_ULTIMATE.start_main_~i~5_4 0) (not (< v_ULTIMATE.start_main_~i~5_5 v_ULTIMATE.start_main_~nodecount~5_3))) InVars {ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_3, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_5} OutVars{ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_3, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~5] {63#(and ULTIMATE.start_main_~distance~5_idx_0_bool (<= 0 ULTIMATE.start_main_~distance~5_val_0))} is VALID [2019-05-15 10:56:03,044 INFO L273 TraceCheckUtils]: 3: Hoare triple {63#(and ULTIMATE.start_main_~distance~5_idx_0_bool (<= 0 ULTIMATE.start_main_~distance~5_val_0))} [24] L150-->L150: Formula: (and (< v_ULTIMATE.start_main_~i~5_12 v_ULTIMATE.start_main_~nodecount~5_6) (= v_ULTIMATE.start_main_~j~5_3 0) (= (+ v_ULTIMATE.start_main_~i~5_12 1) v_ULTIMATE.start_main_~i~5_11) (not (< v_ULTIMATE.start_main_~j~5_3 v_ULTIMATE.start_main_~edgecount~5_4))) InVars {ULTIMATE.start_main_~edgecount~5=v_ULTIMATE.start_main_~edgecount~5_4, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_6, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_12} OutVars{ULTIMATE.start_main_~edgecount~5=v_ULTIMATE.start_main_~edgecount~5_4, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_6, ULTIMATE.start_main_~j~5=v_ULTIMATE.start_main_~j~5_3, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~j~5, ULTIMATE.start_main_~i~5] {63#(and ULTIMATE.start_main_~distance~5_idx_0_bool (<= 0 ULTIMATE.start_main_~distance~5_val_0))} is VALID [2019-05-15 10:56:03,055 INFO L273 TraceCheckUtils]: 4: Hoare triple {63#(and ULTIMATE.start_main_~distance~5_idx_0_bool (<= 0 ULTIMATE.start_main_~distance~5_val_0))} [23] L150-->L141: Formula: (let ((.cse0 (= v_ULTIMATE.start_main_~i~5_8 v_ULTIMATE.start_main_~distance~5_idx_0_term_3))) (and v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1 (<= v_ULTIMATE.start_main_~edgecount~5_3 0) (= v_ULTIMATE.start___VERIFIER_assert_~cond_1 |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|) (< v_ULTIMATE.start_main_~i~5_8 v_ULTIMATE.start_main_~nodecount~5_5) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond_1| (ite (<= 0 v_v_ULTIMATE.start_main_~distance~5_5_aux_1) 1 0)) (not (< v_ULTIMATE.start_main_~i~5_10 v_ULTIMATE.start_main_~nodecount~5_5)) (= v_ULTIMATE.start_main_~i~5_8 0) (= 0 v_ULTIMATE.start___VERIFIER_assert_~cond_1) (or (not .cse0) (= v_ULTIMATE.start_main_~distance~5_val_0_in_2 v_v_ULTIMATE.start_main_~distance~5_5_aux_1)) (or (not v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1) .cse0))) InVars {ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_10, ULTIMATE.start_main_~edgecount~5=v_ULTIMATE.start_main_~edgecount~5_3, ULTIMATE.start_main_~distance~5_idx_0=v_ULTIMATE.start_main_~distance~5_idx_0_term_3, ULTIMATE.start_main_~distance~5_val_0=v_ULTIMATE.start_main_~distance~5_val_0_in_2, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_5, ULTIMATE.start_main_~distance~5_idx_0_bool=v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1} OutVars{ULTIMATE.start___VERIFIER_assert_~cond=v_ULTIMATE.start___VERIFIER_assert_~cond_1, ULTIMATE.start_main_~i~5=v_ULTIMATE.start_main_~i~5_8, ULTIMATE.start_main_~edgecount~5=v_ULTIMATE.start_main_~edgecount~5_3, ULTIMATE.start_main_~distance~5_idx_0=v_ULTIMATE.start_main_~distance~5_idx_0_term_3, ULTIMATE.start___VERIFIER_assert_#in~cond=|v_ULTIMATE.start___VERIFIER_assert_#in~cond_1|, ULTIMATE.start_main_~distance~5_val_0=v_ULTIMATE.start_main_~distance~5_val_0_in_2, ULTIMATE.start_main_~nodecount~5=v_ULTIMATE.start_main_~nodecount~5_5, ULTIMATE.start_main_~distance~5_idx_0_bool=v_ULTIMATE.start_main_~distance~5_idx_0_term_assigned_1} AuxVars[v_v_ULTIMATE.start_main_~distance~5_5_aux_1] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~i~5] {56#false} is VALID [2019-05-15 10:56:03,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {56#false} [25] L141-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56#false} is VALID [2019-05-15 10:56:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-05-15 10:56:03,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:03,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-15 10:56:03,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-05-15 10:56:03,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:03,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:03,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:03,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:03,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:03,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:03,076 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 3 states. [2019-05-15 10:56:03,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:03,143 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. [2019-05-15 10:56:03,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:03,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-05-15 10:56:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-05-15 10:56:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:03,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-05-15 10:56:03,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 6 transitions. [2019-05-15 10:56:03,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:03,216 INFO L225 Difference]: With dead ends: 5 [2019-05-15 10:56:03,216 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:56:03,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:03,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:56:03,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:56:03,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:03,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:03,218 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:03,218 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:03,219 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:03,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:03,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:03,220 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:03,220 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:03,220 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:03,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:03,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:03,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:03,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:03,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:56:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:56:03,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-05-15 10:56:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:03,222 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:56:03,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:03,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:03,226 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:56:03,227 INFO L202 PluginConnector]: Adding new model eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:03 BasicIcfg [2019-05-15 10:56:03,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:56:03,229 INFO L168 Benchmark]: Toolchain (without parser) took 2625.98 ms. Allocated memory was 133.7 MB in the beginning and 170.9 MB in the end (delta: 37.2 MB). Free memory was 110.4 MB in the beginning and 108.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:03,231 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 112.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:56:03,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.18 ms. Allocated memory is still 133.7 MB. Free memory was 110.4 MB in the beginning and 108.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:03,232 INFO L168 Benchmark]: Boogie Preprocessor took 30.32 ms. Allocated memory is still 133.7 MB. Free memory was 108.7 MB in the beginning and 107.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:03,234 INFO L168 Benchmark]: RCFGBuilder took 619.82 ms. Allocated memory is still 133.7 MB. Free memory was 107.4 MB in the beginning and 90.0 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:03,234 INFO L168 Benchmark]: IcfgTransformer took 154.52 ms. Allocated memory is still 133.7 MB. Free memory was 89.6 MB in the beginning and 81.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:03,235 INFO L168 Benchmark]: TraceAbstraction took 1770.52 ms. Allocated memory was 133.7 MB in the beginning and 170.9 MB in the end (delta: 37.2 MB). Free memory was 81.5 MB in the beginning and 108.7 MB in the end (delta: -27.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:03,241 INFO L337 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: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 112.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.18 ms. Allocated memory is still 133.7 MB. Free memory was 110.4 MB in the beginning and 108.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.32 ms. Allocated memory is still 133.7 MB. Free memory was 108.7 MB in the beginning and 107.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 619.82 ms. Allocated memory is still 133.7 MB. Free memory was 107.4 MB in the beginning and 90.0 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. * IcfgTransformer took 154.52 ms. Allocated memory is still 133.7 MB. Free memory was 89.6 MB in the beginning and 81.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1770.52 ms. Allocated memory was 133.7 MB in the beginning and 170.9 MB in the end (delta: 37.2 MB). Free memory was 81.5 MB in the beginning and 108.7 MB in the end (delta: -27.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 152]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3 SDtfs, 1 SDslu, 5 SDs, 0 SdLazy, 16 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 106 SizeOfPredicates, 8 NumberOfNonLiveVariables, 90 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...