java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test_while_int_true-termination.c_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:22:32,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:22:33,000 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:22:33,012 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:22:33,013 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:22:33,014 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:22:33,015 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:22:33,017 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:22:33,018 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:22:33,019 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:22:33,020 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:22:33,020 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:22:33,021 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:22:33,022 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:22:33,024 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:22:33,024 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:22:33,025 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:22:33,027 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:22:33,029 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:22:33,031 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:22:33,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:22:33,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:22:33,036 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:22:33,036 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:22:33,036 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:22:33,037 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:22:33,041 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:22:33,042 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:22:33,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:22:33,044 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:22:33,045 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:22:33,045 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:22:33,045 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:22:33,049 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:22:33,050 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:22:33,051 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:22:33,051 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:22:33,083 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:22:33,084 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:22:33,086 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:22:33,086 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:22:33,087 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:22:33,087 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:22:33,087 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:22:33,088 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:22:33,088 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:22:33,088 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:22:33,088 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:22:33,088 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:22:33,089 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:22:33,089 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:22:33,089 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:22:33,089 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:22:33,089 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:22:33,089 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:22:33,090 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:22:33,090 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:22:33,090 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:22:33,090 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:22:33,090 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:22:33,092 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:22:33,092 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:22:33,092 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:22:33,093 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:22:33,093 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:22:33,093 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:22:33,093 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:22:33,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:22:33,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:22:33,163 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:22:33,165 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:22:33,165 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:22:33,166 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test_while_int_true-termination.c_false-unreach-call.i [2018-11-14 17:22:33,230 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89fe5db60/a583b624a7c8406a8e94826ad0e46902/FLAG7b608c760 [2018-11-14 17:22:33,647 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:22:33,648 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test_while_int_true-termination.c_false-unreach-call.i [2018-11-14 17:22:33,654 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89fe5db60/a583b624a7c8406a8e94826ad0e46902/FLAG7b608c760 [2018-11-14 17:22:33,669 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89fe5db60/a583b624a7c8406a8e94826ad0e46902 [2018-11-14 17:22:33,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:22:33,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:22:33,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:22:33,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:22:33,692 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:22:33,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:33" (1/1) ... [2018-11-14 17:22:33,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab35aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:33, skipping insertion in model container [2018-11-14 17:22:33,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:33" (1/1) ... [2018-11-14 17:22:33,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:22:33,728 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:22:33,953 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:22:33,957 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:22:33,972 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:22:33,986 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:22:33,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:33 WrapperNode [2018-11-14 17:22:33,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:22:33,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:22:33,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:22:33,988 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:22:33,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:33" (1/1) ... [2018-11-14 17:22:33,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:33" (1/1) ... [2018-11-14 17:22:34,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:33" (1/1) ... [2018-11-14 17:22:34,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:33" (1/1) ... [2018-11-14 17:22:34,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:33" (1/1) ... [2018-11-14 17:22:34,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:33" (1/1) ... [2018-11-14 17:22:34,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:33" (1/1) ... [2018-11-14 17:22:34,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:22:34,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:22:34,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:22:34,018 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:22:34,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:22:34,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:22:34,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:22:34,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-14 17:22:34,146 INFO L138 BoogieDeclarations]: Found implementation of procedure check_error [2018-11-14 17:22:34,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:22:34,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:22:34,146 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-14 17:22:34,146 INFO L130 BoogieDeclarations]: Found specification of procedure check_error [2018-11-14 17:22:34,147 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:22:34,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:22:34,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:22:34,530 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:22:34,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:34 BoogieIcfgContainer [2018-11-14 17:22:34,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:22:34,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:22:34,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:22:34,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:22:34,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:22:33" (1/3) ... [2018-11-14 17:22:34,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ace4b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:34, skipping insertion in model container [2018-11-14 17:22:34,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:33" (2/3) ... [2018-11-14 17:22:34,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ace4b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:34, skipping insertion in model container [2018-11-14 17:22:34,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:34" (3/3) ... [2018-11-14 17:22:34,540 INFO L112 eAbstractionObserver]: Analyzing ICFG test_while_int_true-termination.c_false-unreach-call.i [2018-11-14 17:22:34,549 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:22:34,556 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:22:34,571 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:22:34,604 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:22:34,604 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:22:34,605 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:22:34,605 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:22:34,605 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:22:34,605 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:22:34,605 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:22:34,605 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:22:34,605 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:22:34,626 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-14 17:22:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 17:22:34,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:34,633 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:34,636 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:34,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:34,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1835521858, now seen corresponding path program 1 times [2018-11-14 17:22:34,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:34,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:34,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:34,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:34,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:34,956 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-14 17:22:34,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-14 17:22:34,961 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #36#return; {25#true} is VALID [2018-11-14 17:22:34,961 INFO L256 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret1 := main(); {25#true} is VALID [2018-11-14 17:22:34,963 INFO L273 TraceCheckUtils]: 4: Hoare triple {25#true} ~i~0 := 0; {27#(<= main_~i~0 0)} is VALID [2018-11-14 17:22:34,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#(<= main_~i~0 0)} assume true; {27#(<= main_~i~0 0)} is VALID [2018-11-14 17:22:34,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#(<= main_~i~0 0)} assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {28#(<= main_~i~0 1)} is VALID [2018-11-14 17:22:34,968 INFO L256 TraceCheckUtils]: 7: Hoare triple {28#(<= main_~i~0 1)} call check_error((if ~i~0 != 3 then 1 else 0)); {29#(= |check_error_#in~b| 1)} is VALID [2018-11-14 17:22:34,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#(= |check_error_#in~b| 1)} ~b := #in~b; {30#(= check_error_~b 1)} is VALID [2018-11-14 17:22:34,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#(= check_error_~b 1)} assume !(~b != 0); {26#false} is VALID [2018-11-14 17:22:34,974 INFO L256 TraceCheckUtils]: 10: Hoare triple {26#false} call __blast_assert(); {26#false} is VALID [2018-11-14 17:22:34,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-14 17:22:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:34,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:34,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:22:34,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 17:22:34,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:34,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:22:35,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:35,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:22:35,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:22:35,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:22:35,093 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 6 states. [2018-11-14 17:22:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:35,815 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2018-11-14 17:22:35,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:22:35,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 17:22:35,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:22:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2018-11-14 17:22:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:22:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2018-11-14 17:22:35,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2018-11-14 17:22:35,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:35,970 INFO L225 Difference]: With dead ends: 46 [2018-11-14 17:22:35,970 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 17:22:35,974 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:22:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 17:22:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-14 17:22:36,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:36,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 22 states. [2018-11-14 17:22:36,046 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 22 states. [2018-11-14 17:22:36,046 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 22 states. [2018-11-14 17:22:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:36,051 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:22:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:22:36,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:36,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:36,053 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 24 states. [2018-11-14 17:22:36,053 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 24 states. [2018-11-14 17:22:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:36,057 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:22:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:22:36,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:36,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:36,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:36,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:22:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-14 17:22:36,064 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 12 [2018-11-14 17:22:36,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:36,064 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-14 17:22:36,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:22:36,065 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:22:36,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:22:36,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:36,066 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:36,066 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:36,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:36,067 INFO L82 PathProgramCache]: Analyzing trace with hash -932126179, now seen corresponding path program 1 times [2018-11-14 17:22:36,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:36,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:36,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:36,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:36,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:36,546 INFO L256 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {181#true} is VALID [2018-11-14 17:22:36,547 INFO L273 TraceCheckUtils]: 1: Hoare triple {181#true} assume true; {181#true} is VALID [2018-11-14 17:22:36,547 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {181#true} {181#true} #36#return; {181#true} is VALID [2018-11-14 17:22:36,547 INFO L256 TraceCheckUtils]: 3: Hoare triple {181#true} call #t~ret1 := main(); {181#true} is VALID [2018-11-14 17:22:36,548 INFO L273 TraceCheckUtils]: 4: Hoare triple {181#true} ~i~0 := 0; {183#(<= main_~i~0 0)} is VALID [2018-11-14 17:22:36,549 INFO L273 TraceCheckUtils]: 5: Hoare triple {183#(<= main_~i~0 0)} assume true; {183#(<= main_~i~0 0)} is VALID [2018-11-14 17:22:36,550 INFO L273 TraceCheckUtils]: 6: Hoare triple {183#(<= main_~i~0 0)} assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {184#(<= main_~i~0 1)} is VALID [2018-11-14 17:22:36,550 INFO L256 TraceCheckUtils]: 7: Hoare triple {184#(<= main_~i~0 1)} call check_error((if ~i~0 != 3 then 1 else 0)); {181#true} is VALID [2018-11-14 17:22:36,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {181#true} ~b := #in~b; {185#(= check_error_~b |check_error_#in~b|)} is VALID [2018-11-14 17:22:36,577 INFO L273 TraceCheckUtils]: 9: Hoare triple {185#(= check_error_~b |check_error_#in~b|)} assume ~b != 0; {186#(not (= 0 |check_error_#in~b|))} is VALID [2018-11-14 17:22:36,578 INFO L273 TraceCheckUtils]: 10: Hoare triple {186#(not (= 0 |check_error_#in~b|))} assume true; {186#(not (= 0 |check_error_#in~b|))} is VALID [2018-11-14 17:22:36,580 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {186#(not (= 0 |check_error_#in~b|))} {184#(<= main_~i~0 1)} #40#return; {184#(<= main_~i~0 1)} is VALID [2018-11-14 17:22:36,580 INFO L273 TraceCheckUtils]: 12: Hoare triple {184#(<= main_~i~0 1)} assume true; {184#(<= main_~i~0 1)} is VALID [2018-11-14 17:22:36,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {184#(<= main_~i~0 1)} assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {187#(<= main_~i~0 2)} is VALID [2018-11-14 17:22:36,582 INFO L256 TraceCheckUtils]: 14: Hoare triple {187#(<= main_~i~0 2)} call check_error((if ~i~0 != 3 then 1 else 0)); {186#(not (= 0 |check_error_#in~b|))} is VALID [2018-11-14 17:22:36,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {186#(not (= 0 |check_error_#in~b|))} ~b := #in~b; {188#(not (= 0 check_error_~b))} is VALID [2018-11-14 17:22:36,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {188#(not (= 0 check_error_~b))} assume !(~b != 0); {182#false} is VALID [2018-11-14 17:22:36,587 INFO L256 TraceCheckUtils]: 17: Hoare triple {182#false} call __blast_assert(); {182#false} is VALID [2018-11-14 17:22:36,587 INFO L273 TraceCheckUtils]: 18: Hoare triple {182#false} assume !false; {182#false} is VALID [2018-11-14 17:22:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:36,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:22:36,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:22:36,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:36,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:22:37,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {181#true} is VALID [2018-11-14 17:22:37,027 INFO L273 TraceCheckUtils]: 1: Hoare triple {181#true} assume true; {181#true} is VALID [2018-11-14 17:22:37,027 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {181#true} {181#true} #36#return; {181#true} is VALID [2018-11-14 17:22:37,027 INFO L256 TraceCheckUtils]: 3: Hoare triple {181#true} call #t~ret1 := main(); {181#true} is VALID [2018-11-14 17:22:37,028 INFO L273 TraceCheckUtils]: 4: Hoare triple {181#true} ~i~0 := 0; {183#(<= main_~i~0 0)} is VALID [2018-11-14 17:22:37,029 INFO L273 TraceCheckUtils]: 5: Hoare triple {183#(<= main_~i~0 0)} assume true; {183#(<= main_~i~0 0)} is VALID [2018-11-14 17:22:37,029 INFO L273 TraceCheckUtils]: 6: Hoare triple {183#(<= main_~i~0 0)} assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {184#(<= main_~i~0 1)} is VALID [2018-11-14 17:22:37,030 INFO L256 TraceCheckUtils]: 7: Hoare triple {184#(<= main_~i~0 1)} call check_error((if ~i~0 != 3 then 1 else 0)); {181#true} is VALID [2018-11-14 17:22:37,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {181#true} ~b := #in~b; {181#true} is VALID [2018-11-14 17:22:37,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {181#true} assume ~b != 0; {181#true} is VALID [2018-11-14 17:22:37,030 INFO L273 TraceCheckUtils]: 10: Hoare triple {181#true} assume true; {181#true} is VALID [2018-11-14 17:22:37,032 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {181#true} {184#(<= main_~i~0 1)} #40#return; {184#(<= main_~i~0 1)} is VALID [2018-11-14 17:22:37,036 INFO L273 TraceCheckUtils]: 12: Hoare triple {184#(<= main_~i~0 1)} assume true; {184#(<= main_~i~0 1)} is VALID [2018-11-14 17:22:37,037 INFO L273 TraceCheckUtils]: 13: Hoare triple {184#(<= main_~i~0 1)} assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {187#(<= main_~i~0 2)} is VALID [2018-11-14 17:22:37,038 INFO L256 TraceCheckUtils]: 14: Hoare triple {187#(<= main_~i~0 2)} call check_error((if ~i~0 != 3 then 1 else 0)); {234#(= |check_error_#in~b| 1)} is VALID [2018-11-14 17:22:37,039 INFO L273 TraceCheckUtils]: 15: Hoare triple {234#(= |check_error_#in~b| 1)} ~b := #in~b; {238#(= 1 check_error_~b)} is VALID [2018-11-14 17:22:37,039 INFO L273 TraceCheckUtils]: 16: Hoare triple {238#(= 1 check_error_~b)} assume !(~b != 0); {182#false} is VALID [2018-11-14 17:22:37,040 INFO L256 TraceCheckUtils]: 17: Hoare triple {182#false} call __blast_assert(); {182#false} is VALID [2018-11-14 17:22:37,040 INFO L273 TraceCheckUtils]: 18: Hoare triple {182#false} assume !false; {182#false} is VALID [2018-11-14 17:22:37,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:37,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:22:37,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2018-11-14 17:22:37,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-11-14 17:22:37,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:37,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:22:37,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:37,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:22:37,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:22:37,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:22:37,221 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 10 states. [2018-11-14 17:22:37,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:37,718 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 17:22:37,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:22:37,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-11-14 17:22:37,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:37,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:22:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2018-11-14 17:22:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:22:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2018-11-14 17:22:37,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 31 transitions. [2018-11-14 17:22:37,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:37,766 INFO L225 Difference]: With dead ends: 34 [2018-11-14 17:22:37,767 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 17:22:37,768 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:22:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 17:22:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-14 17:22:37,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:37,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2018-11-14 17:22:37,798 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2018-11-14 17:22:37,799 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2018-11-14 17:22:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:37,801 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-14 17:22:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-14 17:22:37,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:37,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:37,803 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2018-11-14 17:22:37,803 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2018-11-14 17:22:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:37,806 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-14 17:22:37,806 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-14 17:22:37,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:37,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:37,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:37,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:22:37,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-14 17:22:37,810 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 19 [2018-11-14 17:22:37,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:37,811 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-14 17:22:37,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:22:37,811 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-14 17:22:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 17:22:37,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:37,813 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:37,813 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:37,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:37,813 INFO L82 PathProgramCache]: Analyzing trace with hash 362131422, now seen corresponding path program 2 times [2018-11-14 17:22:37,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:37,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:37,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:37,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:37,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:22:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:22:37,858 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 17:22:37,884 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:22:37,884 WARN L170 areAnnotationChecker]: check_errorENTRY has no Hoare annotation [2018-11-14 17:22:37,884 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:22:37,884 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:22:37,884 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-14 17:22:37,885 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-14 17:22:37,885 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 17:22:37,885 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:22:37,885 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 17:22:37,885 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 17:22:37,885 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:22:37,885 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:22:37,886 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2018-11-14 17:22:37,886 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-14 17:22:37,886 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-14 17:22:37,886 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2018-11-14 17:22:37,886 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-14 17:22:37,886 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-14 17:22:37,886 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:22:37,887 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2018-11-14 17:22:37,887 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-14 17:22:37,887 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-14 17:22:37,887 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2018-11-14 17:22:37,887 WARN L170 areAnnotationChecker]: check_errorEXIT has no Hoare annotation [2018-11-14 17:22:37,887 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-14 17:22:37,887 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-14 17:22:37,888 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:22:37,888 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:22:37,888 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:22:37,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:22:37 BoogieIcfgContainer [2018-11-14 17:22:37,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:22:37,893 INFO L168 Benchmark]: Toolchain (without parser) took 4207.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -615.0 MB). Peak memory consumption was 125.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:37,895 INFO L168 Benchmark]: CDTParser took 0.20 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-14 17:22:37,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:37,899 INFO L168 Benchmark]: Boogie Preprocessor took 29.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:22:37,900 INFO L168 Benchmark]: RCFGBuilder took 513.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:37,901 INFO L168 Benchmark]: TraceAbstraction took 3359.76 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: 165.6 MB). Peak memory consumption was 165.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:37,905 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 299.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.83 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 513.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3359.76 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: 165.6 MB). Peak memory consumption was 165.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L23] int i=0; VAL [i=0] [L24] COND TRUE i<5 [L25] i++ VAL [i=1] [L29] CALL check_error(i!=3) VAL [\old(b)=1] [L18] COND TRUE, RET (b) ? (0) : __blast_assert () VAL [\old(b)=1, b=1] [L29] check_error(i!=3) VAL [i=1] [L24] COND TRUE i<5 [L25] i++ VAL [i=2] [L29] CALL check_error(i!=3) VAL [\old(b)=1] [L18] COND TRUE, RET (b) ? (0) : __blast_assert () VAL [\old(b)=1, b=1] [L29] check_error(i!=3) VAL [i=2] [L24] COND TRUE i<5 [L25] i++ VAL [i=3] [L29] CALL check_error(i!=3) VAL [\old(b)=0] [L18] COND FALSE !((b) ? (0) : __blast_assert ()) VAL [\old(b)=0, b=0] [L18] CALL __blast_assert () [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 22 locations, 1 error locations. UNSAFE Result, 3.2s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27 SDtfs, 24 SDslu, 117 SDs, 0 SdLazy, 67 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 1635 SizeOfPredicates, 2 NumberOfNonLiveVariables, 41 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 3/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...