java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 17:12:06,996 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 17:12:06,998 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 17:12:07,010 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 17:12:07,011 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 17:12:07,012 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 17:12:07,013 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 17:12:07,015 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 17:12:07,017 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 17:12:07,018 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 17:12:07,019 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 17:12:07,019 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 17:12:07,020 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 17:12:07,021 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 17:12:07,022 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 17:12:07,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 17:12:07,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 17:12:07,026 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 17:12:07,028 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 17:12:07,030 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 17:12:07,031 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 17:12:07,032 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 17:12:07,037 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 17:12:07,038 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 17:12:07,041 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 17:12:07,042 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 17:12:07,045 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 17:12:07,047 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 17:12:07,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 17:12:07,053 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 17:12:07,055 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 17:12:07,056 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 17:12:07,056 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 17:12:07,056 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 17:12:07,059 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 17:12:07,060 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 17:12:07,061 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 17:12:07,091 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 17:12:07,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 17:12:07,093 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 17:12:07,093 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 17:12:07,094 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 17:12:07,094 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 17:12:07,094 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 17:12:07,096 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 17:12:07,096 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 17:12:07,096 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 17:12:07,096 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 17:12:07,096 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 17:12:07,097 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 17:12:07,097 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 17:12:07,097 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 17:12:07,097 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 17:12:07,097 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 17:12:07,099 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 17:12:07,099 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 17:12:07,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 17:12:07,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 17:12:07,100 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 17:12:07,100 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 17:12:07,100 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 17:12:07,100 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 17:12:07,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 17:12:07,101 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 17:12:07,101 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 17:12:07,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 17:12:07,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 17:12:07,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 17:12:07,183 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 17:12:07,183 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 17:12:07,184 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-24 17:12:07,247 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e38ce75b8/318c6bbe921640fa86c063e0583bf268/FLAG4e955930b [2018-10-24 17:12:07,733 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 17:12:07,734 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-24 17:12:07,757 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e38ce75b8/318c6bbe921640fa86c063e0583bf268/FLAG4e955930b [2018-10-24 17:12:07,771 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e38ce75b8/318c6bbe921640fa86c063e0583bf268 [2018-10-24 17:12:07,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 17:12:07,783 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 17:12:07,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 17:12:07,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 17:12:07,788 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 17:12:07,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:12:07" (1/1) ... [2018-10-24 17:12:07,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba4e0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:12:07, skipping insertion in model container [2018-10-24 17:12:07,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:12:07" (1/1) ... [2018-10-24 17:12:07,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 17:12:07,852 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 17:12:08,208 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 17:12:08,214 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 17:12:08,320 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 17:12:08,336 INFO L193 MainTranslator]: Completed translation [2018-10-24 17:12:08,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:12:08 WrapperNode [2018-10-24 17:12:08,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 17:12:08,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 17:12:08,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 17:12:08,338 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 17:12:08,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:12:08" (1/1) ... [2018-10-24 17:12:08,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:12:08" (1/1) ... [2018-10-24 17:12:08,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 17:12:08,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 17:12:08,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 17:12:08,448 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 17:12:08,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:12:08" (1/1) ... [2018-10-24 17:12:08,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:12:08" (1/1) ... [2018-10-24 17:12:08,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:12:08" (1/1) ... [2018-10-24 17:12:08,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:12:08" (1/1) ... [2018-10-24 17:12:08,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:12:08" (1/1) ... [2018-10-24 17:12:08,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:12:08" (1/1) ... [2018-10-24 17:12:08,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:12:08" (1/1) ... [2018-10-24 17:12:08,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 17:12:08,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 17:12:08,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 17:12:08,594 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 17:12:08,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:12:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-24 17:12:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 17:12:08,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 17:12:10,676 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 17:12:10,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:12:10 BoogieIcfgContainer [2018-10-24 17:12:10,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 17:12:10,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 17:12:10,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 17:12:10,681 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 17:12:10,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:12:07" (1/3) ... [2018-10-24 17:12:10,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6072d191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:12:10, skipping insertion in model container [2018-10-24 17:12:10,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:12:08" (2/3) ... [2018-10-24 17:12:10,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6072d191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:12:10, skipping insertion in model container [2018-10-24 17:12:10,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:12:10" (3/3) ... [2018-10-24 17:12:10,685 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-24 17:12:10,695 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 17:12:10,704 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 17:12:10,723 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 17:12:10,758 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 17:12:10,759 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 17:12:10,759 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 17:12:10,759 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 17:12:10,760 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 17:12:10,760 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 17:12:10,760 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 17:12:10,760 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 17:12:10,761 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 17:12:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-10-24 17:12:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-24 17:12:10,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:10,790 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:10,793 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:10,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:10,799 INFO L82 PathProgramCache]: Analyzing trace with hash 382154967, now seen corresponding path program 1 times [2018-10-24 17:12:10,802 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:10,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:10,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:10,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:10,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:10,970 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-24 17:12:10,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:10,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 17:12:10,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 17:12:10,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 17:12:10,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 17:12:10,993 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 2 states. [2018-10-24 17:12:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:11,026 INFO L93 Difference]: Finished difference Result 216 states and 416 transitions. [2018-10-24 17:12:11,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 17:12:11,028 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-10-24 17:12:11,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:11,042 INFO L225 Difference]: With dead ends: 216 [2018-10-24 17:12:11,042 INFO L226 Difference]: Without dead ends: 100 [2018-10-24 17:12:11,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 17:12:11,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-24 17:12:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-10-24 17:12:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-24 17:12:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 165 transitions. [2018-10-24 17:12:11,095 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 165 transitions. Word has length 9 [2018-10-24 17:12:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:11,095 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 165 transitions. [2018-10-24 17:12:11,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 17:12:11,096 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 165 transitions. [2018-10-24 17:12:11,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-24 17:12:11,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:11,097 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:11,097 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:11,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:11,098 INFO L82 PathProgramCache]: Analyzing trace with hash -505610424, now seen corresponding path program 1 times [2018-10-24 17:12:11,098 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:11,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:11,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:11,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:11,198 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-24 17:12:11,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:11,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:12:11,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:12:11,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:12:11,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:12:11,204 INFO L87 Difference]: Start difference. First operand 100 states and 165 transitions. Second operand 3 states. [2018-10-24 17:12:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:11,437 INFO L93 Difference]: Finished difference Result 201 states and 332 transitions. [2018-10-24 17:12:11,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:12:11,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-24 17:12:11,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:11,439 INFO L225 Difference]: With dead ends: 201 [2018-10-24 17:12:11,440 INFO L226 Difference]: Without dead ends: 103 [2018-10-24 17:12:11,441 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-10-24 17:12:11,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-24 17:12:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-10-24 17:12:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-24 17:12:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 168 transitions. [2018-10-24 17:12:11,453 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 168 transitions. Word has length 10 [2018-10-24 17:12:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:11,453 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 168 transitions. [2018-10-24 17:12:11,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:12:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 168 transitions. [2018-10-24 17:12:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-24 17:12:11,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:11,455 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:11,455 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:11,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:11,456 INFO L82 PathProgramCache]: Analyzing trace with hash -353906406, now seen corresponding path program 1 times [2018-10-24 17:12:11,456 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:11,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:11,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:11,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:11,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:11,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:12:11,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:12:11,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:12:11,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:12:11,656 INFO L87 Difference]: Start difference. First operand 103 states and 168 transitions. Second operand 3 states. [2018-10-24 17:12:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:12,405 INFO L93 Difference]: Finished difference Result 205 states and 334 transitions. [2018-10-24 17:12:12,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:12:12,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-24 17:12:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:12,409 INFO L225 Difference]: With dead ends: 205 [2018-10-24 17:12:12,410 INFO L226 Difference]: Without dead ends: 186 [2018-10-24 17:12:12,412 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-10-24 17:12:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-24 17:12:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-10-24 17:12:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-24 17:12:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 281 transitions. [2018-10-24 17:12:12,428 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 281 transitions. Word has length 15 [2018-10-24 17:12:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:12,428 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 281 transitions. [2018-10-24 17:12:12,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:12:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 281 transitions. [2018-10-24 17:12:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-24 17:12:12,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:12,430 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:12,430 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:12,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash 370083269, now seen corresponding path program 1 times [2018-10-24 17:12:12,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:12,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:12,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:12,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:12,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:12,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:12:12,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:12:12,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:12:12,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:12:12,543 INFO L87 Difference]: Start difference. First operand 172 states and 281 transitions. Second operand 3 states. [2018-10-24 17:12:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:12,660 INFO L93 Difference]: Finished difference Result 293 states and 477 transitions. [2018-10-24 17:12:12,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:12:12,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-24 17:12:12,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:12,664 INFO L225 Difference]: With dead ends: 293 [2018-10-24 17:12:12,664 INFO L226 Difference]: Without dead ends: 124 [2018-10-24 17:12:12,665 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-10-24 17:12:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-24 17:12:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-10-24 17:12:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-24 17:12:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2018-10-24 17:12:12,675 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 16 [2018-10-24 17:12:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:12,676 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2018-10-24 17:12:12,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:12:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2018-10-24 17:12:12,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 17:12:12,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:12,678 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:12,678 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:12,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:12,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1300763875, now seen corresponding path program 1 times [2018-10-24 17:12:12,678 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:12,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:12,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:12,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:12,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 17:12:12,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:12,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:12:12,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:12:12,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:12:12,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:12:12,769 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand 3 states. [2018-10-24 17:12:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:12,981 INFO L93 Difference]: Finished difference Result 226 states and 358 transitions. [2018-10-24 17:12:12,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:12:12,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-24 17:12:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:12,983 INFO L225 Difference]: With dead ends: 226 [2018-10-24 17:12:12,983 INFO L226 Difference]: Without dead ends: 107 [2018-10-24 17:12:12,984 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-10-24 17:12:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-24 17:12:12,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-10-24 17:12:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-24 17:12:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 163 transitions. [2018-10-24 17:12:12,992 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 163 transitions. Word has length 21 [2018-10-24 17:12:12,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:12,992 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 163 transitions. [2018-10-24 17:12:12,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:12:12,993 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 163 transitions. [2018-10-24 17:12:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 17:12:12,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:12,994 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:12,994 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:12,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1912385278, now seen corresponding path program 1 times [2018-10-24 17:12:12,995 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:12,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:12,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:12,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:12,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:13,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:13,322 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-24 17:12:13,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:13,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:13,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:12:13,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-24 17:12:13,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 17:12:13,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 17:12:13,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 17:12:13,567 INFO L87 Difference]: Start difference. First operand 105 states and 163 transitions. Second operand 4 states. [2018-10-24 17:12:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:14,278 INFO L93 Difference]: Finished difference Result 188 states and 295 transitions. [2018-10-24 17:12:14,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 17:12:14,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-10-24 17:12:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:14,280 INFO L225 Difference]: With dead ends: 188 [2018-10-24 17:12:14,280 INFO L226 Difference]: Without dead ends: 170 [2018-10-24 17:12:14,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 17:12:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-24 17:12:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-10-24 17:12:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-24 17:12:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 261 transitions. [2018-10-24 17:12:14,293 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 261 transitions. Word has length 23 [2018-10-24 17:12:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:14,294 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 261 transitions. [2018-10-24 17:12:14,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 17:12:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 261 transitions. [2018-10-24 17:12:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-24 17:12:14,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:14,295 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:14,296 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:14,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:14,296 INFO L82 PathProgramCache]: Analyzing trace with hash -834155009, now seen corresponding path program 1 times [2018-10-24 17:12:14,296 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:14,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:14,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:14,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:14,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:14,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:14,514 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 17:12:14,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:14,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:14,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:14,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:12:14,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2018-10-24 17:12:14,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 17:12:14,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 17:12:14,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 17:12:14,992 INFO L87 Difference]: Start difference. First operand 168 states and 261 transitions. Second operand 5 states. [2018-10-24 17:12:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:15,604 INFO L93 Difference]: Finished difference Result 226 states and 351 transitions. [2018-10-24 17:12:15,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 17:12:15,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-10-24 17:12:15,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:15,606 INFO L225 Difference]: With dead ends: 226 [2018-10-24 17:12:15,607 INFO L226 Difference]: Without dead ends: 222 [2018-10-24 17:12:15,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 17:12:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-24 17:12:15,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 213. [2018-10-24 17:12:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-24 17:12:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 335 transitions. [2018-10-24 17:12:15,618 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 335 transitions. Word has length 24 [2018-10-24 17:12:15,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:15,618 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 335 transitions. [2018-10-24 17:12:15,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 17:12:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 335 transitions. [2018-10-24 17:12:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-24 17:12:15,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:15,620 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:15,620 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:15,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:15,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1042801253, now seen corresponding path program 1 times [2018-10-24 17:12:15,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:15,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:15,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 17:12:15,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:15,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:12:15,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:12:15,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:12:15,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:12:15,689 INFO L87 Difference]: Start difference. First operand 213 states and 335 transitions. Second operand 3 states. [2018-10-24 17:12:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:15,762 INFO L93 Difference]: Finished difference Result 387 states and 604 transitions. [2018-10-24 17:12:15,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:12:15,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-24 17:12:15,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:15,764 INFO L225 Difference]: With dead ends: 387 [2018-10-24 17:12:15,765 INFO L226 Difference]: Without dead ends: 198 [2018-10-24 17:12:15,765 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-10-24 17:12:15,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-24 17:12:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-10-24 17:12:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-24 17:12:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 297 transitions. [2018-10-24 17:12:15,774 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 297 transitions. Word has length 25 [2018-10-24 17:12:15,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:15,775 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 297 transitions. [2018-10-24 17:12:15,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:12:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 297 transitions. [2018-10-24 17:12:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-24 17:12:15,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:15,776 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:15,776 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:15,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:15,777 INFO L82 PathProgramCache]: Analyzing trace with hash -235023744, now seen corresponding path program 1 times [2018-10-24 17:12:15,777 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:15,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:15,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:15,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:15,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:16,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:16,013 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 17:12:16,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:16,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 17:12:16,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 17:12:16,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-24 17:12:16,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 17:12:16,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 17:12:16,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 17:12:16,150 INFO L87 Difference]: Start difference. First operand 196 states and 297 transitions. Second operand 6 states. [2018-10-24 17:12:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:16,673 INFO L93 Difference]: Finished difference Result 353 states and 538 transitions. [2018-10-24 17:12:16,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 17:12:16,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-10-24 17:12:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:16,678 INFO L225 Difference]: With dead ends: 353 [2018-10-24 17:12:16,678 INFO L226 Difference]: Without dead ends: 337 [2018-10-24 17:12:16,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 17:12:16,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-24 17:12:16,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 308. [2018-10-24 17:12:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-24 17:12:16,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 467 transitions. [2018-10-24 17:12:16,693 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 467 transitions. Word has length 27 [2018-10-24 17:12:16,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:16,694 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 467 transitions. [2018-10-24 17:12:16,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 17:12:16,694 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 467 transitions. [2018-10-24 17:12:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-24 17:12:16,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:16,696 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:16,696 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:16,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:16,697 INFO L82 PathProgramCache]: Analyzing trace with hash 383091386, now seen corresponding path program 1 times [2018-10-24 17:12:16,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:16,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:16,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:16,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:16,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:16,783 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 17:12:16,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:16,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:12:16,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:12:16,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:12:16,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:12:16,788 INFO L87 Difference]: Start difference. First operand 308 states and 467 transitions. Second operand 3 states. [2018-10-24 17:12:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:17,061 INFO L93 Difference]: Finished difference Result 508 states and 774 transitions. [2018-10-24 17:12:17,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:12:17,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-10-24 17:12:17,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:17,063 INFO L225 Difference]: With dead ends: 508 [2018-10-24 17:12:17,064 INFO L226 Difference]: Without dead ends: 242 [2018-10-24 17:12:17,065 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-10-24 17:12:17,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-24 17:12:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-10-24 17:12:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-24 17:12:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 360 transitions. [2018-10-24 17:12:17,075 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 360 transitions. Word has length 33 [2018-10-24 17:12:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:17,075 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 360 transitions. [2018-10-24 17:12:17,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:12:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 360 transitions. [2018-10-24 17:12:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-24 17:12:17,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:17,077 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:17,077 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:17,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash -459847727, now seen corresponding path program 1 times [2018-10-24 17:12:17,078 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:17,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:17,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:17,343 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 17:12:17,513 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 17:12:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:17,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:17,610 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 17:12:17,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:17,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:17,777 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:17,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:12:17,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 6 [2018-10-24 17:12:17,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 17:12:17,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 17:12:17,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-24 17:12:17,807 INFO L87 Difference]: Start difference. First operand 240 states and 360 transitions. Second operand 6 states. [2018-10-24 17:12:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:18,167 INFO L93 Difference]: Finished difference Result 250 states and 369 transitions. [2018-10-24 17:12:18,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 17:12:18,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-10-24 17:12:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:18,172 INFO L225 Difference]: With dead ends: 250 [2018-10-24 17:12:18,172 INFO L226 Difference]: Without dead ends: 248 [2018-10-24 17:12:18,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-24 17:12:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-24 17:12:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 241. [2018-10-24 17:12:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-24 17:12:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 361 transitions. [2018-10-24 17:12:18,183 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 361 transitions. Word has length 36 [2018-10-24 17:12:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:18,184 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 361 transitions. [2018-10-24 17:12:18,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 17:12:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 361 transitions. [2018-10-24 17:12:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-24 17:12:18,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:18,186 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:18,190 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:18,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:18,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1245139925, now seen corresponding path program 1 times [2018-10-24 17:12:18,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:18,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:18,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:18,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:18,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 17:12:18,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:18,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:12:18,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:12:18,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:12:18,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:12:18,290 INFO L87 Difference]: Start difference. First operand 241 states and 361 transitions. Second operand 3 states. [2018-10-24 17:12:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:18,379 INFO L93 Difference]: Finished difference Result 424 states and 632 transitions. [2018-10-24 17:12:18,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:12:18,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-24 17:12:18,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:18,382 INFO L225 Difference]: With dead ends: 424 [2018-10-24 17:12:18,382 INFO L226 Difference]: Without dead ends: 225 [2018-10-24 17:12:18,383 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-10-24 17:12:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-24 17:12:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2018-10-24 17:12:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-24 17:12:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 324 transitions. [2018-10-24 17:12:18,392 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 324 transitions. Word has length 37 [2018-10-24 17:12:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:18,392 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 324 transitions. [2018-10-24 17:12:18,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:12:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 324 transitions. [2018-10-24 17:12:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-24 17:12:18,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:18,394 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:18,394 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:18,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:18,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2035819630, now seen corresponding path program 1 times [2018-10-24 17:12:18,394 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:18,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:18,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:18,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:18,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-24 17:12:18,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:18,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:12:18,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:12:18,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:12:18,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:12:18,484 INFO L87 Difference]: Start difference. First operand 223 states and 324 transitions. Second operand 3 states. [2018-10-24 17:12:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:18,742 INFO L93 Difference]: Finished difference Result 305 states and 442 transitions. [2018-10-24 17:12:18,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:12:18,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-24 17:12:18,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:18,744 INFO L225 Difference]: With dead ends: 305 [2018-10-24 17:12:18,744 INFO L226 Difference]: Without dead ends: 143 [2018-10-24 17:12:18,746 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-10-24 17:12:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-24 17:12:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-10-24 17:12:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-24 17:12:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 199 transitions. [2018-10-24 17:12:18,753 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 199 transitions. Word has length 46 [2018-10-24 17:12:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:18,754 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 199 transitions. [2018-10-24 17:12:18,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:12:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 199 transitions. [2018-10-24 17:12:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-24 17:12:18,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:18,756 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:18,756 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:18,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:18,757 INFO L82 PathProgramCache]: Analyzing trace with hash 360304136, now seen corresponding path program 1 times [2018-10-24 17:12:18,757 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:18,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:18,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:18,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:18,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 17:12:19,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:19,214 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 17:12:19,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:19,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:20,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:12:20,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-10-24 17:12:20,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 17:12:20,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 17:12:20,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-24 17:12:20,075 INFO L87 Difference]: Start difference. First operand 141 states and 199 transitions. Second operand 9 states. [2018-10-24 17:12:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:21,250 INFO L93 Difference]: Finished difference Result 184 states and 259 transitions. [2018-10-24 17:12:21,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 17:12:21,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-10-24 17:12:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:21,253 INFO L225 Difference]: With dead ends: 184 [2018-10-24 17:12:21,253 INFO L226 Difference]: Without dead ends: 180 [2018-10-24 17:12:21,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-24 17:12:21,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-24 17:12:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2018-10-24 17:12:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-24 17:12:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 250 transitions. [2018-10-24 17:12:21,263 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 250 transitions. Word has length 47 [2018-10-24 17:12:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:21,264 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 250 transitions. [2018-10-24 17:12:21,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 17:12:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 250 transitions. [2018-10-24 17:12:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-24 17:12:21,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:21,265 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:21,266 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:21,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:21,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1945779411, now seen corresponding path program 1 times [2018-10-24 17:12:21,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:21,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:21,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:21,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:21,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:21,555 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 17:12:21,718 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 17:12:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:21,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:21,915 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 17:12:21,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:22,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:22,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:12:22,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-10-24 17:12:22,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 17:12:22,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 17:12:22,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-24 17:12:22,358 INFO L87 Difference]: Start difference. First operand 177 states and 250 transitions. Second operand 8 states. [2018-10-24 17:12:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:23,113 INFO L93 Difference]: Finished difference Result 180 states and 253 transitions. [2018-10-24 17:12:23,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 17:12:23,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-10-24 17:12:23,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:23,117 INFO L225 Difference]: With dead ends: 180 [2018-10-24 17:12:23,117 INFO L226 Difference]: Without dead ends: 178 [2018-10-24 17:12:23,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-24 17:12:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-24 17:12:23,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-10-24 17:12:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-24 17:12:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 251 transitions. [2018-10-24 17:12:23,126 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 251 transitions. Word has length 57 [2018-10-24 17:12:23,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:23,126 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 251 transitions. [2018-10-24 17:12:23,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 17:12:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 251 transitions. [2018-10-24 17:12:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-24 17:12:23,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:23,128 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:23,128 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:23,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:23,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1406303924, now seen corresponding path program 1 times [2018-10-24 17:12:23,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:23,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:23,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:23,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:23,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:23,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:23,408 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 17:12:23,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:23,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:23,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:12:23,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-24 17:12:23,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 17:12:23,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 17:12:23,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-24 17:12:23,586 INFO L87 Difference]: Start difference. First operand 178 states and 251 transitions. Second operand 8 states. [2018-10-24 17:12:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:24,802 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2018-10-24 17:12:24,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 17:12:24,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2018-10-24 17:12:24,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:24,805 INFO L225 Difference]: With dead ends: 199 [2018-10-24 17:12:24,805 INFO L226 Difference]: Without dead ends: 196 [2018-10-24 17:12:24,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-24 17:12:24,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-24 17:12:24,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-10-24 17:12:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-24 17:12:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 276 transitions. [2018-10-24 17:12:24,820 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 276 transitions. Word has length 66 [2018-10-24 17:12:24,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:24,822 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 276 transitions. [2018-10-24 17:12:24,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 17:12:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 276 transitions. [2018-10-24 17:12:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-24 17:12:24,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:24,823 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:24,824 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:24,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:24,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2112986224, now seen corresponding path program 1 times [2018-10-24 17:12:24,824 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:24,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:24,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:24,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:24,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-24 17:12:25,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:25,589 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 17:12:25,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:25,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 89 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 17:12:25,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:12:25,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2018-10-24 17:12:25,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 17:12:25,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 17:12:25,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-24 17:12:25,969 INFO L87 Difference]: Start difference. First operand 196 states and 276 transitions. Second operand 12 states. [2018-10-24 17:12:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:26,457 INFO L93 Difference]: Finished difference Result 221 states and 308 transitions. [2018-10-24 17:12:26,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 17:12:26,457 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-10-24 17:12:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:26,459 INFO L225 Difference]: With dead ends: 221 [2018-10-24 17:12:26,459 INFO L226 Difference]: Without dead ends: 218 [2018-10-24 17:12:26,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-24 17:12:26,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-24 17:12:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2018-10-24 17:12:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-24 17:12:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 301 transitions. [2018-10-24 17:12:26,468 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 301 transitions. Word has length 75 [2018-10-24 17:12:26,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:26,469 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 301 transitions. [2018-10-24 17:12:26,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 17:12:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 301 transitions. [2018-10-24 17:12:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-24 17:12:26,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:26,470 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:26,471 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:26,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:26,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1844539294, now seen corresponding path program 1 times [2018-10-24 17:12:26,471 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:26,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:26,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:26,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:26,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:26,743 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 17:12:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:26,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:26,966 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 17:12:26,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:27,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:27,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:12:27,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2018-10-24 17:12:27,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 17:12:27,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 17:12:27,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-24 17:12:27,221 INFO L87 Difference]: Start difference. First operand 214 states and 301 transitions. Second operand 10 states. [2018-10-24 17:12:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:27,555 INFO L93 Difference]: Finished difference Result 217 states and 304 transitions. [2018-10-24 17:12:27,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 17:12:27,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-10-24 17:12:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:27,557 INFO L225 Difference]: With dead ends: 217 [2018-10-24 17:12:27,557 INFO L226 Difference]: Without dead ends: 215 [2018-10-24 17:12:27,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-24 17:12:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-24 17:12:27,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-10-24 17:12:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-24 17:12:27,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 302 transitions. [2018-10-24 17:12:27,566 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 302 transitions. Word has length 78 [2018-10-24 17:12:27,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:27,566 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 302 transitions. [2018-10-24 17:12:27,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 17:12:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 302 transitions. [2018-10-24 17:12:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-24 17:12:27,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:27,568 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:27,568 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:27,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:27,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1230156827, now seen corresponding path program 1 times [2018-10-24 17:12:27,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:27,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:27,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:27,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:27,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-24 17:12:28,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:28,385 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 17:12:28,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:28,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:29,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:12:29,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-10-24 17:12:29,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 17:12:29,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 17:12:29,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-24 17:12:29,683 INFO L87 Difference]: Start difference. First operand 215 states and 302 transitions. Second operand 15 states. [2018-10-24 17:12:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:29,853 INFO L93 Difference]: Finished difference Result 258 states and 362 transitions. [2018-10-24 17:12:29,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 17:12:29,854 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-10-24 17:12:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:29,856 INFO L225 Difference]: With dead ends: 258 [2018-10-24 17:12:29,856 INFO L226 Difference]: Without dead ends: 254 [2018-10-24 17:12:29,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-24 17:12:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-24 17:12:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-10-24 17:12:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-24 17:12:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 353 transitions. [2018-10-24 17:12:29,865 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 353 transitions. Word has length 89 [2018-10-24 17:12:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:29,865 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 353 transitions. [2018-10-24 17:12:29,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 17:12:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 353 transitions. [2018-10-24 17:12:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-24 17:12:29,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:29,867 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:29,867 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:29,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:29,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1466985856, now seen corresponding path program 2 times [2018-10-24 17:12:29,868 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:29,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:29,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:29,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:29,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:30,171 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 17:12:30,330 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 17:12:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:30,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:30,628 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 17:12:30,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 17:12:30,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 17:12:30,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:12:30,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:30,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:12:30,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 12 [2018-10-24 17:12:30,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 17:12:30,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 17:12:30,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-24 17:12:30,887 INFO L87 Difference]: Start difference. First operand 251 states and 353 transitions. Second operand 12 states. [2018-10-24 17:12:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:31,254 INFO L93 Difference]: Finished difference Result 254 states and 356 transitions. [2018-10-24 17:12:31,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 17:12:31,255 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-10-24 17:12:31,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:31,257 INFO L225 Difference]: With dead ends: 254 [2018-10-24 17:12:31,257 INFO L226 Difference]: Without dead ends: 252 [2018-10-24 17:12:31,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-24 17:12:31,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-10-24 17:12:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2018-10-24 17:12:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-24 17:12:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 354 transitions. [2018-10-24 17:12:31,268 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 354 transitions. Word has length 99 [2018-10-24 17:12:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:31,269 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 354 transitions. [2018-10-24 17:12:31,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 17:12:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 354 transitions. [2018-10-24 17:12:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-24 17:12:31,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:31,270 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:31,271 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:31,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash 284279897, now seen corresponding path program 2 times [2018-10-24 17:12:31,271 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:31,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:31,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:31,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:12:31,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:31,632 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 17:12:31,782 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 17:12:31,971 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 17:12:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 20 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:32,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:32,223 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 17:12:32,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 17:12:32,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 17:12:32,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:12:32,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 20 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:33,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:12:33,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 14 [2018-10-24 17:12:33,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 17:12:33,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 17:12:33,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-10-24 17:12:33,188 INFO L87 Difference]: Start difference. First operand 252 states and 354 transitions. Second operand 14 states. [2018-10-24 17:12:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:33,504 INFO L93 Difference]: Finished difference Result 273 states and 383 transitions. [2018-10-24 17:12:33,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 17:12:33,504 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 108 [2018-10-24 17:12:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:33,507 INFO L225 Difference]: With dead ends: 273 [2018-10-24 17:12:33,507 INFO L226 Difference]: Without dead ends: 270 [2018-10-24 17:12:33,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-10-24 17:12:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-24 17:12:33,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-10-24 17:12:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-24 17:12:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 379 transitions. [2018-10-24 17:12:33,519 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 379 transitions. Word has length 108 [2018-10-24 17:12:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:33,519 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 379 transitions. [2018-10-24 17:12:33,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 17:12:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 379 transitions. [2018-10-24 17:12:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-24 17:12:33,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:33,521 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:33,521 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:33,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:33,521 INFO L82 PathProgramCache]: Analyzing trace with hash -635420893, now seen corresponding path program 2 times [2018-10-24 17:12:33,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:33,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:33,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:33,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:12:33,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 22 proven. 248 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-24 17:12:33,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:33,839 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 17:12:33,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 17:12:33,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 17:12:33,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:12:33,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:34,145 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 22 proven. 248 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-24 17:12:34,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:12:34,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-10-24 17:12:34,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 17:12:34,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 17:12:34,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-24 17:12:34,167 INFO L87 Difference]: Start difference. First operand 270 states and 379 transitions. Second operand 10 states. [2018-10-24 17:12:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:34,524 INFO L93 Difference]: Finished difference Result 295 states and 411 transitions. [2018-10-24 17:12:34,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 17:12:34,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 117 [2018-10-24 17:12:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:34,529 INFO L225 Difference]: With dead ends: 295 [2018-10-24 17:12:34,529 INFO L226 Difference]: Without dead ends: 292 [2018-10-24 17:12:34,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-24 17:12:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-24 17:12:34,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2018-10-24 17:12:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-24 17:12:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 404 transitions. [2018-10-24 17:12:34,538 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 404 transitions. Word has length 117 [2018-10-24 17:12:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:34,539 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 404 transitions. [2018-10-24 17:12:34,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 17:12:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2018-10-24 17:12:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-24 17:12:34,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:34,540 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:34,541 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:34,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:34,541 INFO L82 PathProgramCache]: Analyzing trace with hash 873498411, now seen corresponding path program 2 times [2018-10-24 17:12:34,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:34,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:34,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:34,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:12:34,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:35,051 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 17:12:35,231 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 17:12:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 22 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:35,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:35,478 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 17:12:35,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 17:12:35,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 17:12:35,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:12:35,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 22 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:35,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:12:35,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 14 [2018-10-24 17:12:35,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 17:12:35,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 17:12:35,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-10-24 17:12:35,928 INFO L87 Difference]: Start difference. First operand 288 states and 404 transitions. Second operand 14 states. [2018-10-24 17:12:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:36,208 INFO L93 Difference]: Finished difference Result 291 states and 407 transitions. [2018-10-24 17:12:36,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 17:12:36,209 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-10-24 17:12:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:36,211 INFO L225 Difference]: With dead ends: 291 [2018-10-24 17:12:36,211 INFO L226 Difference]: Without dead ends: 289 [2018-10-24 17:12:36,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-10-24 17:12:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-24 17:12:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-10-24 17:12:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-24 17:12:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 405 transitions. [2018-10-24 17:12:36,220 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 405 transitions. Word has length 120 [2018-10-24 17:12:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:36,221 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 405 transitions. [2018-10-24 17:12:36,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 17:12:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 405 transitions. [2018-10-24 17:12:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-24 17:12:36,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:36,222 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:36,223 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:36,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:36,223 INFO L82 PathProgramCache]: Analyzing trace with hash -58240402, now seen corresponding path program 2 times [2018-10-24 17:12:36,223 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:36,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:36,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:36,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:12:36,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 318 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-24 17:12:36,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:36,715 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 17:12:36,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 17:12:36,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 17:12:36,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:12:36,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 339 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:37,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:12:37,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2018-10-24 17:12:37,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-24 17:12:37,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-24 17:12:37,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-10-24 17:12:37,125 INFO L87 Difference]: Start difference. First operand 289 states and 405 transitions. Second operand 21 states. [2018-10-24 17:12:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:37,503 INFO L93 Difference]: Finished difference Result 332 states and 465 transitions. [2018-10-24 17:12:37,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-24 17:12:37,503 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 131 [2018-10-24 17:12:37,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:37,508 INFO L225 Difference]: With dead ends: 332 [2018-10-24 17:12:37,508 INFO L226 Difference]: Without dead ends: 328 [2018-10-24 17:12:37,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-10-24 17:12:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-24 17:12:37,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 325. [2018-10-24 17:12:37,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-24 17:12:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 456 transitions. [2018-10-24 17:12:37,518 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 456 transitions. Word has length 131 [2018-10-24 17:12:37,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:37,518 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 456 transitions. [2018-10-24 17:12:37,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-24 17:12:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 456 transitions. [2018-10-24 17:12:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-24 17:12:37,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:37,520 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:37,520 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:37,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:37,521 INFO L82 PathProgramCache]: Analyzing trace with hash 102596627, now seen corresponding path program 3 times [2018-10-24 17:12:37,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:37,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:37,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:37,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:12:37,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:38,013 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 17:12:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 26 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:12:38,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:12:38,446 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 17:12:38,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 17:12:38,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-24 17:12:38,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:12:38,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:12:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 208 proven. 26 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-10-24 17:12:39,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:12:39,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7] total 21 [2018-10-24 17:12:39,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-24 17:12:39,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-24 17:12:39,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-10-24 17:12:39,064 INFO L87 Difference]: Start difference. First operand 325 states and 456 transitions. Second operand 21 states. [2018-10-24 17:12:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:39,844 INFO L93 Difference]: Finished difference Result 334 states and 466 transitions. [2018-10-24 17:12:39,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-24 17:12:39,844 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 141 [2018-10-24 17:12:39,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:39,845 INFO L225 Difference]: With dead ends: 334 [2018-10-24 17:12:39,845 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 17:12:39,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2018-10-24 17:12:39,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 17:12:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 17:12:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 17:12:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 17:12:39,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2018-10-24 17:12:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:39,848 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 17:12:39,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-24 17:12:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 17:12:39,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 17:12:39,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 17:12:39,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 17:12:40,080 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-24 17:12:40,434 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 38 [2018-10-24 17:12:40,438 INFO L425 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2018-10-24 17:12:40,438 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-10-24 17:12:40,438 INFO L425 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-10-24 17:12:40,438 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2018-10-24 17:12:40,438 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2018-10-24 17:12:40,438 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2018-10-24 17:12:40,438 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2018-10-24 17:12:40,438 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2018-10-24 17:12:40,438 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2018-10-24 17:12:40,438 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2018-10-24 17:12:40,438 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2018-10-24 17:12:40,439 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2018-10-24 17:12:40,439 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2018-10-24 17:12:40,439 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-10-24 17:12:40,439 INFO L425 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2018-10-24 17:12:40,439 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2018-10-24 17:12:40,439 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2018-10-24 17:12:40,439 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2018-10-24 17:12:40,439 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-10-24 17:12:40,439 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2018-10-24 17:12:40,439 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2018-10-24 17:12:40,439 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2018-10-24 17:12:40,440 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2018-10-24 17:12:40,440 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2018-10-24 17:12:40,440 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2018-10-24 17:12:40,440 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2018-10-24 17:12:40,440 INFO L425 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2018-10-24 17:12:40,440 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2018-10-24 17:12:40,441 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2018-10-24 17:12:40,441 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-10-24 17:12:40,441 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-10-24 17:12:40,441 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2018-10-24 17:12:40,441 INFO L425 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2018-10-24 17:12:40,441 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2018-10-24 17:12:40,441 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-10-24 17:12:40,441 INFO L428 ceAbstractionStarter]: At program point L14(lines 14 566) the Hoare annotation is: true [2018-10-24 17:12:40,442 INFO L425 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2018-10-24 17:12:40,442 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2018-10-24 17:12:40,442 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2018-10-24 17:12:40,442 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2018-10-24 17:12:40,442 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2018-10-24 17:12:40,442 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2018-10-24 17:12:40,442 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2018-10-24 17:12:40,442 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2018-10-24 17:12:40,442 INFO L425 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2018-10-24 17:12:40,443 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-10-24 17:12:40,443 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2018-10-24 17:12:40,443 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2018-10-24 17:12:40,443 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-24 17:12:40,443 INFO L425 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-10-24 17:12:40,443 INFO L421 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2018-10-24 17:12:40,443 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2018-10-24 17:12:40,443 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-10-24 17:12:40,443 INFO L425 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2018-10-24 17:12:40,443 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 17:12:40,444 INFO L421 ceAbstractionStarter]: At program point L24-3(lines 24 561) the Hoare annotation is: (let ((.cse0 (<= 0 ULTIMATE.start_main_~this_buffer_empty~0)) (.cse1 (<= ULTIMATE.start_main_~this_buffer_empty~0 0))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~this_expect~0) (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0) .cse1) (and .cse0 (<= 5 ULTIMATE.start_main_~q~0) (= 0 (mod ULTIMATE.start_main_~this_expect~0 2)) .cse1 (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648)) (<= ULTIMATE.start_main_~P8~0 2147483647)))) [2018-10-24 17:12:40,444 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 24 561) no Hoare annotation was computed. [2018-10-24 17:12:40,444 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2018-10-24 17:12:40,444 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 17:12:40,444 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2018-10-24 17:12:40,444 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2018-10-24 17:12:40,444 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2018-10-24 17:12:40,444 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2018-10-24 17:12:40,445 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2018-10-24 17:12:40,445 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2018-10-24 17:12:40,445 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2018-10-24 17:12:40,445 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2018-10-24 17:12:40,445 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2018-10-24 17:12:40,445 INFO L425 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2018-10-24 17:12:40,445 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2018-10-24 17:12:40,445 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2018-10-24 17:12:40,445 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-10-24 17:12:40,446 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2018-10-24 17:12:40,446 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2018-10-24 17:12:40,446 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 17:12:40,446 INFO L421 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse1 (= 0 (mod ULTIMATE.start_main_~this_expect~0 2))) (.cse5 (<= ULTIMATE.start_main_~this_buffer_empty~0 1)) (.cse6 (<= 1 ULTIMATE.start_main_~this_buffer_empty~0)) (.cse3 (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648))) (.cse7 (= (mod (+ ULTIMATE.start_main_~this_expect~0 1) 2) 0)) (.cse4 (<= ULTIMATE.start_main_~P8~0 2147483647)) (.cse0 (<= 0 ULTIMATE.start_main_~this_buffer_empty~0)) (.cse2 (<= ULTIMATE.start_main_~this_buffer_empty~0 0))) (or (and .cse0 (<= 5 ULTIMATE.start_main_~q~0) .cse1 .cse2 .cse3 .cse4) (and .cse1 (and (= ULTIMATE.start_main_~q~0 1) .cse5 .cse6 .cse3 .cse4)) (and .cse0 (= ULTIMATE.start_main_~q~0 3) .cse2 .cse3 .cse7 .cse4) (and .cse5 (= ULTIMATE.start_main_~q~0 4) .cse6 .cse3 .cse7 .cse4) (and .cse0 (<= 0 ULTIMATE.start_main_~this_expect~0) (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0) .cse2))) [2018-10-24 17:12:40,446 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2018-10-24 17:12:40,446 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2018-10-24 17:12:40,446 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2018-10-24 17:12:40,446 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2018-10-24 17:12:40,446 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2018-10-24 17:12:40,447 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2018-10-24 17:12:40,447 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2018-10-24 17:12:40,447 INFO L425 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2018-10-24 17:12:40,447 INFO L425 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2018-10-24 17:12:40,447 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2018-10-24 17:12:40,447 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2018-10-24 17:12:40,447 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2018-10-24 17:12:40,447 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2018-10-24 17:12:40,447 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2018-10-24 17:12:40,447 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2018-10-24 17:12:40,448 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2018-10-24 17:12:40,448 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-10-24 17:12:40,448 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2018-10-24 17:12:40,448 INFO L425 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2018-10-24 17:12:40,448 INFO L425 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2018-10-24 17:12:40,448 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2018-10-24 17:12:40,448 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2018-10-24 17:12:40,448 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 17:12:40,448 INFO L425 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2018-10-24 17:12:40,448 INFO L425 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2018-10-24 17:12:40,448 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2018-10-24 17:12:40,449 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-10-24 17:12:40,449 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-10-24 17:12:40,449 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2018-10-24 17:12:40,449 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2018-10-24 17:12:40,449 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2018-10-24 17:12:40,449 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2018-10-24 17:12:40,449 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-10-24 17:12:40,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:12:40 BoogieIcfgContainer [2018-10-24 17:12:40,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 17:12:40,471 INFO L168 Benchmark]: Toolchain (without parser) took 32688.32 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 63.3 MB. Max. memory is 7.1 GB. [2018-10-24 17:12:40,476 INFO L168 Benchmark]: CDTParser took 0.21 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-10-24 17:12:40,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 553.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-24 17:12:40,478 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 17:12:40,478 INFO L168 Benchmark]: Boogie Preprocessor took 145.43 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. [2018-10-24 17:12:40,479 INFO L168 Benchmark]: RCFGBuilder took 2083.70 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 81.9 MB). Peak memory consumption was 81.9 MB. Max. memory is 7.1 GB. [2018-10-24 17:12:40,480 INFO L168 Benchmark]: TraceAbstraction took 29791.75 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 344.5 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -305.4 MB). Peak memory consumption was 39.0 MB. Max. memory is 7.1 GB. [2018-10-24 17:12:40,493 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 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. * CACSL2BoogieTranslator took 553.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 109.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 145.43 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2083.70 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 81.9 MB). Peak memory consumption was 81.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29791.75 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 344.5 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -305.4 MB). Peak memory consumption was 39.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((0 <= this_buffer_empty && 0 <= this_expect) && this_expect <= 0) && q == 0) && this_buffer_empty <= 0) || (((((0 <= this_buffer_empty && 5 <= q) && 0 == this_expect % 2) && this_buffer_empty <= 0) && 0 <= P8 + 2147483648) && P8 <= 2147483647) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((((((0 <= this_buffer_empty && 5 <= q) && 0 == this_expect % 2) && this_buffer_empty <= 0) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || (0 == this_expect % 2 && (((q == 1 && this_buffer_empty <= 1) && 1 <= this_buffer_empty) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || (((((0 <= this_buffer_empty && q == 3) && this_buffer_empty <= 0) && 0 <= P8 + 2147483648) && (this_expect + 1) % 2 == 0) && P8 <= 2147483647)) || (((((this_buffer_empty <= 1 && q == 4) && 1 <= this_buffer_empty) && 0 <= P8 + 2147483648) && (this_expect + 1) % 2 == 0) && P8 <= 2147483647)) || ((((0 <= this_buffer_empty && 0 <= this_expect) && this_expect <= 0) && q == 0) && this_buffer_empty <= 0) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 1 error locations. SAFE Result, 29.7s OverallTime, 25 OverallIterations, 14 TraceHistogramMax, 11.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 4765 SDtfs, 3389 SDslu, 24231 SDs, 0 SdLazy, 2689 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1412 GetRequests, 1226 SyntacticMatches, 21 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=24, 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, 25 MinimizatonAttempts, 90 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 36 NumberOfFragments, 156 HoareAnnotationTreeSize, 4 FomulaSimplifications, 526 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 933 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 2688 NumberOfCodeBlocks, 2604 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2647 ConstructedInterpolants, 0 QuantifiedInterpolants, 2166749 SizeOfPredicates, 57 NumberOfNonLiveVariables, 7629 ConjunctsInSsa, 457 ConjunctsInUnsatCore, 41 InterpolantComputations, 10 PerfectInterpolantSequences, 1014/4848 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...