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-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:27:34,855 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:27:34,859 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:27:34,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:27:34,871 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:27:34,872 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:27:34,873 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:27:34,875 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:27:34,877 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:27:34,878 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:27:34,879 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:27:34,879 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:27:34,880 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:27:34,881 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:27:34,882 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:27:34,883 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:27:34,884 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:27:34,885 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:27:34,887 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:27:34,889 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:27:34,890 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:27:34,891 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:27:34,894 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:27:34,894 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:27:34,894 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:27:34,895 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:27:34,896 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:27:34,897 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:27:34,898 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:27:34,899 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:27:34,900 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:27:34,900 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:27:34,901 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:27:34,901 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:27:34,902 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:27:34,903 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:27:34,903 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 10:27:34,923 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:27:34,923 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:27:34,924 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:27:34,927 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:27:34,928 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:27:34,928 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:27:34,929 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:27:34,929 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:27:34,929 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:27:34,929 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:27:34,929 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:27:34,930 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:27:34,930 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:27:34,930 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:27:34,930 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:27:34,932 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:27:34,932 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:27:34,932 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:27:34,932 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:27:34,934 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:27:34,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:27:34,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:27:34,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:27:34,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:27:34,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:27:34,935 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:27:34,935 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:27:34,935 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:27:34,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:27:34,936 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:27:34,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:27:35,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:27:35,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:27:35,014 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:27:35,014 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:27:35,015 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl [2018-09-30 10:27:35,015 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl' [2018-09-30 10:27:35,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:27:35,092 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:27:35,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:27:35,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:27:35,094 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:27:35,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:35" (1/1) ... [2018-09-30 10:27:35,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:35" (1/1) ... [2018-09-30 10:27:35,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:27:35,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:27:35,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:27:35,140 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:27:35,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:35" (1/1) ... [2018-09-30 10:27:35,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:35" (1/1) ... [2018-09-30 10:27:35,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:35" (1/1) ... [2018-09-30 10:27:35,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:35" (1/1) ... [2018-09-30 10:27:35,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:35" (1/1) ... [2018-09-30 10:27:35,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:35" (1/1) ... [2018-09-30 10:27:35,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:35" (1/1) ... [2018-09-30 10:27:35,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:27:35,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:27:35,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:27:35,173 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:27:35,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:35" (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 10:27:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:27:35,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:27:35,829 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:27:35,829 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:27:35 BoogieIcfgContainer [2018-09-30 10:27:35,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:27:35,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:27:35,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:27:35,836 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:27:35,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:35" (1/2) ... [2018-09-30 10:27:35,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71850003 and model type pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:27:35, skipping insertion in model container [2018-09-30 10:27:35,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:27:35" (2/2) ... [2018-09-30 10:27:35,840 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl [2018-09-30 10:27:35,850 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:27:35,859 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:27:35,912 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:27:35,913 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:27:35,913 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:27:35,913 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:27:35,913 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:27:35,914 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:27:35,914 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:27:35,914 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:27:35,914 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:27:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-09-30 10:27:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:27:35,938 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:35,939 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:35,940 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:35,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:35,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-09-30 10:27:35,951 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:35,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:36,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:36,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:36,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:36,267 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 10:27:36,270 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:36,271 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:36,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:36,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:36,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:36,290 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-09-30 10:27:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:36,348 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-09-30 10:27:36,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:36,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-09-30 10:27:36,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:36,363 INFO L225 Difference]: With dead ends: 45 [2018-09-30 10:27:36,364 INFO L226 Difference]: Without dead ends: 29 [2018-09-30 10:27:36,368 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 10:27:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-30 10:27:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-09-30 10:27:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-30 10:27:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-09-30 10:27:36,409 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-09-30 10:27:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:36,409 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-09-30 10:27:36,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-09-30 10:27:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:27:36,411 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:36,411 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:36,411 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:36,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-09-30 10:27:36,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:36,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:36,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:36,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:36,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:36,505 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 10:27:36,505 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:36,506 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:36,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:36,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:36,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:36,509 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-09-30 10:27:36,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:36,540 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2018-09-30 10:27:36,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:36,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-09-30 10:27:36,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:36,542 INFO L225 Difference]: With dead ends: 79 [2018-09-30 10:27:36,542 INFO L226 Difference]: Without dead ends: 53 [2018-09-30 10:27:36,543 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 10:27:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-30 10:27:36,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-09-30 10:27:36,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-30 10:27:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2018-09-30 10:27:36,560 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 14 [2018-09-30 10:27:36,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:36,560 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-09-30 10:27:36,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:36,561 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2018-09-30 10:27:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:27:36,561 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:36,561 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:36,562 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:36,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1271845843, now seen corresponding path program 1 times [2018-09-30 10:27:36,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:36,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:36,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:36,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:36,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:36,716 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 10:27:36,716 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:36,717 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:27:36,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:27:36,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:27:36,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:27:36,718 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 4 states. [2018-09-30 10:27:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:36,903 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-09-30 10:27:36,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:27:36,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-09-30 10:27:36,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:36,910 INFO L225 Difference]: With dead ends: 109 [2018-09-30 10:27:36,910 INFO L226 Difference]: Without dead ends: 107 [2018-09-30 10:27:36,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:27:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-30 10:27:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-09-30 10:27:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-30 10:27:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-09-30 10:27:36,960 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 14 [2018-09-30 10:27:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:36,961 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-09-30 10:27:36,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:27:36,961 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-09-30 10:27:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:27:36,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:36,962 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:36,963 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:36,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:36,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1271905425, now seen corresponding path program 1 times [2018-09-30 10:27:36,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:36,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:36,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:36,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:36,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:37,083 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 10:27:37,084 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:37,084 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:37,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:37,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:37,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:37,086 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 3 states. [2018-09-30 10:27:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:37,147 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-09-30 10:27:37,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:37,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-09-30 10:27:37,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:37,149 INFO L225 Difference]: With dead ends: 143 [2018-09-30 10:27:37,150 INFO L226 Difference]: Without dead ends: 85 [2018-09-30 10:27:37,150 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 10:27:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-30 10:27:37,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-30 10:27:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-30 10:27:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-09-30 10:27:37,178 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 14 [2018-09-30 10:27:37,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:37,180 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-09-30 10:27:37,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-09-30 10:27:37,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-30 10:27:37,181 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:37,182 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:37,182 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:37,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:37,183 INFO L82 PathProgramCache]: Analyzing trace with hash -602166477, now seen corresponding path program 1 times [2018-09-30 10:27:37,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:37,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:37,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:37,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:37,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:37,298 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:37,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:27:37,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:37,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:37,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:37,299 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-09-30 10:27:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:37,353 INFO L93 Difference]: Finished difference Result 249 states and 327 transitions. [2018-09-30 10:27:37,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:37,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-09-30 10:27:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:37,355 INFO L225 Difference]: With dead ends: 249 [2018-09-30 10:27:37,356 INFO L226 Difference]: Without dead ends: 167 [2018-09-30 10:27:37,357 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 10:27:37,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-30 10:27:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-09-30 10:27:37,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-30 10:27:37,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2018-09-30 10:27:37,398 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 26 [2018-09-30 10:27:37,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:37,398 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2018-09-30 10:27:37,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2018-09-30 10:27:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-30 10:27:37,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:37,400 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:37,401 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:37,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:37,401 INFO L82 PathProgramCache]: Analyzing trace with hash -209139467, now seen corresponding path program 1 times [2018-09-30 10:27:37,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:37,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:37,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:37,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:37,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:37,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:37,581 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:37,581 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:27:37,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:37,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:37,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:37,583 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand 3 states. [2018-09-30 10:27:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:37,674 INFO L93 Difference]: Finished difference Result 489 states and 630 transitions. [2018-09-30 10:27:37,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:37,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-09-30 10:27:37,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:37,680 INFO L225 Difference]: With dead ends: 489 [2018-09-30 10:27:37,680 INFO L226 Difference]: Without dead ends: 327 [2018-09-30 10:27:37,683 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 10:27:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-09-30 10:27:37,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-09-30 10:27:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-09-30 10:27:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2018-09-30 10:27:37,778 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 26 [2018-09-30 10:27:37,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:37,779 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2018-09-30 10:27:37,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:37,779 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2018-09-30 10:27:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-30 10:27:37,781 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:37,782 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:37,782 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:37,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:37,782 INFO L82 PathProgramCache]: Analyzing trace with hash -266397769, now seen corresponding path program 1 times [2018-09-30 10:27:37,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:37,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:37,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:37,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:37,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:37,975 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:37,975 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 10:27:37,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:38,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:27:38,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:38,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 10:27:38,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:27:38,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:27:38,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:27:38,269 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 7 states. [2018-09-30 10:27:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:40,214 INFO L93 Difference]: Finished difference Result 911 states and 1139 transitions. [2018-09-30 10:27:40,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:27:40,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-09-30 10:27:40,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:40,219 INFO L225 Difference]: With dead ends: 911 [2018-09-30 10:27:40,219 INFO L226 Difference]: Without dead ends: 589 [2018-09-30 10:27:40,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:27:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-09-30 10:27:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 409. [2018-09-30 10:27:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-30 10:27:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 505 transitions. [2018-09-30 10:27:40,323 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 505 transitions. Word has length 26 [2018-09-30 10:27:40,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:40,324 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 505 transitions. [2018-09-30 10:27:40,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:27:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 505 transitions. [2018-09-30 10:27:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-30 10:27:40,333 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:40,333 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:27:40,333 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:40,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:40,334 INFO L82 PathProgramCache]: Analyzing trace with hash 819979193, now seen corresponding path program 2 times [2018-09-30 10:27:40,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:40,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:40,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:40,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:40,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-30 10:27:40,452 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:40,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:27:40,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:40,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:40,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:40,454 INFO L87 Difference]: Start difference. First operand 409 states and 505 transitions. Second operand 3 states. [2018-09-30 10:27:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:40,630 INFO L93 Difference]: Finished difference Result 945 states and 1155 transitions. [2018-09-30 10:27:40,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:40,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-09-30 10:27:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:40,637 INFO L225 Difference]: With dead ends: 945 [2018-09-30 10:27:40,637 INFO L226 Difference]: Without dead ends: 423 [2018-09-30 10:27:40,638 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 10:27:40,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-30 10:27:40,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 349. [2018-09-30 10:27:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-09-30 10:27:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 416 transitions. [2018-09-30 10:27:40,722 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 416 transitions. Word has length 50 [2018-09-30 10:27:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:40,722 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 416 transitions. [2018-09-30 10:27:40,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 416 transitions. [2018-09-30 10:27:40,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-30 10:27:40,725 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:40,725 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-30 10:27:40,725 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:40,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:40,726 INFO L82 PathProgramCache]: Analyzing trace with hash 47747323, now seen corresponding path program 3 times [2018-09-30 10:27:40,726 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:40,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:40,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:40,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:27:40,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-30 10:27:40,783 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:40,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:40,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:40,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:40,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:40,785 INFO L87 Difference]: Start difference. First operand 349 states and 416 transitions. Second operand 3 states. [2018-09-30 10:27:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:40,798 INFO L93 Difference]: Finished difference Result 351 states and 418 transitions. [2018-09-30 10:27:40,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:40,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-09-30 10:27:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:40,799 INFO L225 Difference]: With dead ends: 351 [2018-09-30 10:27:40,799 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:27:40,800 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 10:27:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:27:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:27:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:27:40,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:27:40,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-09-30 10:27:40,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:40,801 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:27:40,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:27:40,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:27:40,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:27:40,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:40,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:41,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:42,222 WARN L178 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 10:27:42,817 WARN L178 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:27:42,920 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-30 10:27:43,079 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-30 10:27:43,198 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:27:43,528 WARN L178 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 10:27:43,666 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-09-30 10:27:43,775 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:27:43,885 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:27:44,064 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 74 385) no Hoare annotation was computed. [2018-09-30 10:27:44,065 INFO L422 ceAbstractionStarter]: At program point L318(lines 312 319) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 10:27:44,065 INFO L422 ceAbstractionStarter]: At program point L382(lines 252 382) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:27:44,065 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 384) no Hoare annotation was computed. [2018-09-30 10:27:44,065 INFO L422 ceAbstractionStarter]: At program point L275(lines 270 276) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:27:44,066 INFO L422 ceAbstractionStarter]: At program point L298(lines 289 299) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-30 10:27:44,066 INFO L422 ceAbstractionStarter]: At program point L259(lines 259 271) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:27:44,066 INFO L422 ceAbstractionStarter]: At program point L323(lines 323 333) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 10:27:44,066 INFO L422 ceAbstractionStarter]: At program point L352(lines 352 359) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-09-30 10:27:44,066 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 74 385) no Hoare annotation was computed. [2018-09-30 10:27:44,067 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 385) no Hoare annotation was computed. [2018-09-30 10:27:44,067 INFO L422 ceAbstractionStarter]: At program point L379(lines 379 383) the Hoare annotation is: false [2018-09-30 10:27:44,067 INFO L422 ceAbstractionStarter]: At program point L280(lines 280 290) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:27:44,067 INFO L422 ceAbstractionStarter]: At program point L373(lines 373 380) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (not (= 0 ULTIMATE.start_check_~tmp~101)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-09-30 10:27:44,067 INFO L422 ceAbstractionStarter]: At program point L338(lines 332 339) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 10:27:44,068 INFO L422 ceAbstractionStarter]: At program point L303(lines 303 313) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-30 10:27:44,068 INFO L422 ceAbstractionStarter]: At program point L363(lines 358 364) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (not (= 0 ULTIMATE.start_check_~tmp~101)) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 10:27:44,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,113 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:27:44 BoogieIcfgContainer [2018-09-30 10:27:44,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:27:44,115 INFO L168 Benchmark]: Toolchain (without parser) took 9024.92 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 24.1 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 93.3 MB). Peak memory consumption was 489.8 MB. Max. memory is 7.1 GB. [2018-09-30 10:27:44,116 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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 10:27:44,117 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.65 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 10:27:44,117 INFO L168 Benchmark]: Boogie Preprocessor took 32.66 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 10:27:44,118 INFO L168 Benchmark]: RCFGBuilder took 657.41 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 10:27:44,119 INFO L168 Benchmark]: TraceAbstraction took 8282.50 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 24.1 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 51.0 MB). Peak memory consumption was 447.5 MB. Max. memory is 7.1 GB. [2018-09-30 10:27:44,123 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.19 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 45.65 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 32.66 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 657.41 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 8282.50 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 24.1 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 51.0 MB). Peak memory consumption was 447.5 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_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 384]: 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: 303]: Loop Invariant [2018-09-30 10:27:44,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 323]: Loop Invariant [2018-09-30 10:27:44,136 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,137 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,138 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,138 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && !(0 == check_~tmp~101)) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 352]: Loop Invariant [2018-09-30 10:27:44,140 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,141 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && !(0 == check_~tmp~101)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 289]: Loop Invariant [2018-09-30 10:27:44,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,145 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,146 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 252]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 312]: Loop Invariant [2018-09-30 10:27:44,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,148 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,149 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,149 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 332]: Loop Invariant [2018-09-30 10:27:44,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,151 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:27:44,151 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 8.1s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 3.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 230 SDtfs, 197 SDslu, 195 SDs, 0 SdLazy, 164 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409occurred in iteration=7, 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.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 310 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 133 NumberOfFragments, 853 HoareAnnotationTreeSize, 13 FomulaSimplifications, 13454 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 13 FomulaSimplificationsInter, 160 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 250 ConstructedInterpolants, 8 QuantifiedInterpolants, 23953 SizeOfPredicates, 1 NumberOfNonLiveVariables, 244 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 178/192 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-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-27-44-159.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-27-44-159.csv Received shutdown request...