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.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:26:16,244 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:26:16,246 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:26:16,258 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:26:16,258 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:26:16,259 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:26:16,260 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:26:16,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:26:16,264 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:26:16,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:26:16,266 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:26:16,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:26:16,267 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:26:16,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:26:16,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:26:16,270 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:26:16,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:26:16,273 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:26:16,275 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:26:16,276 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:26:16,278 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:26:16,279 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:26:16,281 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:26:16,282 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:26:16,282 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:26:16,283 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:26:16,284 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:26:16,285 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:26:16,286 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:26:16,287 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:26:16,287 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:26:16,288 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:26:16,288 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:26:16,288 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:26:16,290 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:26:16,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:26:16,294 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:26:16,320 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:26:16,321 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:26:16,321 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:26:16,322 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:26:16,325 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:26:16,326 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:26:16,326 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:26:16,326 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:26:16,326 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:26:16,326 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:26:16,327 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:26:16,327 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:26:16,327 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:26:16,327 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:26:16,327 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:26:16,327 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:26:16,328 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:26:16,328 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:26:16,328 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:26:16,328 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:26:16,328 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:26:16,329 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:26:16,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:26:16,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:26:16,330 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:26:16,331 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:26:16,331 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:26:16,331 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:26:16,331 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:26:16,331 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:26:16,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:26:16,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:26:16,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:26:16,416 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:26:16,417 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:26:16,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl [2018-10-04 12:26:16,418 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl' [2018-10-04 12:26:16,473 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:26:16,475 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:26:16,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:26:16,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:26:16,476 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:26:16,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:16" (1/1) ... [2018-10-04 12:26:16,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:16" (1/1) ... [2018-10-04 12:26:16,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:26:16,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:26:16,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:26:16,518 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:26:16,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:16" (1/1) ... [2018-10-04 12:26:16,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:16" (1/1) ... [2018-10-04 12:26:16,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:16" (1/1) ... [2018-10-04 12:26:16,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:16" (1/1) ... [2018-10-04 12:26:16,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:16" (1/1) ... [2018-10-04 12:26:16,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:16" (1/1) ... [2018-10-04 12:26:16,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:16" (1/1) ... [2018-10-04 12:26:16,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:26:16,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:26:16,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:26:16,540 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:26:16,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:16" (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 12:26:16,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:26:16,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:26:16,829 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:26:16,829 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:26:16 BoogieIcfgContainer [2018-10-04 12:26:16,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:26:16,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:26:16,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:26:16,834 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:26:16,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:16" (1/2) ... [2018-10-04 12:26:16,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fc52 and model type num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:26:16, skipping insertion in model container [2018-10-04 12:26:16,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:26:16" (2/2) ... [2018-10-04 12:26:16,838 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_2.i_3.bpl [2018-10-04 12:26:16,848 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:26:16,856 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:26:16,910 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:26:16,911 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:26:16,911 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:26:16,911 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:26:16,912 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:26:16,912 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:26:16,912 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:26:16,912 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:26:16,912 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:26:16,929 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-04 12:26:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:26:16,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:16,937 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:26:16,938 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:16,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-04 12:26:16,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:16,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:17,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:17,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:17,256 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 12:26:17,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:26:17,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:26:17,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:26:17,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:26:17,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:26:17,277 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-04 12:26:17,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:17,337 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-04 12:26:17,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:26:17,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-04 12:26:17,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:17,349 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:26:17,349 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:26:17,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:26:17,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:26:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 12:26:17,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 12:26:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 12:26:17,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-04 12:26:17,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:17,392 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 12:26:17,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:26:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 12:26:17,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:26:17,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:17,393 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-10-04 12:26:17,393 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:17,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:17,394 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-10-04 12:26:17,394 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:17,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:17,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:17,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:17,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:17,550 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 12:26:17,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:26:17,552 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 12:26:17,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:17,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:26:17,708 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 12:26:17,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:26:17,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-10-04 12:26:17,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:26:17,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:26:17,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:26:17,732 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-10-04 12:26:17,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:17,816 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 12:26:17,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:26:17,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-10-04 12:26:17,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:17,817 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:26:17,817 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:26:17,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:26:17,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:26:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:26:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:26:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:26:17,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-04 12:26:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:17,827 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:26:17,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:26:17,828 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:26:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:26:17,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:17,828 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-10-04 12:26:17,829 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:17,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:17,830 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-10-04 12:26:17,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:17,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:17,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:17,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:17,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:17,996 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 12:26:17,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:26:17,997 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-04 12:26:18,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:26:18,030 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:26:18,030 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:26:18,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:26:18,178 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 12:26:18,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:26:18,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-04 12:26:18,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:26:18,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:26:18,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:26:18,201 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-10-04 12:26:18,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:18,308 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 12:26:18,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:26:18,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:26:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:18,309 INFO L225 Difference]: With dead ends: 13 [2018-10-04 12:26:18,309 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:26:18,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:26:18,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:26:18,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:26:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:26:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 12:26:18,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-04 12:26:18,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:18,316 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 12:26:18,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:26:18,317 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 12:26:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:26:18,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:18,318 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-10-04 12:26:18,320 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:18,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:18,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-10-04 12:26:18,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:18,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:18,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:18,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:26:18,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:18,565 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 12:26:18,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:26:18,565 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 12:26:18,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:26:18,640 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:26:18,641 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:26:18,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:26:19,350 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 12:26:19,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:26:19,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-10-04 12:26:19,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:26:19,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:26:19,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:26:19,374 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2018-10-04 12:26:19,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:19,455 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 12:26:19,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:26:19,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-10-04 12:26:19,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:19,457 INFO L225 Difference]: With dead ends: 15 [2018-10-04 12:26:19,457 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:26:19,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:26:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:26:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 12:26:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 12:26:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 12:26:19,465 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-04 12:26:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:19,465 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 12:26:19,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:26:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 12:26:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:26:19,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:19,466 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-10-04 12:26:19,467 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:19,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:19,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-10-04 12:26:19,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:19,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:19,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:19,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:26:19,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:19,730 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 12:26:19,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:26:19,731 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 12:26:19,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:26:19,771 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:26:19,771 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:26:19,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:26:20,108 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 12:26:20,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:26:20,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-10-04 12:26:20,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:26:20,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:26:20,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:26:20,137 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-10-04 12:26:20,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:20,364 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 12:26:20,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:26:20,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-10-04 12:26:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:20,368 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:26:20,368 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 12:26:20,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:26:20,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 12:26:20,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 12:26:20,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 12:26:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 12:26:20,375 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-04 12:26:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:20,376 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 12:26:20,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:26:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 12:26:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:26:20,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:20,377 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-10-04 12:26:20,377 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:20,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:20,377 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-10-04 12:26:20,378 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:20,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:20,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:26:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:20,742 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 12:26:20,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:26:20,743 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) [2018-10-04 12:26:20,762 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:26:20,862 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:26:20,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:26:20,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:26:21,745 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 12:26:21,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:26:21,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-10-04 12:26:21,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:26:21,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:26:21,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:26:21,768 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-10-04 12:26:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:21,997 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 12:26:21,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:26:21,998 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-04 12:26:21,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:22,000 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:26:22,000 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:26:22,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:26:22,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:26:22,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 12:26:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 12:26:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 12:26:22,008 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-04 12:26:22,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:22,009 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 12:26:22,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:26:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 12:26:22,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:26:22,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:22,010 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-10-04 12:26:22,010 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:22,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:22,011 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-10-04 12:26:22,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:22,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:22,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:26:22,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:22,213 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 12:26:22,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:26:22,214 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 12:26:22,228 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:26:22,259 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:26:22,259 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:26:22,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:26:25,232 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 12:26:25,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:26:25,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-10-04 12:26:25,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:26:25,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:26:25,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:26:25,255 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2018-10-04 12:26:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:25,689 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 12:26:25,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:26:25,689 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-10-04 12:26:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:25,691 INFO L225 Difference]: With dead ends: 21 [2018-10-04 12:26:25,691 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:26:25,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:26:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:26:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 12:26:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:26:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 12:26:25,701 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-04 12:26:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:25,702 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 12:26:25,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:26:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 12:26:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:26:25,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:25,703 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-10-04 12:26:25,703 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:25,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:25,704 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-10-04 12:26:25,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:25,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:25,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:25,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:26:25,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:26,076 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 12:26:26,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:26:26,077 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 12:26:26,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:26,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:26:36,960 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 12:26:36,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:26:36,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-10-04 12:26:36,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:26:36,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:26:36,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:26:36,982 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2018-10-04 12:26:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:37,597 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 12:26:37,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:26:37,600 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-10-04 12:26:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:37,602 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:26:37,602 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:26:37,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:26:37,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:26:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 12:26:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 12:26:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 12:26:37,614 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-04 12:26:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:37,615 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 12:26:37,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:26:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 12:26:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:26:37,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:37,616 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-10-04 12:26:37,616 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:37,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:37,616 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-10-04 12:26:37,617 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:37,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:37,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:37,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:37,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 12:26:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 12:26:37,666 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-04 12:26:37,704 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:26:37 BoogieIcfgContainer [2018-10-04 12:26:37,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:26:37,705 INFO L168 Benchmark]: Toolchain (without parser) took 21231.74 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: 351.6 MB). Peak memory consumption was 351.6 MB. Max. memory is 7.1 GB. [2018-10-04 12:26:37,707 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:26:37,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:26:37,712 INFO L168 Benchmark]: Boogie Preprocessor took 21.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:26:37,713 INFO L168 Benchmark]: RCFGBuilder took 290.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:26:37,713 INFO L168 Benchmark]: TraceAbstraction took 20873.78 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: 330.4 MB). Peak memory consumption was 330.4 MB. Max. memory is 7.1 GB. [2018-10-04 12:26:37,718 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 290.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20873.78 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: 330.4 MB). Peak memory consumption was 330.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 46]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of shiftLeft at line 39, overapproximation of bitwiseAnd at line 40. Possible FailurePath: [L15] havoc main_#res; [L16] havoc main_#t~nondet0, main_~i~6, main_~bit~6, main_~x~5, main_~y~5, main_~c~5; [L17] main_~x~5 := main_#t~nondet0; [L18] havoc main_#t~nondet0; [L19] havoc main_~y~5; [L20] havoc main_~c~5; [L21] main_~y~5 := 0; [L22] main_~c~5 := 0; VAL [main_~c~5=0, main_~y~5=0] [L25] assume true; VAL [main_~c~5=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=1, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=1, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=2, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=2, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=3, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=3, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=4, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=4, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=5, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=5, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=6, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=6, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=7, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=7, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~y~5=0] [L30] assume !(main_~c~5 % 256 < 8); [L31] __VERIFIER_assert_#in~cond := (if main_~x~5 % 256 == main_~y~5 % 256 then 1 else 0); [L32] havoc __VERIFIER_assert_~cond; [L33] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L34] assume __VERIFIER_assert_~cond == 0; [L35] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~x~5=1, main_~y~5=0] [L46] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~x~5=1, main_~y~5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 20.8s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 60 SDtfs, 0 SDslu, 254 SDs, 0 SdLazy, 334 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 17.2s 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, 17.7s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 157 ConstructedInterpolants, 56 QuantifiedInterpolants, 42529 SizeOfPredicates, 10 NumberOfNonLiveVariables, 301 ConjunctsInSsa, 97 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_2.i_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-26-37-733.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_2.i_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-26-37-733.csv Received shutdown request...