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/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:40:02,840 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:40:02,842 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:40:02,853 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:40:02,853 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:40:02,854 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:40:02,856 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:40:02,857 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:40:02,859 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:40:02,860 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:40:02,861 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:40:02,861 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:40:02,862 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:40:02,863 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:40:02,864 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:40:02,865 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:40:02,866 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:40:02,868 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:40:02,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:40:02,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:40:02,873 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:40:02,874 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:40:02,876 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:40:02,876 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:40:02,877 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:40:02,877 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:40:02,878 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:40:02,879 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:40:02,880 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:40:02,881 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:40:02,881 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:40:02,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:40:02,882 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:40:02,882 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:40:02,883 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:40:02,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:40:02,884 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:40:02,910 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:40:02,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:40:02,911 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:40:02,911 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:40:02,915 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:40:02,915 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:40:02,916 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:40:02,916 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:40:02,916 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:40:02,916 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:40:02,916 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:40:02,916 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:40:02,917 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:40:02,917 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:40:02,917 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:40:02,917 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:40:02,918 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:40:02,918 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:40:02,919 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:40:02,919 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:40:02,919 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:40:02,919 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:40:02,919 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:40:02,920 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:40:02,920 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:40:02,920 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:40:02,920 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:40:02,920 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:40:02,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:40:02,921 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:40:02,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:40:02,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:40:02,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:40:02,987 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:40:02,988 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:40:02,989 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl [2018-10-02 11:40:02,989 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl' [2018-10-02 11:40:03,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:40:03,087 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:40:03,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:40:03,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:40:03,089 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:40:03,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:40:03" (1/1) ... [2018-10-02 11:40:03,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:40:03" (1/1) ... [2018-10-02 11:40:03,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:40:03,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:40:03,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:40:03,137 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:40:03,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:40:03" (1/1) ... [2018-10-02 11:40:03,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:40:03" (1/1) ... [2018-10-02 11:40:03,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:40:03" (1/1) ... [2018-10-02 11:40:03,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:40:03" (1/1) ... [2018-10-02 11:40:03,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:40:03" (1/1) ... [2018-10-02 11:40:03,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:40:03" (1/1) ... [2018-10-02 11:40:03,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:40:03" (1/1) ... [2018-10-02 11:40:03,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:40:03,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:40:03,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:40:03,192 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:40:03,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:40:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:40:03,270 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-02 11:40:03,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:40:03,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:40:03,799 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:40:03,800 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:40:03 BoogieIcfgContainer [2018-10-02 11:40:03,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:40:03,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:40:03,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:40:03,804 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:40:03,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:40:03" (1/2) ... [2018-10-02 11:40:03,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18342d43 and model type pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:40:03, skipping insertion in model container [2018-10-02 11:40:03,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:40:03" (2/2) ... [2018-10-02 11:40:03,808 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl [2018-10-02 11:40:03,817 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:40:03,825 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:40:03,871 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:40:03,872 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:40:03,872 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:40:03,872 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:40:03,872 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:40:03,872 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:40:03,873 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:40:03,873 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:40:03,873 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:40:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-02 11:40:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:40:03,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:40:03,896 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:40:03,897 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:40:03,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:40:03,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-10-02 11:40:03,905 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:40:03,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:40:03,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:40:03,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:40:03,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:40:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:40:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:40:04,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:40:04,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:40:04,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:40:04,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:40:04,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:40:04,116 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-02 11:40:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:40:04,172 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2018-10-02 11:40:04,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:40:04,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-02 11:40:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:40:04,188 INFO L225 Difference]: With dead ends: 33 [2018-10-02 11:40:04,188 INFO L226 Difference]: Without dead ends: 17 [2018-10-02 11:40:04,192 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-10-02 11:40:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-02 11:40:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-02 11:40:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-02 11:40:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-10-02 11:40:04,235 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 14 [2018-10-02 11:40:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:40:04,235 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-10-02 11:40:04,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:40:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2018-10-02 11:40:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:40:04,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:40:04,236 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:40:04,237 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:40:04,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:40:04,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-10-02 11:40:04,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:40:04,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:40:04,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:40:04,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:40:04,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:40:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:40:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:40:04,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:40:04,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:40:04,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:40:04,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:40:04,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:40:04,318 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 3 states. [2018-10-02 11:40:04,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:40:04,357 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2018-10-02 11:40:04,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:40:04,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-02 11:40:04,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:40:04,359 INFO L225 Difference]: With dead ends: 45 [2018-10-02 11:40:04,359 INFO L226 Difference]: Without dead ends: 31 [2018-10-02 11:40:04,360 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-10-02 11:40:04,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-02 11:40:04,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-10-02 11:40:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-02 11:40:04,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-10-02 11:40:04,369 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 14 [2018-10-02 11:40:04,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:40:04,369 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-10-02 11:40:04,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:40:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2018-10-02 11:40:04,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:40:04,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:40:04,370 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:40:04,371 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:40:04,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:40:04,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1820747817, now seen corresponding path program 1 times [2018-10-02 11:40:04,371 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:40:04,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:40:04,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:40:04,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:40:04,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:40:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:40:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:40:04,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:40:04,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:40:04,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:40:04,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:40:04,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:40:04,447 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 3 states. [2018-10-02 11:40:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:40:04,498 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2018-10-02 11:40:04,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:40:04,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-02 11:40:04,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:40:04,500 INFO L225 Difference]: With dead ends: 59 [2018-10-02 11:40:04,500 INFO L226 Difference]: Without dead ends: 33 [2018-10-02 11:40:04,501 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-10-02 11:40:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-02 11:40:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-02 11:40:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-02 11:40:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-10-02 11:40:04,510 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 14 [2018-10-02 11:40:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:40:04,511 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-10-02 11:40:04,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:40:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2018-10-02 11:40:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:40:04,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:40:04,512 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:40:04,512 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:40:04,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:40:04,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1664872853, now seen corresponding path program 1 times [2018-10-02 11:40:04,513 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:40:04,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:40:04,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:40:04,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:40:04,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:40:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:40:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:40:04,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:40:04,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:40:04,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:40:04,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:40:04,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:40:04,628 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 3 states. [2018-10-02 11:40:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:40:04,702 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2018-10-02 11:40:04,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:40:04,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-02 11:40:04,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:40:04,707 INFO L225 Difference]: With dead ends: 85 [2018-10-02 11:40:04,707 INFO L226 Difference]: Without dead ends: 59 [2018-10-02 11:40:04,708 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-10-02 11:40:04,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-02 11:40:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-10-02 11:40:04,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-02 11:40:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2018-10-02 11:40:04,737 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 14 [2018-10-02 11:40:04,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:40:04,738 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2018-10-02 11:40:04,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:40:04,738 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2018-10-02 11:40:04,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:40:04,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:40:04,739 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:40:04,740 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:40:04,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:40:04,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1607614551, now seen corresponding path program 1 times [2018-10-02 11:40:04,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:40:04,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:40:04,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:40:04,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:40:04,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:40:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:40:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:40:04,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:40:04,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:40:04,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:40:04,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:40:04,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:40:04,880 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand 4 states. [2018-10-02 11:40:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:40:05,007 INFO L93 Difference]: Finished difference Result 113 states and 152 transitions. [2018-10-02 11:40:05,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:40:05,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-02 11:40:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:40:05,012 INFO L225 Difference]: With dead ends: 113 [2018-10-02 11:40:05,012 INFO L226 Difference]: Without dead ends: 111 [2018-10-02 11:40:05,013 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-10-02 11:40:05,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-02 11:40:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2018-10-02 11:40:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-02 11:40:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2018-10-02 11:40:05,035 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 14 [2018-10-02 11:40:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:40:05,035 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2018-10-02 11:40:05,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:40:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2018-10-02 11:40:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:40:05,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:40:05,036 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:40:05,038 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:40:05,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:40:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1607674133, now seen corresponding path program 1 times [2018-10-02 11:40:05,039 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:40:05,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:40:05,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:40:05,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:40:05,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:40:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:40:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:40:05,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:40:05,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:40:05,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:40:05,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:40:05,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:40:05,131 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand 4 states. [2018-10-02 11:40:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:40:05,339 INFO L93 Difference]: Finished difference Result 150 states and 195 transitions. [2018-10-02 11:40:05,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:40:05,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-02 11:40:05,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:40:05,342 INFO L225 Difference]: With dead ends: 150 [2018-10-02 11:40:05,342 INFO L226 Difference]: Without dead ends: 92 [2018-10-02 11:40:05,343 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-10-02 11:40:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-02 11:40:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 65. [2018-10-02 11:40:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-02 11:40:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2018-10-02 11:40:05,376 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 14 [2018-10-02 11:40:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:40:05,377 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2018-10-02 11:40:05,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:40:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2018-10-02 11:40:05,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 11:40:05,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:40:05,382 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-10-02 11:40:05,383 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:40:05,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:40:05,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1173123511, now seen corresponding path program 1 times [2018-10-02 11:40:05,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:40:05,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:40:05,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:40:05,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:40:05,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:40:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:40:05,678 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-02 11:40:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:40:05,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:40:05,682 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:40:05,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:40:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:40:05,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:40:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 11:40:05,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:40:05,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-02 11:40:05,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 11:40:05,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 11:40:05,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:40:05,842 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 6 states. [2018-10-02 11:40:06,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:40:06,273 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2018-10-02 11:40:06,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 11:40:06,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-10-02 11:40:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:40:06,274 INFO L225 Difference]: With dead ends: 119 [2018-10-02 11:40:06,274 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 11:40:06,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:40:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 11:40:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 11:40:06,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 11:40:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 11:40:06,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-10-02 11:40:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:40:06,277 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 11:40:06,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 11:40:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 11:40:06,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 11:40:06,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 11:40:06,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:06,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:40:07,359 WARN L178 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2018-10-02 11:40:07,787 WARN L178 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2018-10-02 11:40:07,905 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2018-10-02 11:40:08,104 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-10-02 11:40:08,210 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2018-10-02 11:40:08,762 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2018-10-02 11:40:08,765 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 313) no Hoare annotation was computed. [2018-10-02 11:40:08,766 INFO L421 ceAbstractionStarter]: At program point L219(lines 219 232) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse2 (<= ~r1 256)) (.cse1 (= ~mode2 0)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 (not (= (+ ~p2_old 1) 0)) .cse3) (and (<= 512 ~mode3) .cse1 (<= (+ ~r1 256) 0) .cse3))) [2018-10-02 11:40:08,767 INFO L421 ceAbstractionStarter]: At program point L281(lines 276 282) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse1 (<= ~r1 256)) (.cse2 (<= 1 ULTIMATE.start_check_~tmp~77)) (.cse4 (not (= (+ ~p2_old 1) 0))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~mode2 0) .cse1 .cse2 .cse3) (and (<= (+ ~r1 256) 0) .cse2 .cse4 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse3))) [2018-10-02 11:40:08,767 INFO L421 ceAbstractionStarter]: At program point L310(lines 191 310) the Hoare annotation is: (let ((.cse1 (= ~mode2 0)) (.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse2 (<= ~r1 256)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 512 ~mode3) .cse1 (<= (+ ~r1 256) 0) (<= (+ ~mode1 256) 0) .cse3) (and .cse0 .cse2 (not (= (+ ~p2_old 1) 0)) .cse3))) [2018-10-02 11:40:08,767 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 312) no Hoare annotation was computed. [2018-10-02 11:40:08,768 INFO L421 ceAbstractionStarter]: At program point L238(lines 231 239) the Hoare annotation is: (let ((.cse1 (<= 0 ~p2_new)) (.cse2 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse3 (<= ~r1 256)) (.cse0 (= 0 (+ ~nomsg 1)))) (or (and (<= 512 ~mode3) (<= (+ ~r1 256) 0) .cse0 .cse1) (and .cse2 .cse3 .cse0 .cse1) (and .cse2 (= ~mode2 0) .cse3 (not (= (+ ~p2_old 1) 0)) .cse0))) [2018-10-02 11:40:08,768 INFO L421 ceAbstractionStarter]: At program point L302(lines 302 308) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse1 (<= ~r1 256)) (.cse2 (not (= 0 |ULTIMATE.start_assert_#in~arg|))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~mode2 0) .cse1 .cse2 .cse3) (and .cse0 .cse1 (not (= (+ ~p2_old 1) 0)) .cse2 .cse3))) [2018-10-02 11:40:08,768 INFO L421 ceAbstractionStarter]: At program point L298(lines 294 299) the Hoare annotation is: (let ((.cse3 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse4 (<= ~r1 256)) (.cse0 (not (= (+ ~p2_old 1) 0))) (.cse1 (not (= 0 |ULTIMATE.start_assert_#in~arg|))) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (<= (+ ~r1 256) 0) (<= 1 ULTIMATE.start_check_~tmp~77) .cse0 .cse1 .cse2 (<= 1 ULTIMATE.start_main_~c1~84)) (and .cse3 (= ~mode2 0) .cse4 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse1 .cse2))) [2018-10-02 11:40:08,769 INFO L421 ceAbstractionStarter]: At program point L288(lines 288 295) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse1 (<= ~r1 256)) (.cse2 (<= 1 ULTIMATE.start_check_~tmp~77)) (.cse5 (not (= (+ ~p2_old 1) 0))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 1 ULTIMATE.start_main_~c1~84))) (or (and .cse0 (= ~mode2 0) .cse1 .cse2 .cse3 .cse4) (and (<= (+ ~r1 256) 0) .cse2 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3 .cse4))) [2018-10-02 11:40:08,769 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 313) no Hoare annotation was computed. [2018-10-02 11:40:08,769 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 313) no Hoare annotation was computed. [2018-10-02 11:40:08,769 INFO L421 ceAbstractionStarter]: At program point L214(lines 208 215) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse2 (<= ~r1 256)) (.cse1 (= ~mode2 0)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 (not (= (+ ~p2_old 1) 0)) .cse3) (and (<= 512 ~mode3) .cse1 (<= (+ ~r1 256) 0) .cse3))) [2018-10-02 11:40:08,769 INFO L421 ceAbstractionStarter]: At program point L243(lines 243 253) the Hoare annotation is: (let ((.cse1 (<= 0 ~p2_new)) (.cse2 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse3 (<= ~r1 256)) (.cse0 (= 0 (+ ~nomsg 1)))) (or (and (<= 512 ~mode3) (<= (+ ~r1 256) 0) .cse0 .cse1) (and .cse2 .cse3 .cse0 .cse1) (and .cse2 (= ~mode2 0) .cse3 (not (= (+ ~p2_old 1) 0)) .cse0))) [2018-10-02 11:40:08,770 INFO L421 ceAbstractionStarter]: At program point L307(lines 307 311) the Hoare annotation is: false [2018-10-02 11:40:08,770 INFO L421 ceAbstractionStarter]: At program point L270(lines 270 277) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse1 (<= ~r1 256)) (.cse3 (not (= (+ ~p2_old 1) 0))) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~mode2 0) .cse1 .cse2) (and (<= (+ ~r1 256) 0) .cse3 .cse2) (and .cse0 .cse1 .cse3 .cse2))) [2018-10-02 11:40:08,770 INFO L421 ceAbstractionStarter]: At program point L196(lines 196 209) the Hoare annotation is: (let ((.cse1 (= ~mode2 0)) (.cse0 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse2 (<= ~r1 256)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 512 ~mode3) .cse1 (<= (+ ~r1 256) 0) (<= (+ ~mode1 256) 0) .cse3) (and .cse0 .cse2 (not (= (+ ~p2_old 1) 0)) .cse3))) [2018-10-02 11:40:08,771 INFO L421 ceAbstractionStarter]: At program point L258(lines 252 259) the Hoare annotation is: (let ((.cse1 (<= 0 ~p2_new)) (.cse2 (not (= 0 ULTIMATE.start_assert_~arg))) (.cse3 (<= ~r1 256)) (.cse0 (= 0 (+ ~nomsg 1)))) (or (and (<= (+ ~r1 256) 0) .cse0 .cse1) (and .cse2 .cse3 .cse0 .cse1) (and .cse2 (= ~mode2 0) .cse3 (not (= (+ ~p2_old 1) 0)) .cse0))) [2018-10-02 11:40:08,790 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:40:08 BoogieIcfgContainer [2018-10-02 11:40:08,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:40:08,791 INFO L168 Benchmark]: Toolchain (without parser) took 5707.64 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 288.1 MB). Peak memory consumption was 288.1 MB. Max. memory is 7.1 GB. [2018-10-02 11:40:08,793 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:40:08,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.38 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:40:08,794 INFO L168 Benchmark]: Boogie Preprocessor took 53.94 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:40:08,794 INFO L168 Benchmark]: RCFGBuilder took 608.75 ms. Allocated memory is still 1.6 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-10-02 11:40:08,795 INFO L168 Benchmark]: TraceAbstraction took 4989.44 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 256.4 MB). Peak memory consumption was 256.4 MB. Max. memory is 7.1 GB. [2018-10-02 11:40:08,799 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.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.38 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.94 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 608.75 ms. Allocated memory is still 1.6 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 4989.44 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 256.4 MB). Peak memory consumption was 256.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 312]: 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: 219]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && 0 == ~nomsg + 1) || (((!(0 == assert_~arg) && ~r1 <= 256) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1)) || (((512 <= ~mode3 && ~mode2 == 0) && ~r1 + 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && 0 == ~nomsg + 1) || ((((512 <= ~mode3 && ~mode2 == 0) && ~r1 + 256 <= 0) && ~mode1 + 256 <= 0) && 0 == ~nomsg + 1)) || (((!(0 == assert_~arg) && ~r1 <= 256) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((512 <= ~mode3 && ~r1 + 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~p2_new) || (((!(0 == assert_~arg) && ~r1 <= 256) && 0 == ~nomsg + 1) && 0 <= ~p2_new)) || ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: ((((((~r1 + 256 <= 0 && 1 <= check_~tmp~77) && !(~p2_old + 1 == 0)) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) && 1 <= main_~c1~84) || ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1)) || ((((!(0 == assert_~arg) && ~r1 <= 256) && !(~p2_old + 1 == 0)) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && 1 <= check_~tmp~77) && 0 == ~nomsg + 1) && 1 <= main_~c1~84) || ((((~r1 + 256 <= 0 && 1 <= check_~tmp~77) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) && 1 <= main_~c1~84)) || (((((!(0 == assert_~arg) && ~r1 <= 256) && 1 <= check_~tmp~77) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) && 1 <= main_~c1~84) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && 0 == ~nomsg + 1) || (((!(0 == assert_~arg) && ~r1 <= 256) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1)) || (((512 <= ~mode3 && ~mode2 == 0) && ~r1 + 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 252]: Loop Invariant Derived loop invariant: (((~r1 + 256 <= 0 && 0 == ~nomsg + 1) && 0 <= ~p2_new) || (((!(0 == assert_~arg) && ~r1 <= 256) && 0 == ~nomsg + 1) && 0 <= ~p2_new)) || ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: ((((512 <= ~mode3 && ~r1 + 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~p2_new) || (((!(0 == assert_~arg) && ~r1 <= 256) && 0 == ~nomsg + 1) && 0 <= ~p2_new)) || ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && 0 == ~nomsg + 1) || ((~r1 + 256 <= 0 && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1)) || (((!(0 == assert_~arg) && ~r1 <= 256) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) || ((((!(0 == assert_~arg) && ~r1 <= 256) && !(~p2_old + 1 == 0)) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: (((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && 1 <= check_~tmp~77) && 0 == ~nomsg + 1) || (((~r1 + 256 <= 0 && 1 <= check_~tmp~77) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1)) || ((((!(0 == assert_~arg) && ~r1 <= 256) && 1 <= check_~tmp~77) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((!(0 == assert_~arg) && ~mode2 == 0) && ~r1 <= 256) && 0 == ~nomsg + 1) || ((((512 <= ~mode3 && ~mode2 == 0) && ~r1 + 256 <= 0) && ~mode1 + 256 <= 0) && 0 == ~nomsg + 1)) || (((!(0 == assert_~arg) && ~r1 <= 256) && !(~p2_old + 1 == 0)) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 4.9s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 157 SDtfs, 134 SDslu, 151 SDs, 0 SdLazy, 71 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 77 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 73 NumberOfFragments, 689 HoareAnnotationTreeSize, 13 FomulaSimplifications, 2131 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 33 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 7499 SizeOfPredicates, 1 NumberOfNonLiveVariables, 225 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 22/24 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.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-40-08-817.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bplTransformedIcfg_BEv2_26.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-40-08-817.csv Received shutdown request...