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/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:19:54,718 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:19:54,720 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:19:54,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:19:54,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:19:54,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:19:54,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:19:54,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:19:54,747 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:19:54,748 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:19:54,750 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:19:54,751 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:19:54,752 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:19:54,753 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:19:54,754 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:19:54,755 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:19:54,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:19:54,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:19:54,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:19:54,766 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:19:54,770 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:19:54,771 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:19:54,774 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:19:54,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:19:54,775 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:19:54,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:19:54,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:19:54,777 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:19:54,778 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:19:54,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:19:54,779 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:19:54,780 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:19:54,780 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:19:54,780 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:19:54,781 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:19:54,783 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:19:54,784 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-09-30 20:19:54,810 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:19:54,810 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:19:54,811 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:19:54,812 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:19:54,812 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:19:54,812 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:19:54,813 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:19:54,813 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:19:54,813 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:19:54,813 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:19:54,814 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:19:54,814 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:19:54,815 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:19:54,815 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:19:54,815 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:19:54,815 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:19:54,815 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:19:54,816 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:19:54,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:19:54,816 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:19:54,816 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:19:54,817 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:19:54,818 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:19:54,818 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:19:54,818 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:19:54,818 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:19:54,818 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:19:54,818 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:19:54,819 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:19:54,819 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:19:54,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:19:54,888 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:19:54,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:19:54,895 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:19:54,895 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:19:54,896 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl [2018-09-30 20:19:54,896 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl' [2018-09-30 20:19:55,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:19:55,013 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:19:55,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:19:55,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:19:55,014 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:19:55,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:54" (1/1) ... [2018-09-30 20:19:55,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:54" (1/1) ... [2018-09-30 20:19:55,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:19:55,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:19:55,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:19:55,078 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:19:55,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:54" (1/1) ... [2018-09-30 20:19:55,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:54" (1/1) ... [2018-09-30 20:19:55,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:54" (1/1) ... [2018-09-30 20:19:55,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:54" (1/1) ... [2018-09-30 20:19:55,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:54" (1/1) ... [2018-09-30 20:19:55,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:54" (1/1) ... [2018-09-30 20:19:55,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:54" (1/1) ... [2018-09-30 20:19:55,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:19:55,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:19:55,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:19:55,124 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:19:55,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:54" (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-09-30 20:19:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:19:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:19:55,858 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:19:55,858 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:19:55 BoogieIcfgContainer [2018-09-30 20:19:55,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:19:55,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:19:55,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:19:55,863 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:19:55,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:54" (1/2) ... [2018-09-30 20:19:55,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c78d800 and model type pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:19:55, skipping insertion in model container [2018-09-30 20:19:55,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:19:55" (2/2) ... [2018-09-30 20:19:55,866 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl [2018-09-30 20:19:55,875 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:19:55,883 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:19:55,927 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:19:55,928 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:19:55,928 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:19:55,928 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:19:55,928 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:19:55,928 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:19:55,929 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:19:55,929 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:19:55,929 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:19:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-09-30 20:19:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 20:19:55,951 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:55,952 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:19:55,953 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:55,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:55,959 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-09-30 20:19:55,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:55,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:56,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:56,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:56,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:56,242 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:56,242 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:19:56,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:56,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:56,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:56,265 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-09-30 20:19:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:56,336 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-09-30 20:19:56,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:56,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-30 20:19:56,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:56,349 INFO L225 Difference]: With dead ends: 54 [2018-09-30 20:19:56,349 INFO L226 Difference]: Without dead ends: 35 [2018-09-30 20:19:56,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-30 20:19:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-09-30 20:19:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-30 20:19:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-09-30 20:19:56,397 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-09-30 20:19:56,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:56,398 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-09-30 20:19:56,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:56,398 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-09-30 20:19:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 20:19:56,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:56,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:19:56,400 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:56,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:56,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-09-30 20:19:56,400 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:56,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:56,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:56,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:56,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:56,511 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:56,511 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:19:56,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:56,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:56,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:56,514 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-09-30 20:19:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:56,579 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-09-30 20:19:56,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:56,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-30 20:19:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:56,581 INFO L225 Difference]: With dead ends: 97 [2018-09-30 20:19:56,581 INFO L226 Difference]: Without dead ends: 65 [2018-09-30 20:19:56,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-30 20:19:56,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-09-30 20:19:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-30 20:19:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-09-30 20:19:56,603 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-09-30 20:19:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:56,603 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-09-30 20:19:56,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-09-30 20:19:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 20:19:56,604 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:56,604 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:19:56,605 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:56,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:56,605 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-09-30 20:19:56,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:56,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:56,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:56,709 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:56,709 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:19:56,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:56,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:56,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:56,712 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-09-30 20:19:56,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:56,751 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-09-30 20:19:56,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:56,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-30 20:19:56,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:56,756 INFO L225 Difference]: With dead ends: 187 [2018-09-30 20:19:56,756 INFO L226 Difference]: Without dead ends: 125 [2018-09-30 20:19:56,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:56,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-30 20:19:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-09-30 20:19:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-30 20:19:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-09-30 20:19:56,790 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-09-30 20:19:56,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:56,791 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-09-30 20:19:56,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-09-30 20:19:56,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 20:19:56,792 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:56,792 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:19:56,792 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:56,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:56,793 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-09-30 20:19:56,793 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:56,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:56,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:56,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:56,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:56,915 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:56,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:19:56,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:56,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:56,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:56,918 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-09-30 20:19:57,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:57,005 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-09-30 20:19:57,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:57,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-30 20:19:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:57,014 INFO L225 Difference]: With dead ends: 367 [2018-09-30 20:19:57,015 INFO L226 Difference]: Without dead ends: 245 [2018-09-30 20:19:57,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-30 20:19:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-09-30 20:19:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-30 20:19:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-09-30 20:19:57,090 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-09-30 20:19:57,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:57,093 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-09-30 20:19:57,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:57,093 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-09-30 20:19:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 20:19:57,094 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:57,094 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:19:57,094 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:57,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:57,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-09-30 20:19:57,095 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:57,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:57,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:57,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:57,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:57,295 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:57,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:19:57,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:19:57,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:19:57,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:19:57,298 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-09-30 20:19:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:57,605 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-09-30 20:19:57,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:19:57,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-09-30 20:19:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:57,610 INFO L225 Difference]: With dead ends: 517 [2018-09-30 20:19:57,612 INFO L226 Difference]: Without dead ends: 515 [2018-09-30 20:19:57,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:19:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-09-30 20:19:57,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-09-30 20:19:57,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-09-30 20:19:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-09-30 20:19:57,701 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-09-30 20:19:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:57,702 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-09-30 20:19:57,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:19:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-09-30 20:19:57,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 20:19:57,704 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:57,705 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:19:57,705 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:57,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:57,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-09-30 20:19:57,706 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:57,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:57,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:57,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:57,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:57,951 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:57,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:19:57,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:19:57,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:19:57,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:19:57,953 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-09-30 20:19:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:58,300 INFO L93 Difference]: Finished difference Result 799 states and 1085 transitions. [2018-09-30 20:19:58,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:19:58,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-09-30 20:19:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:58,304 INFO L225 Difference]: With dead ends: 799 [2018-09-30 20:19:58,304 INFO L226 Difference]: Without dead ends: 525 [2018-09-30 20:19:58,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:19:58,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-09-30 20:19:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 403. [2018-09-30 20:19:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-30 20:19:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 526 transitions. [2018-09-30 20:19:58,384 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 526 transitions. Word has length 17 [2018-09-30 20:19:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:58,384 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 526 transitions. [2018-09-30 20:19:58,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:19:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 526 transitions. [2018-09-30 20:19:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-30 20:19:58,389 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:58,390 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:19:58,390 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:58,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:58,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2097839419, now seen corresponding path program 1 times [2018-09-30 20:19:58,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:58,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:58,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:58,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:58,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:58,567 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:58,567 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:19:58,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:58,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:58,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:58,568 INFO L87 Difference]: Start difference. First operand 403 states and 526 transitions. Second operand 3 states. [2018-09-30 20:19:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:58,782 INFO L93 Difference]: Finished difference Result 1207 states and 1576 transitions. [2018-09-30 20:19:58,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:58,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-09-30 20:19:58,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:58,787 INFO L225 Difference]: With dead ends: 1207 [2018-09-30 20:19:58,788 INFO L226 Difference]: Without dead ends: 805 [2018-09-30 20:19:58,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-09-30 20:19:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 803. [2018-09-30 20:19:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-09-30 20:19:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1026 transitions. [2018-09-30 20:19:58,931 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1026 transitions. Word has length 32 [2018-09-30 20:19:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:58,931 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 1026 transitions. [2018-09-30 20:19:58,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1026 transitions. [2018-09-30 20:19:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-30 20:19:58,935 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:58,935 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:19:58,936 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:58,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1417781049, now seen corresponding path program 1 times [2018-09-30 20:19:58,936 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:58,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:58,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:58,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:58,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:19:59,258 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:19:59,258 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-09-30 20:19:59,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:59,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:19:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:19:59,569 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:19:59,569 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-09-30 20:19:59,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:19:59,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:19:59,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:19:59,570 INFO L87 Difference]: Start difference. First operand 803 states and 1026 transitions. Second operand 4 states. [2018-09-30 20:20:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:00,080 INFO L93 Difference]: Finished difference Result 2327 states and 2917 transitions. [2018-09-30 20:20:00,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:20:00,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-09-30 20:20:00,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:00,090 INFO L225 Difference]: With dead ends: 2327 [2018-09-30 20:20:00,090 INFO L226 Difference]: Without dead ends: 1525 [2018-09-30 20:20:00,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:20:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-09-30 20:20:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1205. [2018-09-30 20:20:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-30 20:20:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1508 transitions. [2018-09-30 20:20:00,378 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1508 transitions. Word has length 32 [2018-09-30 20:20:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:00,379 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1508 transitions. [2018-09-30 20:20:00,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:20:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1508 transitions. [2018-09-30 20:20:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-30 20:20:00,385 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:00,385 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 20:20:00,386 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:00,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:00,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2034253683, now seen corresponding path program 2 times [2018-09-30 20:20:00,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:00,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:00,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:00,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:00,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:01,269 WARN L178 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2018-09-30 20:20:01,582 WARN L178 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2018-09-30 20:20:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 49 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-09-30 20:20:01,597 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:20:01,597 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-09-30 20:20:01,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:20:01,704 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:20:01,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:20:01,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:20:02,135 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-09-30 20:20:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-30 20:20:02,416 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:20:02,417 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-09-30 20:20:02,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:20:02,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:20:02,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:20:02,418 INFO L87 Difference]: Start difference. First operand 1205 states and 1508 transitions. Second operand 8 states. [2018-09-30 20:20:02,709 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-09-30 20:20:03,425 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-09-30 20:20:04,662 WARN L178 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-09-30 20:20:05,292 WARN L178 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-09-30 20:20:06,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:06,328 INFO L93 Difference]: Finished difference Result 2315 states and 2909 transitions. [2018-09-30 20:20:06,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:20:06,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-09-30 20:20:06,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:06,337 INFO L225 Difference]: With dead ends: 2315 [2018-09-30 20:20:06,338 INFO L226 Difference]: Without dead ends: 1113 [2018-09-30 20:20:06,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:20:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-09-30 20:20:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 499. [2018-09-30 20:20:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-09-30 20:20:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2018-09-30 20:20:06,508 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 62 [2018-09-30 20:20:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:06,508 INFO L480 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2018-09-30 20:20:06,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:20:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2018-09-30 20:20:06,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-30 20:20:06,510 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:06,510 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:20:06,511 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:06,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:06,511 INFO L82 PathProgramCache]: Analyzing trace with hash 929696755, now seen corresponding path program 3 times [2018-09-30 20:20:06,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:06,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:06,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:06,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:20:06,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-09-30 20:20:06,671 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:06,671 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:20:06,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:06,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:06,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:06,672 INFO L87 Difference]: Start difference. First operand 499 states and 619 transitions. Second operand 3 states. [2018-09-30 20:20:06,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:06,690 INFO L93 Difference]: Finished difference Result 531 states and 654 transitions. [2018-09-30 20:20:06,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:06,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-09-30 20:20:06,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:06,692 INFO L225 Difference]: With dead ends: 531 [2018-09-30 20:20:06,692 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:20:06,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:06,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:20:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:20:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:20:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:20:06,693 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-09-30 20:20:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:06,694 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:20:06,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:20:06,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:20:06,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:20:06,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:06,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:06,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:06,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:07,074 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-30 20:20:07,264 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-09-30 20:20:07,446 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2018-09-30 20:20:07,765 WARN L178 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-30 20:20:08,046 WARN L178 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-09-30 20:20:08,338 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2018-09-30 20:20:08,492 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2018-09-30 20:20:08,635 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-30 20:20:08,794 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-09-30 20:20:08,796 INFO L422 ceAbstractionStarter]: At program point L403(lines 403 409) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ~r1 0) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-09-30 20:20:08,797 INFO L422 ceAbstractionStarter]: At program point L370(lines 370 380) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~send4)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= ~send4 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~r1))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2018-09-30 20:20:08,797 INFO L422 ceAbstractionStarter]: At program point L304(lines 304 315) the Hoare annotation is: (let ((.cse1 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse2 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse10 (not (= ~p1_old ~nomsg))) (.cse0 (<= ~r1 0)) (.cse3 (<= 0 ~send4)) (.cse11 (<= 1 ~mode2)) (.cse12 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~r1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~mode2 (* 256 (div ~mode2 256))) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 (= ~mode1 (* 256 (div ~mode1 256))) .cse3 .cse11 .cse12 (<= ~r1 1) .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse0 .cse3 .cse11 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-09-30 20:20:08,798 INFO L422 ceAbstractionStarter]: At program point L387(lines 379 388) the Hoare annotation is: (and (<= ~r1 0) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~p1_new ~nomsg)) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-09-30 20:20:08,798 INFO L422 ceAbstractionStarter]: At program point L321(lines 314 322) the Hoare annotation is: (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~p1_new ~nomsg)) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-09-30 20:20:08,798 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 448) no Hoare annotation was computed. [2018-09-30 20:20:08,798 INFO L422 ceAbstractionStarter]: At program point L445(lines 274 445) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send1 127)) (.cse3 (<= ~send4 127)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~r1))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send1) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 .cse3 (= ~mode2 (* 256 (div ~mode2 256))) .cse4 .cse5) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= 1 ~mode2) (<= ~mode2 1) (< 0 (+ (div ~send1 256) 1)) .cse2 .cse3 .cse4 .cse5))) [2018-09-30 20:20:08,798 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 448) no Hoare annotation was computed. [2018-09-30 20:20:08,798 INFO L422 ceAbstractionStarter]: At program point L412(lines 408 419) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ~r1 0) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-09-30 20:20:08,799 INFO L422 ceAbstractionStarter]: At program point L433(lines 433 440) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= 0 ~send4) (<= ~mode2 1) (< 0 (+ (div ~send1 256) 1)) (= 0 (+ ~nomsg 1)) (<= 0 ~r1) (not (= ~p1_old ~nomsg)) (<= ~r1 0) (<= 1 ~mode2) (<= ~send1 127) (<= ~send4 127) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~106)) [2018-09-30 20:20:08,799 INFO L422 ceAbstractionStarter]: At program point L326(lines 326 336) the Hoare annotation is: (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~p1_new ~nomsg)) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-09-30 20:20:08,799 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 448) no Hoare annotation was computed. [2018-09-30 20:20:08,799 INFO L422 ceAbstractionStarter]: At program point L281(lines 281 292) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send1 127)) (.cse3 (<= ~send4 127)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~r1))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send1) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 .cse3 (= ~mode2 (* 256 (div ~mode2 256))) .cse4 .cse5) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= 1 ~mode2) (<= ~mode2 1) (< 0 (+ (div ~send1 256) 1)) .cse2 .cse3 .cse4 .cse5))) [2018-09-30 20:20:08,799 INFO L422 ceAbstractionStarter]: At program point L343(lines 335 344) the Hoare annotation is: (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~p1_new ~nomsg)) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-09-30 20:20:08,800 INFO L422 ceAbstractionStarter]: At program point L348(lines 348 358) the Hoare annotation is: (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~p1_new ~nomsg)) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-09-30 20:20:08,800 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 447) no Hoare annotation was computed. [2018-09-30 20:20:08,800 INFO L422 ceAbstractionStarter]: At program point L439(lines 439 446) the Hoare annotation is: false [2018-09-30 20:20:08,800 INFO L422 ceAbstractionStarter]: At program point L365(lines 357 366) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~send4)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= ~send4 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~r1))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2018-09-30 20:20:08,801 INFO L422 ceAbstractionStarter]: At program point L299(lines 291 300) the Hoare annotation is: (let ((.cse1 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse2 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse10 (not (= ~p1_old ~nomsg))) (.cse0 (<= ~r1 0)) (.cse3 (<= 0 ~send4)) (.cse11 (<= 1 ~mode2)) (.cse12 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~r1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~mode2 (* 256 (div ~mode2 256))) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 (= ~mode1 (* 256 (div ~mode1 256))) .cse3 .cse11 .cse12 (<= ~r1 1) .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse0 .cse3 .cse11 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-09-30 20:20:08,801 INFO L422 ceAbstractionStarter]: At program point L423(lines 418 424) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ~r1 0) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~106) (<= 0 ~r1)) [2018-09-30 20:20:08,813 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,814 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,814 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,815 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,817 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,818 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,818 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,818 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,825 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,826 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,826 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,826 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,828 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,829 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,829 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,829 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,837 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:20:08 BoogieIcfgContainer [2018-09-30 20:20:08,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:20:08,838 INFO L168 Benchmark]: Toolchain (without parser) took 13829.83 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 51.4 MB). Free memory was 1.5 GB in the beginning and 934.4 MB in the end (delta: 538.1 MB). Peak memory consumption was 589.5 MB. Max. memory is 7.1 GB. [2018-09-30 20:20:08,839 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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-09-30 20:20:08,840 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.11 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-09-30 20:20:08,841 INFO L168 Benchmark]: Boogie Preprocessor took 45.92 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-09-30 20:20:08,841 INFO L168 Benchmark]: RCFGBuilder took 735.12 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-30 20:20:08,842 INFO L168 Benchmark]: TraceAbstraction took 12977.77 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 51.4 MB). Free memory was 1.4 GB in the beginning and 934.4 MB in the end (delta: 495.8 MB). Peak memory consumption was 547.2 MB. Max. memory is 7.1 GB. [2018-09-30 20:20:08,846 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.18 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 61.11 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 45.92 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 735.12 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12977.77 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 51.4 MB). Free memory was 1.4 GB in the beginning and 934.4 MB in the end (delta: 495.8 MB). Peak memory consumption was 547.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 447]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: ((((((((~r1 <= 0 && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 357]: Loop Invariant [2018-09-30 20:20:08,856 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,856 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,856 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,857 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,858 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,859 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,859 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,859 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (1 <= ~mode2 && ~mode2 <= 1) && (((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) || (((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: ((((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) || ((((((((((!(~p1_old == ~nomsg) && ~mode5 == 256 * (~mode5 / 256)) && ~r1 <= 0) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1)) || (((((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1)) || ((((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 274]: Loop Invariant Derived loop invariant: ((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && 0 <= ~r1) || (((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 370]: Loop Invariant [2018-09-30 20:20:08,864 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,865 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,865 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,865 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,867 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,867 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,867 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 20:20:08,867 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (1 <= ~mode2 && ~mode2 <= 1) && (((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) || (((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1)) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= check_~tmp~106) && 0 <= ~r1 - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: (((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: (((((((((((assert_~arg <= 1 && 0 <= ~send4) && ~mode2 <= 1) && 0 < ~send1 / 256 + 1) && 0 == ~nomsg + 1) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) && 1 <= check_~tmp~106 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) || ((((((((((!(~p1_old == ~nomsg) && ~mode5 == 256 * (~mode5 / 256)) && ~r1 <= 0) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1)) || (((((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1)) || ((((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && 0 <= ~r1) || (((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 12.8s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 331 SDslu, 305 SDs, 0 SdLazy, 229 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1205occurred 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.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 1306 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 50 NumberOfFragments, 1162 HoareAnnotationTreeSize, 16 FomulaSimplifications, 4169 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 363 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 372 ConstructedInterpolants, 17 QuantifiedInterpolants, 86420 SizeOfPredicates, 5 NumberOfNonLiveVariables, 808 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 281/315 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-20-08-878.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-20-08-878.csv Received shutdown request...