java -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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:38:26,648 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:38:26,650 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:38:26,668 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:38:26,668 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:38:26,670 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:38:26,671 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:38:26,674 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:38:26,676 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:38:26,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:38:26,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:38:26,683 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:38:26,684 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:38:26,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:38:26,695 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:38:26,696 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:38:26,697 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:38:26,699 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:38:26,701 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:38:26,704 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:38:26,707 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:38:26,708 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:38:26,713 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:38:26,714 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:38:26,714 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:38:26,715 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:38:26,716 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:38:26,719 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:38:26,721 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:38:26,722 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:38:26,722 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:38:26,723 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:38:26,723 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:38:26,723 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:38:26,726 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:38:26,729 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:38:26,729 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:38:26,756 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:38:26,756 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:38:26,757 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:38:26,760 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:38:26,761 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:38:26,761 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:38:26,762 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:38:26,762 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:38:26,762 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:38:26,763 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:38:26,763 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:38:26,764 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:38:26,764 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:38:26,764 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:38:26,764 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:38:26,764 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:38:26,765 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:38:26,765 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:38:26,765 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:38:26,765 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:38:26,765 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:38:26,766 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:38:26,766 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:38:26,766 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:38:26,766 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:38:26,768 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:38:26,768 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:38:26,768 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:38:26,768 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:38:26,768 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:38:26,769 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:38:26,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:38:26,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:38:26,857 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:38:26,859 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:38:26,859 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:38:26,860 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl [2018-10-01 00:38:26,860 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl' [2018-10-01 00:38:26,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:38:26,923 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:38:26,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:38:26,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:38:26,925 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:38:26,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:26" (1/1) ... [2018-10-01 00:38:26,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:26" (1/1) ... [2018-10-01 00:38:26,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:38:26,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:38:26,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:38:26,964 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:38:26,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:26" (1/1) ... [2018-10-01 00:38:26,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:26" (1/1) ... [2018-10-01 00:38:26,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:26" (1/1) ... [2018-10-01 00:38:26,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:26" (1/1) ... [2018-10-01 00:38:26,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:26" (1/1) ... [2018-10-01 00:38:26,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:26" (1/1) ... [2018-10-01 00:38:26,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:26" (1/1) ... [2018-10-01 00:38:26,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:38:26,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:38:26,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:38:26,986 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:38:26,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:26" (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-10-01 00:38:27,046 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-01 00:38:27,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:38:27,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:38:27,219 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:38:27,219 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:38:27 BoogieIcfgContainer [2018-10-01 00:38:27,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:38:27,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:38:27,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:38:27,223 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:38:27,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:26" (1/2) ... [2018-10-01 00:38:27,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166604c9 and model type num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:38:27, skipping insertion in model container [2018-10-01 00:38:27,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:38:27" (2/2) ... [2018-10-01 00:38:27,227 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl [2018-10-01 00:38:27,237 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:38:27,244 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:38:27,294 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:38:27,295 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:38:27,295 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:38:27,295 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:38:27,296 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:38:27,296 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:38:27,296 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:38:27,296 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:38:27,296 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:38:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-01 00:38:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-01 00:38:27,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:27,318 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-01 00:38:27,319 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:27,326 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:27,326 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-10-01 00:38:27,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:27,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:27,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:27,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:27,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:27,508 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:38:27,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:38:27,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:38:27,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:38:27,524 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:27,526 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-01 00:38:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:27,667 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-10-01 00:38:27,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:38:27,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-01 00:38:27,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:27,681 INFO L225 Difference]: With dead ends: 9 [2018-10-01 00:38:27,681 INFO L226 Difference]: Without dead ends: 5 [2018-10-01 00:38:27,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:38:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-01 00:38:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-01 00:38:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-01 00:38:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-01 00:38:27,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-01 00:38:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:27,724 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-01 00:38:27,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:38:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-01 00:38:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-01 00:38:27,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:27,725 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-01 00:38:27,725 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:27,725 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:27,725 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-10-01 00:38:27,726 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:27,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:27,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:27,839 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:27,839 INFO L227 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-10-01 00:38:27,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:27,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:27,937 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:27,937 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-01 00:38:27,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:38:27,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:38:27,938 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:27,938 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-10-01 00:38:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:28,047 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-01 00:38:28,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:38:28,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-10-01 00:38:28,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:28,050 INFO L225 Difference]: With dead ends: 8 [2018-10-01 00:38:28,050 INFO L226 Difference]: Without dead ends: 6 [2018-10-01 00:38:28,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:38:28,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-01 00:38:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-01 00:38:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-01 00:38:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-01 00:38:28,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-01 00:38:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:28,056 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-01 00:38:28,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:38:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-01 00:38:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:38:28,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:28,057 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-10-01 00:38:28,057 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:28,058 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:28,058 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-10-01 00:38:28,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:28,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:28,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:28,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:28,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:28,163 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:28,163 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:28,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:38:28,226 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:38:28,226 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:28,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:28,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:28,268 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:28,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-01 00:38:28,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:38:28,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:38:28,269 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:28,269 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-10-01 00:38:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:28,417 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-01 00:38:28,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:38:28,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-01 00:38:28,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:28,418 INFO L225 Difference]: With dead ends: 9 [2018-10-01 00:38:28,418 INFO L226 Difference]: Without dead ends: 7 [2018-10-01 00:38:28,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:38:28,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-01 00:38:28,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-01 00:38:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-01 00:38:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-01 00:38:28,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-01 00:38:28,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:28,425 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-01 00:38:28,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:38:28,425 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-01 00:38:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 00:38:28,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:28,426 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-10-01 00:38:28,427 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:28,427 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:28,427 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-10-01 00:38:28,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:28,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:28,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:28,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:28,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:28,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:28,717 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:28,717 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:28,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:38:28,770 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-01 00:38:28,770 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:28,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:28,842 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:28,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-01 00:38:28,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:38:28,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:38:28,843 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:28,843 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-10-01 00:38:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:28,917 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-01 00:38:28,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:38:28,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-10-01 00:38:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:28,920 INFO L225 Difference]: With dead ends: 10 [2018-10-01 00:38:28,921 INFO L226 Difference]: Without dead ends: 8 [2018-10-01 00:38:28,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:38:28,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-01 00:38:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-01 00:38:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-01 00:38:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-01 00:38:28,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-01 00:38:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:28,925 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-01 00:38:28,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:38:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-01 00:38:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 00:38:28,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:28,926 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-10-01 00:38:28,927 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:28,927 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:28,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-10-01 00:38:28,927 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:28,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:28,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:28,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:28,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:29,119 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:29,119 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:29,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:38:29,143 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:38:29,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:29,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:29,202 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:29,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-01 00:38:29,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:38:29,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:38:29,203 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:29,203 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-10-01 00:38:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:29,333 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-01 00:38:29,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:38:29,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-01 00:38:29,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:29,336 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:38:29,336 INFO L226 Difference]: Without dead ends: 9 [2018-10-01 00:38:29,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:38:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-01 00:38:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-01 00:38:29,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-01 00:38:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-01 00:38:29,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-01 00:38:29,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:29,339 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-01 00:38:29,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:38:29,340 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-01 00:38:29,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:38:29,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:29,340 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-10-01 00:38:29,341 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:29,341 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:29,341 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-10-01 00:38:29,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:29,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:29,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:29,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:29,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:29,510 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:29,510 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:29,520 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:38:29,553 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-01 00:38:29,553 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:29,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:29,606 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:29,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:38:29,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:38:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:38:29,607 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:29,607 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-10-01 00:38:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:30,139 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-01 00:38:30,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:38:30,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:38:30,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:30,142 INFO L225 Difference]: With dead ends: 12 [2018-10-01 00:38:30,142 INFO L226 Difference]: Without dead ends: 10 [2018-10-01 00:38:30,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:38:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-01 00:38:30,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-01 00:38:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-01 00:38:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-01 00:38:30,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-01 00:38:30,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:30,146 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-01 00:38:30,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:38:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-01 00:38:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:38:30,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:30,147 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-10-01 00:38:30,148 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:30,148 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:30,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-10-01 00:38:30,148 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:30,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:30,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:30,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:30,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:30,292 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:30,292 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:30,311 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:38:30,347 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-01 00:38:30,347 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:30,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:30,406 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:30,406 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-01 00:38:30,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:38:30,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:38:30,407 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:30,407 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-10-01 00:38:30,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:30,515 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-01 00:38:30,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:38:30,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-01 00:38:30,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:30,516 INFO L225 Difference]: With dead ends: 13 [2018-10-01 00:38:30,516 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:38:30,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:38:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:38:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-01 00:38:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-01 00:38:30,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-01 00:38:30,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-01 00:38:30,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:30,523 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-01 00:38:30,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:38:30,524 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-01 00:38:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:38:30,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:30,524 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-10-01 00:38:30,525 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:30,525 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:30,525 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-10-01 00:38:30,525 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:30,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:30,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:30,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:30,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:30,668 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:30,669 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:30,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:30,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:30,766 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:30,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-01 00:38:30,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:38:30,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:38:30,767 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:30,767 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-10-01 00:38:30,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:30,865 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-01 00:38:30,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:38:30,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-10-01 00:38:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:30,867 INFO L225 Difference]: With dead ends: 14 [2018-10-01 00:38:30,867 INFO L226 Difference]: Without dead ends: 12 [2018-10-01 00:38:30,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:38:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-01 00:38:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-01 00:38:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-01 00:38:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-01 00:38:30,872 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-01 00:38:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:30,872 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-01 00:38:30,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:38:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-01 00:38:30,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 00:38:30,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:30,873 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-10-01 00:38:30,873 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:30,873 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:30,874 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-10-01 00:38:30,874 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:30,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:30,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:30,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:30,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-01 00:38:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-01 00:38:30,973 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-01 00:38:31,011 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:38:31 BoogieIcfgContainer [2018-10-01 00:38:31,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:38:31,014 INFO L168 Benchmark]: Toolchain (without parser) took 4092.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 235.3 MB). Peak memory consumption was 235.3 MB. Max. memory is 7.1 GB. [2018-10-01 00:38:31,016 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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-10-01 00:38:31,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.62 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-10-01 00:38:31,018 INFO L168 Benchmark]: Boogie Preprocessor took 21.69 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-10-01 00:38:31,019 INFO L168 Benchmark]: RCFGBuilder took 234.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:38:31,020 INFO L168 Benchmark]: TraceAbstraction took 3792.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 214.2 MB). Peak memory consumption was 214.2 MB. Max. memory is 7.1 GB. [2018-10-01 00:38:31,027 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 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. * Boogie Procedure Inliner took 38.62 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. * Boogie Preprocessor took 21.69 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. * RCFGBuilder took 234.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3792.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 214.2 MB). Peak memory consumption was 214.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 46]: assertion can be violated assertion can be violated We found a FailurePath: [L14] havoc main_#res; [L15] havoc main_~bit~5, main_~c~4, main_~x~4, main_~y~4, main_~i~5; [L16] havoc main_~x~4; [L17] havoc main_~y~4; [L18] havoc main_~c~4; [L19] main_~x~4 := 37; [L20] main_~y~4 := 0; [L21] main_~c~4 := 0; VAL [main_~c~4=0, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=1, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=2, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=3, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=4, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=5, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=6, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=7, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=8, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L28] assume !(main_~c~4 < 8) && main_~c~4 < 256; [L29] assume (((main_~y~4 < 256 && 0 <= main_~y~4) && 0 <= main_~x~4) && main_~x~4 < 256) && !(main_~x~4 == main_~y~4); [L30] __VERIFIER_assert_#in~cond := 0; [L31] havoc __VERIFIER_assert_~cond; [L32] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L33] assume __VERIFIER_assert_~cond == 0; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=767, main_~c~4=8, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L46] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=767, main_~c~4=8, main_~i~5=-512, main_~x~4=37, main_~y~4=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 3.7s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 0 SDslu, 33 SDs, 0 SdLazy, 77 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=8, 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 1520 SizeOfPredicates, 7 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 0/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-38-31-045.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-38-31-045.csv Received shutdown request...