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.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:28:11,830 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:28:11,832 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:28:11,845 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:28:11,846 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:28:11,847 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:28:11,848 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:28:11,850 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:28:11,851 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:28:11,852 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:28:11,853 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:28:11,853 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:28:11,854 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:28:11,855 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:28:11,856 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:28:11,857 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:28:11,858 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:28:11,860 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:28:11,862 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:28:11,863 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:28:11,865 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:28:11,866 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:28:11,871 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:28:11,872 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:28:11,872 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:28:11,873 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:28:11,878 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:28:11,879 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:28:11,880 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:28:11,881 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:28:11,881 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:28:11,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:28:11,882 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:28:11,882 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:28:11,886 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:28:11,887 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:28:11,887 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:28:11,902 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:28:11,902 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:28:11,903 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:28:11,904 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:28:11,904 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:28:11,904 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:28:11,905 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:28:11,905 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:28:11,905 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:28:11,905 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:28:11,905 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:28:11,906 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:28:11,906 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:28:11,906 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:28:11,906 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:28:11,906 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:28:11,907 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:28:11,907 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:28:11,907 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:28:11,907 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:28:11,907 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:28:11,908 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:28:11,908 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:28:11,908 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:28:11,908 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:28:11,908 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:28:11,909 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:28:11,909 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:28:11,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:28:11,909 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:28:11,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:28:11,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:28:12,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:28:12,009 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:28:12,010 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:28:12,011 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl [2018-09-30 10:28:12,011 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl' [2018-09-30 10:28:12,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:28:12,101 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:28:12,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:28:12,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:28:12,102 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:28:12,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:12" (1/1) ... [2018-09-30 10:28:12,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:12" (1/1) ... [2018-09-30 10:28:12,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:28:12,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:28:12,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:28:12,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:28:12,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:12" (1/1) ... [2018-09-30 10:28:12,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:12" (1/1) ... [2018-09-30 10:28:12,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:12" (1/1) ... [2018-09-30 10:28:12,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:12" (1/1) ... [2018-09-30 10:28:12,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:12" (1/1) ... [2018-09-30 10:28:12,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:12" (1/1) ... [2018-09-30 10:28:12,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:12" (1/1) ... [2018-09-30 10:28:12,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:28:12,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:28:12,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:28:12,211 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:28:12,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:12" (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:28:12,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:28:12,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:28:12,867 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:28:12,868 INFO L202 PluginConnector]: Adding new model pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:28:12 BoogieIcfgContainer [2018-09-30 10:28:12,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:28:12,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:28:12,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:28:12,875 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:28:12,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:12" (1/2) ... [2018-09-30 10:28:12,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4563bedb and model type pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:28:12, skipping insertion in model container [2018-09-30 10:28:12,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:28:12" (2/2) ... [2018-09-30 10:28:12,880 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl [2018-09-30 10:28:12,891 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:28:12,904 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:28:12,966 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:28:12,966 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:28:12,967 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:28:12,967 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:28:12,967 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:28:12,967 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:28:12,970 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:28:12,970 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:28:12,970 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:28:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-09-30 10:28:13,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:28:13,005 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:13,006 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:13,007 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:13,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:13,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1167247547, now seen corresponding path program 1 times [2018-09-30 10:28:13,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:13,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:13,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:13,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:13,328 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:28:13,331 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:13,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:13,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:13,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:13,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:13,353 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-09-30 10:28:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:13,419 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-09-30 10:28:13,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:13,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-09-30 10:28:13,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:13,433 INFO L225 Difference]: With dead ends: 42 [2018-09-30 10:28:13,433 INFO L226 Difference]: Without dead ends: 27 [2018-09-30 10:28:13,437 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:28:13,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-30 10:28:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-09-30 10:28:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-30 10:28:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-09-30 10:28:13,478 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 13 [2018-09-30 10:28:13,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:13,478 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-09-30 10:28:13,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-09-30 10:28:13,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:28:13,482 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:13,482 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:13,482 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:13,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:13,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1352712387, now seen corresponding path program 1 times [2018-09-30 10:28:13,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:13,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:13,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:13,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:13,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:13,698 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:28:13,699 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:13,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:28:13,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:28:13,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:28:13,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:28:13,702 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2018-09-30 10:28:13,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:13,814 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2018-09-30 10:28:13,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:28:13,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-09-30 10:28:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:13,818 INFO L225 Difference]: With dead ends: 53 [2018-09-30 10:28:13,818 INFO L226 Difference]: Without dead ends: 51 [2018-09-30 10:28:13,819 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 10:28:13,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-30 10:28:13,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 29. [2018-09-30 10:28:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-30 10:28:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-09-30 10:28:13,835 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 13 [2018-09-30 10:28:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:13,835 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-09-30 10:28:13,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:28:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2018-09-30 10:28:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:28:13,837 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:13,837 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:13,837 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:13,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:13,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1352652805, now seen corresponding path program 1 times [2018-09-30 10:28:13,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:13,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:13,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:13,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:13,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:13,988 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:28:13,989 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:13,989 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:13,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:28:13,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:28:13,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:28:13,991 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 4 states. [2018-09-30 10:28:14,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:14,140 INFO L93 Difference]: Finished difference Result 97 states and 135 transitions. [2018-09-30 10:28:14,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:28:14,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-09-30 10:28:14,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:14,142 INFO L225 Difference]: With dead ends: 97 [2018-09-30 10:28:14,143 INFO L226 Difference]: Without dead ends: 69 [2018-09-30 10:28:14,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:28:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-30 10:28:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-30 10:28:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-30 10:28:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2018-09-30 10:28:14,169 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 13 [2018-09-30 10:28:14,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:14,173 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2018-09-30 10:28:14,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:28:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2018-09-30 10:28:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 10:28:14,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:14,178 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:14,179 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:14,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:14,180 INFO L82 PathProgramCache]: Analyzing trace with hash -496146579, now seen corresponding path program 1 times [2018-09-30 10:28:14,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:14,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:14,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:14,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:14,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-30 10:28:14,303 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:14,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:14,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:14,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:14,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:14,308 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand 3 states. [2018-09-30 10:28:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:14,353 INFO L93 Difference]: Finished difference Result 163 states and 214 transitions. [2018-09-30 10:28:14,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:14,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-09-30 10:28:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:14,355 INFO L225 Difference]: With dead ends: 163 [2018-09-30 10:28:14,356 INFO L226 Difference]: Without dead ends: 117 [2018-09-30 10:28:14,357 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:28:14,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-30 10:28:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-09-30 10:28:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-30 10:28:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 147 transitions. [2018-09-30 10:28:14,387 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 147 transitions. Word has length 24 [2018-09-30 10:28:14,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:14,387 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 147 transitions. [2018-09-30 10:28:14,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 147 transitions. [2018-09-30 10:28:14,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-30 10:28:14,389 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:14,389 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:28:14,390 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:14,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:14,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2004031215, now seen corresponding path program 1 times [2018-09-30 10:28:14,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:14,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:14,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:14,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:14,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-30 10:28:14,504 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:14,504 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:14,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:14,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:14,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:14,506 INFO L87 Difference]: Start difference. First operand 115 states and 147 transitions. Second operand 3 states. [2018-09-30 10:28:14,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:14,614 INFO L93 Difference]: Finished difference Result 339 states and 435 transitions. [2018-09-30 10:28:14,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:14,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-09-30 10:28:14,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:14,622 INFO L225 Difference]: With dead ends: 339 [2018-09-30 10:28:14,623 INFO L226 Difference]: Without dead ends: 227 [2018-09-30 10:28:14,624 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:28:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-30 10:28:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-09-30 10:28:14,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-30 10:28:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 280 transitions. [2018-09-30 10:28:14,702 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 280 transitions. Word has length 46 [2018-09-30 10:28:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:14,707 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 280 transitions. [2018-09-30 10:28:14,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 280 transitions. [2018-09-30 10:28:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-30 10:28:14,711 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:14,711 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:28:14,713 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:14,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash 622372971, now seen corresponding path program 1 times [2018-09-30 10:28:14,714 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:14,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:14,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:14,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:14,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:15,138 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-09-30 10:28:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 37 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-30 10:28:15,147 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:28:15,147 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:15,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:15,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:28:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 11 proven. 44 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-30 10:28:16,130 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:28:16,130 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 9 [2018-09-30 10:28:16,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:28:16,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:28:16,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-30 10:28:16,132 INFO L87 Difference]: Start difference. First operand 225 states and 280 transitions. Second operand 10 states. [2018-09-30 10:28:16,662 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-30 10:28:18,991 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-30 10:28:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:19,000 INFO L93 Difference]: Finished difference Result 541 states and 660 transitions. [2018-09-30 10:28:19,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 10:28:19,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-09-30 10:28:19,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:19,003 INFO L225 Difference]: With dead ends: 541 [2018-09-30 10:28:19,003 INFO L226 Difference]: Without dead ends: 196 [2018-09-30 10:28:19,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-09-30 10:28:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-09-30 10:28:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2018-09-30 10:28:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-30 10:28:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2018-09-30 10:28:19,067 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 46 [2018-09-30 10:28:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:19,072 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2018-09-30 10:28:19,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:28:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2018-09-30 10:28:19,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-30 10:28:19,078 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:19,078 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-09-30 10:28:19,078 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:19,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:19,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1967911691, now seen corresponding path program 2 times [2018-09-30 10:28:19,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:19,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:19,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:19,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:19,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-09-30 10:28:19,195 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:19,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:19,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:19,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:19,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:19,197 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand 3 states. [2018-09-30 10:28:19,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:19,204 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2018-09-30 10:28:19,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:19,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-09-30 10:28:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:19,205 INFO L225 Difference]: With dead ends: 157 [2018-09-30 10:28:19,205 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:28:19,206 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:28:19,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:28:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:28:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:28:19,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:28:19,207 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2018-09-30 10:28:19,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:19,207 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:28:19,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:19,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:28:19,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:28:19,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:28:20,909 WARN L178 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-09-30 10:28:21,174 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-09-30 10:28:21,291 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-09-30 10:28:21,406 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-09-30 10:28:21,825 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-09-30 10:28:21,924 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 51 300) no Hoare annotation was computed. [2018-09-30 10:28:21,924 INFO L422 ceAbstractionStarter]: At program point L184(lines 184 195) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-09-30 10:28:21,924 INFO L422 ceAbstractionStarter]: At program point L246(lines 238 247) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse1 (* 256 (div ~r1 256)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (<= ~r1 (+ .cse1 2)) .cse2 .cse3 .cse4 .cse5 .cse6) (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 .cse1)))) [2018-09-30 10:28:21,925 INFO L422 ceAbstractionStarter]: At program point L207(lines 207 217) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse4 (* 256 (div ~r1 256))) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 (<= ~r1 .cse4)) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 (<= ~r1 (+ .cse4 2)) .cse1 .cse2 .cse3))) [2018-09-30 10:28:21,925 INFO L422 ceAbstractionStarter]: At program point L267(lines 263 274) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-09-30 10:28:21,925 INFO L422 ceAbstractionStarter]: At program point L294(lines 294 298) the Hoare annotation is: false [2018-09-30 10:28:21,926 INFO L422 ceAbstractionStarter]: At program point L224(lines 216 225) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse1 (* 256 (div ~r1 256)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (<= ~r1 (+ .cse1 2)) .cse2 .cse3 .cse4 .cse5 .cse6) (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 .cse1)))) [2018-09-30 10:28:21,926 INFO L422 ceAbstractionStarter]: At program point L288(lines 288 295) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (= ULTIMATE.start_assert_~arg 1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (<= 1 ULTIMATE.start_check_~tmp~64) (= 0 (+ ~nomsg 1))) [2018-09-30 10:28:21,926 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 51 300) no Hoare annotation was computed. [2018-09-30 10:28:21,926 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 51 300) no Hoare annotation was computed. [2018-09-30 10:28:21,926 INFO L422 ceAbstractionStarter]: At program point L278(lines 273 279) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (<= 1 ULTIMATE.start_check_~tmp~64) (= 0 (+ ~nomsg 1))) [2018-09-30 10:28:21,927 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 299) no Hoare annotation was computed. [2018-09-30 10:28:21,927 INFO L422 ceAbstractionStarter]: At program point L202(lines 194 203) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse4 (* 256 (div ~r1 256))) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 (<= ~r1 .cse4)) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 (<= ~r1 (+ .cse4 2)) .cse1 .cse2 .cse3))) [2018-09-30 10:28:21,927 INFO L422 ceAbstractionStarter]: At program point L297(lines 177 297) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-09-30 10:28:21,928 INFO L422 ceAbstractionStarter]: At program point L229(lines 229 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse1 (* 256 (div ~r1 256)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (<= ~r1 (+ .cse1 2)) .cse2 .cse3 .cse4 .cse5 .cse6) (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 .cse1)))) [2018-09-30 10:28:21,928 INFO L422 ceAbstractionStarter]: At program point L258(lines 258 264) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-09-30 10:28:21,967 INFO L202 PluginConnector]: Adding new model pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:28:21 BoogieIcfgContainer [2018-09-30 10:28:21,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:28:21,968 INFO L168 Benchmark]: Toolchain (without parser) took 9870.31 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 28.8 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -57.2 MB). Peak memory consumption was 488.4 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:21,970 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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:28:21,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.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 10:28:21,971 INFO L168 Benchmark]: Boogie Preprocessor took 59.01 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:28:21,971 INFO L168 Benchmark]: RCFGBuilder took 657.45 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:21,972 INFO L168 Benchmark]: TraceAbstraction took 9096.33 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 28.8 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -89.0 MB). Peak memory consumption was 456.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:21,980 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.20 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 48.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. * Boogie Preprocessor took 59.01 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.45 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9096.33 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 28.8 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -89.0 MB). Peak memory consumption was 456.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 299]: 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: 207]: Loop Invariant Derived loop invariant: (((((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && assert_~arg == 1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 1 <= check_~tmp~64) && 0 == ~nomsg + 1 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) || (((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 1 <= check_~tmp~64) && 0 == ~nomsg + 1 - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 8.9s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 151 SDtfs, 204 SDslu, 174 SDs, 0 SdLazy, 406 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=5, 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.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 67 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 139 NumberOfFragments, 755 HoareAnnotationTreeSize, 12 FomulaSimplifications, 5961 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 390 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 261 ConstructedInterpolants, 28 QuantifiedInterpolants, 50606 SizeOfPredicates, 7 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 326/374 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.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-28-22-013.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-28-22-013.csv Received shutdown request...