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/20170304-DifficultPathPrograms/num_conversion_1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:45:49,679 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:45:49,681 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:45:49,693 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:45:49,693 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:45:49,695 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:45:49,696 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:45:49,698 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:45:49,700 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:45:49,701 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:45:49,701 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:45:49,702 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:45:49,703 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:45:49,704 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:45:49,705 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:45:49,706 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:45:49,707 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:45:49,709 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:45:49,711 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:45:49,713 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:45:49,714 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:45:49,715 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:45:49,718 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:45:49,718 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:45:49,719 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:45:49,720 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:45:49,721 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:45:49,722 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:45:49,723 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:45:49,724 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:45:49,724 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:45:49,725 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:45:49,725 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:45:49,725 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:45:49,727 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:45:49,727 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:45:49,728 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-04 09:45:49,744 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:45:49,744 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:45:49,745 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:45:49,745 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:45:49,746 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:45:49,746 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:45:49,746 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:45:49,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:45:49,747 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:45:49,747 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:45:49,747 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:45:49,747 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:45:49,747 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:45:49,747 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:45:49,748 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:45:49,748 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:45:49,748 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:45:49,748 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:45:49,748 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:45:49,749 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:45:49,749 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:45:49,749 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:45:49,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:45:49,749 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:45:49,750 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:45:49,750 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:45:49,750 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:45:49,750 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:45:49,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:45:49,751 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:45:49,751 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:45:49,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:45:49,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:45:49,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:45:49,829 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:45:49,829 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:45:49,830 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_1.i_3.bpl [2018-10-04 09:45:49,830 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_1.i_3.bpl' [2018-10-04 09:45:49,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:45:49,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:45:49,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:45:49,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:45:49,883 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:45:49,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:45:49" (1/1) ... [2018-10-04 09:45:49,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:45:49" (1/1) ... [2018-10-04 09:45:49,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:45:49,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:45:49,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:45:49,927 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:45:49,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:45:49" (1/1) ... [2018-10-04 09:45:49,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:45:49" (1/1) ... [2018-10-04 09:45:49,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:45:49" (1/1) ... [2018-10-04 09:45:49,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:45:49" (1/1) ... [2018-10-04 09:45:49,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:45:49" (1/1) ... [2018-10-04 09:45:49,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:45:49" (1/1) ... [2018-10-04 09:45:49,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:45:49" (1/1) ... [2018-10-04 09:45:49,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:45:49,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:45:49,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:45:49,950 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:45:49,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:45:49" (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-04 09:45:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:45:50,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:45:50,212 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:45:50,213 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:45:50 BoogieIcfgContainer [2018-10-04 09:45:50,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:45:50,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:45:50,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:45:50,217 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:45:50,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:45:49" (1/2) ... [2018-10-04 09:45:50,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f754c1d and model type num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:45:50, skipping insertion in model container [2018-10-04 09:45:50,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:45:50" (2/2) ... [2018-10-04 09:45:50,221 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.i_3.bpl [2018-10-04 09:45:50,231 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:45:50,239 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:45:50,287 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:45:50,288 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:45:50,288 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:45:50,289 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:45:50,289 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:45:50,289 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:45:50,289 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:45:50,289 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:45:50,290 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:45:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-04 09:45:50,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 09:45:50,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:45:50,312 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 09:45:50,314 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:45:50,323 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:45:50,323 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-04 09:45:50,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:45:50,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:45:50,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:50,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:45:50,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:45:50,496 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-04 09:45:50,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:45:50,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:45:50,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:45:50,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:45:50,519 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:45:50,520 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-04 09:45:50,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:45:50,572 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-04 09:45:50,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:45:50,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-04 09:45:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:45:50,590 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:45:50,596 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 09:45:50,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:45:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 09:45:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 09:45:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 09:45:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 09:45:50,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-04 09:45:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:45:50,633 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 09:45:50,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:45:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 09:45:50,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 09:45:50,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:45:50,636 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-10-04 09:45:50,636 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:45:50,636 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:45:50,637 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-10-04 09:45:50,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:45:50,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:45:50,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:50,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:45:50,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:45:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:45:50,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:45:50,838 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-04 09:45:50,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:45:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:45:50,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:45:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:45:51,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:45:51,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-10-04 09:45:51,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:45:51,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:45:51,041 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:45:51,041 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-10-04 09:45:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:45:51,113 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 09:45:51,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:45:51,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-10-04 09:45:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:45:51,116 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:45:51,116 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 09:45:51,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 3 [2018-10-04 09:45:51,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 09:45:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 09:45:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 09:45:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 09:45:51,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-04 09:45:51,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:45:51,123 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 09:45:51,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:45:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 09:45:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:45:51,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:45:51,124 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-10-04 09:45:51,124 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:45:51,124 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:45:51,125 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-10-04 09:45:51,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:45:51,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:45:51,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:51,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:45:51,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:45:51,250 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-04 09:45:51,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:45:51,251 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) [2018-10-04 09:45:51,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:45:51,311 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:45:51,311 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:45:51,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:45:51,421 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-04 09:45:51,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:45:51,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-04 09:45:51,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:45:51,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:45:51,442 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:45:51,442 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-10-04 09:45:51,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:45:51,546 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 09:45:51,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:45:51,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 09:45:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:45:51,547 INFO L225 Difference]: With dead ends: 13 [2018-10-04 09:45:51,547 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 09:45:51,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 09:45:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 09:45:51,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 09:45:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 09:45:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 09:45:51,553 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-04 09:45:51,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:45:51,553 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 09:45:51,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:45:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 09:45:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 09:45:51,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:45:51,555 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-10-04 09:45:51,555 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:45:51,555 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:45:51,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-10-04 09:45:51,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:45:51,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:45:51,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:51,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:45:51,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:45:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:45:51,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:45:51,897 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-04 09:45:51,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:45:51,944 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 09:45:51,945 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:45:51,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:45:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:45:52,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:45:52,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-10-04 09:45:52,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:45:52,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:45:52,182 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:45:52,182 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2018-10-04 09:45:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:45:52,298 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 09:45:52,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:45:52,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-10-04 09:45:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:45:52,300 INFO L225 Difference]: With dead ends: 15 [2018-10-04 09:45:52,301 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 09:45:52,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 7 [2018-10-04 09:45:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 09:45:52,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 09:45:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 09:45:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 09:45:52,307 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-04 09:45:52,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:45:52,308 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 09:45:52,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:45:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 09:45:52,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:45:52,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:45:52,309 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-10-04 09:45:52,310 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:45:52,310 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:45:52,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-10-04 09:45:52,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:45:52,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:45:52,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:52,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:45:52,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:45:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:45:52,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:45:52,600 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-04 09:45:52,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:45:52,647 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:45:52,647 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:45:52,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:45:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:45:52,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:45:52,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-10-04 09:45:52,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:45:52,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:45:52,904 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:45:52,904 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-10-04 09:45:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:45:53,108 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 09:45:53,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:45:53,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-10-04 09:45:53,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:45:53,110 INFO L225 Difference]: With dead ends: 17 [2018-10-04 09:45:53,110 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 09:45:53,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 9 [2018-10-04 09:45:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 09:45:53,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 09:45:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 09:45:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 09:45:53,117 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-04 09:45:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:45:53,118 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 09:45:53,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:45:53,118 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 09:45:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:45:53,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:45:53,119 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-10-04 09:45:53,119 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:45:53,120 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:45:53,120 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-10-04 09:45:53,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:45:53,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:45:53,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:53,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:45:53,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:45:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:45:53,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:45:53,576 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-04 09:45:53,588 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:45:53,626 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 09:45:53,626 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:45:53,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:45:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:45:54,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:45:54,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-10-04 09:45:54,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 09:45:54,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 09:45:54,116 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:45:54,117 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-10-04 09:45:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:45:56,329 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 09:45:56,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:45:56,330 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-04 09:45:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:45:56,332 INFO L225 Difference]: With dead ends: 19 [2018-10-04 09:45:56,332 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 09:45:56,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime 11 [2018-10-04 09:45:56,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 09:45:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 09:45:56,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 09:45:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 09:45:56,340 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-04 09:45:56,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:45:56,341 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 09:45:56,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 09:45:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 09:45:56,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:45:56,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:45:56,342 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-10-04 09:45:56,342 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:45:56,342 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:45:56,343 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-10-04 09:45:56,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:45:56,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:45:56,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:56,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:45:56,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:45:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:45:56,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:45:56,570 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-04 09:45:56,584 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:45:56,627 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:45:56,627 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:45:56,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:45:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:45:57,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:45:57,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-10-04 09:45:57,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 09:45:57,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 09:45:57,170 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:45:57,171 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2018-10-04 09:45:57,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:45:57,721 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 09:45:57,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:45:57,722 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-10-04 09:45:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:45:57,723 INFO L225 Difference]: With dead ends: 21 [2018-10-04 09:45:57,724 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 09:45:57,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 13 [2018-10-04 09:45:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 09:45:57,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 09:45:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 09:45:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 09:45:57,742 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-04 09:45:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:45:57,742 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 09:45:57,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 09:45:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 09:45:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:45:57,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:45:57,743 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-10-04 09:45:57,743 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:45:57,744 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:45:57,744 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-10-04 09:45:57,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:45:57,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:45:57,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:57,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:45:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:45:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:45:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:45:58,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:45:58,147 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-04 09:45:58,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:45:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:45:58,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:45:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:45:59,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:45:59,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-10-04 09:45:59,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 09:45:59,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 09:45:59,120 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:45:59,120 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2018-10-04 09:46:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:00,103 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 09:46:00,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:46:00,106 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-10-04 09:46:00,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:00,107 INFO L225 Difference]: With dead ends: 23 [2018-10-04 09:46:00,107 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 09:46:00,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 15 [2018-10-04 09:46:00,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 09:46:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 09:46:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 09:46:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 09:46:00,119 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-04 09:46:00,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:00,119 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 09:46:00,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 09:46:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 09:46:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:46:00,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:00,122 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-10-04 09:46:00,122 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:00,122 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:00,122 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-10-04 09:46:00,123 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:00,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:00,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:00,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:00,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 09:46:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 09:46:00,201 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-04 09:46:00,228 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:46:00 BoogieIcfgContainer [2018-10-04 09:46:00,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:46:00,229 INFO L168 Benchmark]: Toolchain (without parser) took 10348.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 341.0 MB). Peak memory consumption was 341.0 MB. Max. memory is 7.1 GB. [2018-10-04 09:46:00,231 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 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-04 09:46:00,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.43 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-04 09:46:00,232 INFO L168 Benchmark]: Boogie Preprocessor took 23.10 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-04 09:46:00,233 INFO L168 Benchmark]: RCFGBuilder took 263.20 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-04 09:46:00,234 INFO L168 Benchmark]: TraceAbstraction took 10014.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 319.8 MB). Peak memory consumption was 319.8 MB. Max. memory is 7.1 GB. [2018-10-04 09:46:00,238 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.17 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 43.43 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 23.10 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 263.20 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 10014.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 319.8 MB). Peak memory consumption was 319.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 45]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of shiftLeft at line 38, overapproximation of bitwiseAnd at line 39. Possible FailurePath: [L14] havoc main_#res; [L15] havoc main_~i~5, main_~bit~5, main_~x~4, main_~y~4, main_~c~4; [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] [L24] assume true; VAL [main_~c~4=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=1, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=1, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=2, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=2, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=3, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=3, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=4, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=4, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=5, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=5, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=6, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=6, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=7, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=7, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L29] assume !(main_~c~4 % 256 < 8); [L30] __VERIFIER_assert_#in~cond := (if main_~x~4 % 256 == main_~y~4 % 256 then 1 else 0); [L31] havoc __VERIFIER_assert_~cond; [L32] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L33] assume __VERIFIER_assert_~cond == 0; [L34] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L45] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 9.9s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 60 SDtfs, 0 SDslu, 298 SDs, 0 SdLazy, 386 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred 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.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 157 ConstructedInterpolants, 56 QuantifiedInterpolants, 38923 SizeOfPredicates, 11 NumberOfNonLiveVariables, 315 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 0/336 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_1.i_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-46-00-251.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_1.i_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-46-00-251.csv Received shutdown request...