java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:18:52,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:18:52,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:18:52,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:18:52,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:18:52,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:18:52,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:18:52,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:18:52,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:18:52,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:18:52,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:18:52,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:18:52,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:18:52,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:18:52,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:18:52,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:18:52,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:18:52,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:18:52,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:18:52,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:18:52,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:18:52,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:18:52,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:18:52,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:18:52,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:18:52,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:18:52,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:18:52,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:18:52,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:18:52,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:18:52,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:18:52,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:18:52,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:18:52,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:18:52,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:18:52,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:18:52,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:18:52,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:18:52,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:18:52,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:18:52,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:18:52,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:18:52,778 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:18:52,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:18:52,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:18:52,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:18:52,780 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:18:52,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:18:52,781 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:18:52,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:18:52,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:18:52,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:18:52,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:18:52,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:18:52,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:18:52,782 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:18:52,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:18:52,782 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:18:52,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:18:52,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:18:52,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:18:52,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:18:52,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:18:52,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:18:52,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:18:52,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:18:52,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:18:52,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:18:52,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:18:52,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:18:52,785 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:18:52,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:18:52,828 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:18:52,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:18:52,833 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:18:52,834 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:18:52,834 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-10-02 11:18:52,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9766987/538b11fe5b40477fa37cea94a484f740/FLAGa622115de [2019-10-02 11:18:53,416 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:18:53,417 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-10-02 11:18:53,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9766987/538b11fe5b40477fa37cea94a484f740/FLAGa622115de [2019-10-02 11:18:53,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9766987/538b11fe5b40477fa37cea94a484f740 [2019-10-02 11:18:53,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:18:53,755 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:18:53,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:18:53,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:18:53,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:18:53,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:18:53" (1/1) ... [2019-10-02 11:18:53,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0511c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:53, skipping insertion in model container [2019-10-02 11:18:53,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:18:53" (1/1) ... [2019-10-02 11:18:53,770 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:18:53,828 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:18:54,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:18:54,308 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:18:54,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:18:54,407 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:18:54,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:54 WrapperNode [2019-10-02 11:18:54,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:18:54,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:18:54,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:18:54,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:18:54,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:54" (1/1) ... [2019-10-02 11:18:54,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:54" (1/1) ... [2019-10-02 11:18:54,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:54" (1/1) ... [2019-10-02 11:18:54,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:54" (1/1) ... [2019-10-02 11:18:54,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:54" (1/1) ... [2019-10-02 11:18:54,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:54" (1/1) ... [2019-10-02 11:18:54,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:54" (1/1) ... [2019-10-02 11:18:54,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:18:54,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:18:54,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:18:54,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:18:54,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:18:54,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:18:54,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:18:54,566 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:18:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:18:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:18:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:18:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:18:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:18:54,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:18:54,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:18:55,491 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:18:55,492 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 11:18:55,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:18:55 BoogieIcfgContainer [2019-10-02 11:18:55,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:18:55,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:18:55,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:18:55,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:18:55,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:18:53" (1/3) ... [2019-10-02 11:18:55,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1277618d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:18:55, skipping insertion in model container [2019-10-02 11:18:55,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:54" (2/3) ... [2019-10-02 11:18:55,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1277618d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:18:55, skipping insertion in model container [2019-10-02 11:18:55,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:18:55" (3/3) ... [2019-10-02 11:18:55,503 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2019-10-02 11:18:55,515 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:18:55,524 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:18:55,544 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:18:55,580 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:18:55,581 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:18:55,581 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:18:55,581 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:18:55,582 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:18:55,582 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:18:55,582 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:18:55,583 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:18:55,583 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:18:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-02 11:18:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:18:55,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:55,625 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:55,628 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:55,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1537709744, now seen corresponding path program 1 times [2019-10-02 11:18:55,637 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:55,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:55,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:55,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:55,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:55,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:55,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:18:55,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:18:55,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:18:55,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:18:55,909 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2019-10-02 11:18:56,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:56,514 INFO L93 Difference]: Finished difference Result 290 states and 560 transitions. [2019-10-02 11:18:56,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:18:56,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-10-02 11:18:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:56,535 INFO L225 Difference]: With dead ends: 290 [2019-10-02 11:18:56,536 INFO L226 Difference]: Without dead ends: 145 [2019-10-02 11:18:56,545 INFO L640 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 [2019-10-02 11:18:56,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-02 11:18:56,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-10-02 11:18:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-02 11:18:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-10-02 11:18:56,637 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 143 [2019-10-02 11:18:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:56,637 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-10-02 11:18:56,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:18:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-10-02 11:18:56,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:18:56,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:56,650 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:56,650 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:56,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:56,651 INFO L82 PathProgramCache]: Analyzing trace with hash 470480343, now seen corresponding path program 1 times [2019-10-02 11:18:56,651 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:56,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:56,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:56,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:56,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:56,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:56,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:18:56,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:18:56,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:18:56,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:18:56,756 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-10-02 11:18:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:57,367 INFO L93 Difference]: Finished difference Result 410 states and 609 transitions. [2019-10-02 11:18:57,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:18:57,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-10-02 11:18:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:57,374 INFO L225 Difference]: With dead ends: 410 [2019-10-02 11:18:57,374 INFO L226 Difference]: Without dead ends: 277 [2019-10-02 11:18:57,378 INFO L640 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 [2019-10-02 11:18:57,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-10-02 11:18:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2019-10-02 11:18:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-10-02 11:18:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 345 transitions. [2019-10-02 11:18:57,410 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 345 transitions. Word has length 143 [2019-10-02 11:18:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:57,410 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 345 transitions. [2019-10-02 11:18:57,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:18:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 345 transitions. [2019-10-02 11:18:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:18:57,413 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:57,413 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:57,413 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:57,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:57,414 INFO L82 PathProgramCache]: Analyzing trace with hash 859387544, now seen corresponding path program 1 times [2019-10-02 11:18:57,414 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:57,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:57,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:57,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:57,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:59,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:59,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-02 11:18:59,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-02 11:18:59,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-02 11:18:59,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2036, Invalid=2656, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:18:59,932 INFO L87 Difference]: Start difference. First operand 277 states and 345 transitions. Second operand 69 states. [2019-10-02 11:19:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:00,791 INFO L93 Difference]: Finished difference Result 404 states and 472 transitions. [2019-10-02 11:19:00,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:19:00,792 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-02 11:19:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:00,795 INFO L225 Difference]: With dead ends: 404 [2019-10-02 11:19:00,795 INFO L226 Difference]: Without dead ends: 269 [2019-10-02 11:19:00,802 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2036, Invalid=2656, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:19:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-02 11:19:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-10-02 11:19:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-10-02 11:19:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2019-10-02 11:19:00,840 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 143 [2019-10-02 11:19:00,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:00,841 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2019-10-02 11:19:00,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-02 11:19:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2019-10-02 11:19:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:19:00,851 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:00,851 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:00,852 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:00,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:00,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1284631305, now seen corresponding path program 1 times [2019-10-02 11:19:00,852 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:00,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:00,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:00,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:00,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:03,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:19:03,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-02 11:19:03,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-02 11:19:03,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-02 11:19:03,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1980, Invalid=2712, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:19:03,255 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 69 states. [2019-10-02 11:19:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:04,327 INFO L93 Difference]: Finished difference Result 394 states and 458 transitions. [2019-10-02 11:19:04,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:19:04,333 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-02 11:19:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:04,335 INFO L225 Difference]: With dead ends: 394 [2019-10-02 11:19:04,335 INFO L226 Difference]: Without dead ends: 267 [2019-10-02 11:19:04,339 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1980, Invalid=2712, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:19:04,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-10-02 11:19:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2019-10-02 11:19:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-02 11:19:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 330 transitions. [2019-10-02 11:19:04,357 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 330 transitions. Word has length 143 [2019-10-02 11:19:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:04,360 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 330 transitions. [2019-10-02 11:19:04,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-02 11:19:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 330 transitions. [2019-10-02 11:19:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:19:04,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:04,362 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:04,363 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:04,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:04,363 INFO L82 PathProgramCache]: Analyzing trace with hash 698919756, now seen corresponding path program 1 times [2019-10-02 11:19:04,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:04,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:04,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:04,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:04,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:06,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:19:06,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-02 11:19:06,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-02 11:19:06,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-02 11:19:06,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1926, Invalid=2766, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:19:06,021 INFO L87 Difference]: Start difference. First operand 267 states and 330 transitions. Second operand 69 states. [2019-10-02 11:19:07,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:07,231 INFO L93 Difference]: Finished difference Result 390 states and 453 transitions. [2019-10-02 11:19:07,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:19:07,232 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-02 11:19:07,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:07,235 INFO L225 Difference]: With dead ends: 390 [2019-10-02 11:19:07,235 INFO L226 Difference]: Without dead ends: 265 [2019-10-02 11:19:07,238 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1926, Invalid=2766, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:19:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-10-02 11:19:07,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2019-10-02 11:19:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-10-02 11:19:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2019-10-02 11:19:07,249 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 143 [2019-10-02 11:19:07,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:07,249 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2019-10-02 11:19:07,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-02 11:19:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2019-10-02 11:19:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:19:07,251 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:07,251 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:07,252 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:07,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:07,252 INFO L82 PathProgramCache]: Analyzing trace with hash 2054450191, now seen corresponding path program 1 times [2019-10-02 11:19:07,252 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:07,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:07,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:07,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:07,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:08,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:19:08,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-02 11:19:08,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-02 11:19:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-02 11:19:08,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1776, Invalid=2916, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:19:08,866 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand 69 states. [2019-10-02 11:19:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:10,238 INFO L93 Difference]: Finished difference Result 382 states and 444 transitions. [2019-10-02 11:19:10,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:19:10,239 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-02 11:19:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:10,241 INFO L225 Difference]: With dead ends: 382 [2019-10-02 11:19:10,241 INFO L226 Difference]: Without dead ends: 259 [2019-10-02 11:19:10,243 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1776, Invalid=2916, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:19:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-02 11:19:10,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-10-02 11:19:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-02 11:19:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 318 transitions. [2019-10-02 11:19:10,252 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 318 transitions. Word has length 143 [2019-10-02 11:19:10,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:10,253 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 318 transitions. [2019-10-02 11:19:10,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-02 11:19:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 318 transitions. [2019-10-02 11:19:10,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:19:10,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:10,254 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:10,255 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:10,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:10,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1013609311, now seen corresponding path program 1 times [2019-10-02 11:19:10,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:10,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:10,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:10,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:10,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:11,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:19:11,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-02 11:19:11,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-02 11:19:11,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-02 11:19:11,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1686, Invalid=3006, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:19:11,858 INFO L87 Difference]: Start difference. First operand 259 states and 318 transitions. Second operand 69 states. [2019-10-02 11:19:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:13,351 INFO L93 Difference]: Finished difference Result 372 states and 431 transitions. [2019-10-02 11:19:13,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:19:13,353 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-02 11:19:13,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:13,355 INFO L225 Difference]: With dead ends: 372 [2019-10-02 11:19:13,355 INFO L226 Difference]: Without dead ends: 255 [2019-10-02 11:19:13,363 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1686, Invalid=3006, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:19:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-02 11:19:13,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-10-02 11:19:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-10-02 11:19:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2019-10-02 11:19:13,375 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 143 [2019-10-02 11:19:13,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:13,378 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2019-10-02 11:19:13,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-02 11:19:13,378 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2019-10-02 11:19:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:19:13,380 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:13,381 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:13,382 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:13,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:13,382 INFO L82 PathProgramCache]: Analyzing trace with hash 560132216, now seen corresponding path program 1 times [2019-10-02 11:19:13,382 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:13,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:13,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:13,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:13,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:15,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:19:15,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-02 11:19:15,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-02 11:19:15,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-02 11:19:15,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1644, Invalid=3048, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:19:15,141 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 69 states. [2019-10-02 11:19:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:16,510 INFO L93 Difference]: Finished difference Result 366 states and 423 transitions. [2019-10-02 11:19:16,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:19:16,511 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-02 11:19:16,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:16,514 INFO L225 Difference]: With dead ends: 366 [2019-10-02 11:19:16,514 INFO L226 Difference]: Without dead ends: 253 [2019-10-02 11:19:16,516 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1644, Invalid=3048, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:19:16,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-02 11:19:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-10-02 11:19:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-02 11:19:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2019-10-02 11:19:16,524 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 143 [2019-10-02 11:19:16,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:16,524 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2019-10-02 11:19:16,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-02 11:19:16,525 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2019-10-02 11:19:16,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:19:16,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:16,526 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:16,527 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:16,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:16,527 INFO L82 PathProgramCache]: Analyzing trace with hash 752755852, now seen corresponding path program 1 times [2019-10-02 11:19:16,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:16,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:16,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:16,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:16,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:18,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:19:18,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-02 11:19:18,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-02 11:19:18,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-02 11:19:18,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:19:18,058 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand 69 states. [2019-10-02 11:19:19,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:19,911 INFO L93 Difference]: Finished difference Result 360 states and 416 transitions. [2019-10-02 11:19:19,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 11:19:19,911 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-02 11:19:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:19,914 INFO L225 Difference]: With dead ends: 360 [2019-10-02 11:19:19,914 INFO L226 Difference]: Without dead ends: 249 [2019-10-02 11:19:19,916 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:19:19,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-10-02 11:19:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-10-02 11:19:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-02 11:19:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions. [2019-10-02 11:19:19,924 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 143 [2019-10-02 11:19:19,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:19,925 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 303 transitions. [2019-10-02 11:19:19,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-02 11:19:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions. [2019-10-02 11:19:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:19:19,927 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:19,927 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:19,928 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:19,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:19,928 INFO L82 PathProgramCache]: Analyzing trace with hash -553376648, now seen corresponding path program 1 times [2019-10-02 11:19:19,928 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:19,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:19,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:19,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:19,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:22,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:19:22,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-02 11:19:22,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-02 11:19:22,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-02 11:19:22,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1496, Invalid=3196, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:19:22,051 INFO L87 Difference]: Start difference. First operand 249 states and 303 transitions. Second operand 69 states. [2019-10-02 11:19:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:23,948 INFO L93 Difference]: Finished difference Result 352 states and 406 transitions. [2019-10-02 11:19:23,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:19:23,948 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-02 11:19:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:23,951 INFO L225 Difference]: With dead ends: 352 [2019-10-02 11:19:23,951 INFO L226 Difference]: Without dead ends: 245 [2019-10-02 11:19:23,952 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1496, Invalid=3196, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:19:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-02 11:19:23,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-10-02 11:19:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-02 11:19:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 297 transitions. [2019-10-02 11:19:23,960 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 297 transitions. Word has length 143 [2019-10-02 11:19:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:23,961 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 297 transitions. [2019-10-02 11:19:23,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-02 11:19:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 297 transitions. [2019-10-02 11:19:23,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:19:23,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:23,966 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:23,967 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:23,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:23,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1465640920, now seen corresponding path program 1 times [2019-10-02 11:19:23,970 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:23,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:23,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:23,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:23,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:26,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:19:26,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2019-10-02 11:19:26,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-02 11:19:26,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-02 11:19:26,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-10-02 11:19:26,268 INFO L87 Difference]: Start difference. First operand 245 states and 297 transitions. Second operand 70 states. [2019-10-02 11:19:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:32,421 INFO L93 Difference]: Finished difference Result 556 states and 625 transitions. [2019-10-02 11:19:32,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-02 11:19:32,422 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 143 [2019-10-02 11:19:32,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:32,424 INFO L225 Difference]: With dead ends: 556 [2019-10-02 11:19:32,424 INFO L226 Difference]: Without dead ends: 453 [2019-10-02 11:19:32,425 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-10-02 11:19:32,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-02 11:19:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2019-10-02 11:19:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-02 11:19:32,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 470 transitions. [2019-10-02 11:19:32,443 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 470 transitions. Word has length 143 [2019-10-02 11:19:32,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:32,445 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 470 transitions. [2019-10-02 11:19:32,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-02 11:19:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 470 transitions. [2019-10-02 11:19:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 11:19:32,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:32,448 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:32,448 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash -87860138, now seen corresponding path program 1 times [2019-10-02 11:19:32,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:32,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:32,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:32,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:32,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:34,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:34,468 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:19:34,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:34,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 70 conjunts are in the unsatisfiable core [2019-10-02 11:19:34,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:34,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:34,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-10-02 11:19:34,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-10-02 11:19:34,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-10-02 11:19:34,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-10-02 11:19:34,765 INFO L87 Difference]: Start difference. First operand 452 states and 470 transitions. Second operand 71 states. [2019-10-02 11:19:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:43,546 INFO L93 Difference]: Finished difference Result 458 states and 476 transitions. [2019-10-02 11:19:43,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-10-02 11:19:43,547 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 145 [2019-10-02 11:19:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:43,550 INFO L225 Difference]: With dead ends: 458 [2019-10-02 11:19:43,551 INFO L226 Difference]: Without dead ends: 455 [2019-10-02 11:19:43,551 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-10-02 11:19:43,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-10-02 11:19:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 454. [2019-10-02 11:19:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-10-02 11:19:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 472 transitions. [2019-10-02 11:19:43,572 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 472 transitions. Word has length 145 [2019-10-02 11:19:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:43,573 INFO L475 AbstractCegarLoop]: Abstraction has 454 states and 472 transitions. [2019-10-02 11:19:43,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-10-02 11:19:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 472 transitions. [2019-10-02 11:19:43,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 11:19:43,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:43,577 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:43,577 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:43,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:43,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1458227952, now seen corresponding path program 2 times [2019-10-02 11:19:43,578 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:43,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:43,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:43,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:19:43,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:45,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:45,488 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:19:45,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:19:45,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:19:45,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:45,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 71 conjunts are in the unsatisfiable core [2019-10-02 11:19:45,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 11:19:45,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:45,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2019-10-02 11:19:45,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-02 11:19:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-02 11:19:45,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-10-02 11:19:45,679 INFO L87 Difference]: Start difference. First operand 454 states and 472 transitions. Second operand 72 states. [2019-10-02 11:19:50,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:19:50,414 INFO L93 Difference]: Finished difference Result 460 states and 478 transitions. [2019-10-02 11:19:50,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-02 11:19:50,414 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 147 [2019-10-02 11:19:50,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:19:50,418 INFO L225 Difference]: With dead ends: 460 [2019-10-02 11:19:50,418 INFO L226 Difference]: Without dead ends: 457 [2019-10-02 11:19:50,419 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-10-02 11:19:50,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-10-02 11:19:50,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 456. [2019-10-02 11:19:50,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-02 11:19:50,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 474 transitions. [2019-10-02 11:19:50,433 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 474 transitions. Word has length 147 [2019-10-02 11:19:50,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:19:50,433 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 474 transitions. [2019-10-02 11:19:50,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-02 11:19:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 474 transitions. [2019-10-02 11:19:50,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 11:19:50,435 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:19:50,436 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:19:50,436 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:19:50,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:19:50,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1190198026, now seen corresponding path program 3 times [2019-10-02 11:19:50,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:19:50,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:19:50,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:50,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:19:50,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:19:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:19:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:52,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:19:52,626 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-10-02 11:19:52,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:19:52,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 11:19:52,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:19:52,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 72 conjunts are in the unsatisfiable core [2019-10-02 11:19:52,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:19:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:19:52,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:19:52,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-10-02 11:19:52,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-02 11:19:52,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-02 11:19:52,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 11:19:52,779 INFO L87 Difference]: Start difference. First operand 456 states and 474 transitions. Second operand 73 states. [2019-10-02 11:20:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:01,231 INFO L93 Difference]: Finished difference Result 462 states and 480 transitions. [2019-10-02 11:20:01,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-02 11:20:01,232 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 149 [2019-10-02 11:20:01,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:01,235 INFO L225 Difference]: With dead ends: 462 [2019-10-02 11:20:01,236 INFO L226 Difference]: Without dead ends: 459 [2019-10-02 11:20:01,236 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 11:20:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-10-02 11:20:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 458. [2019-10-02 11:20:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-10-02 11:20:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 476 transitions. [2019-10-02 11:20:01,249 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 476 transitions. Word has length 149 [2019-10-02 11:20:01,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:01,249 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 476 transitions. [2019-10-02 11:20:01,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-02 11:20:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 476 transitions. [2019-10-02 11:20:01,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 11:20:01,251 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:01,251 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:01,252 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:01,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:01,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1311476900, now seen corresponding path program 4 times [2019-10-02 11:20:01,252 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:01,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:01,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:03,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:03,313 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-10-02 11:20:03,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:20:03,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:20:03,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:03,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 73 conjunts are in the unsatisfiable core [2019-10-02 11:20:03,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:03,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:03,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2019-10-02 11:20:03,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-10-02 11:20:03,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-10-02 11:20:03,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-10-02 11:20:03,491 INFO L87 Difference]: Start difference. First operand 458 states and 476 transitions. Second operand 74 states. [2019-10-02 11:20:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:11,944 INFO L93 Difference]: Finished difference Result 464 states and 482 transitions. [2019-10-02 11:20:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-10-02 11:20:11,945 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 151 [2019-10-02 11:20:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:11,948 INFO L225 Difference]: With dead ends: 464 [2019-10-02 11:20:11,948 INFO L226 Difference]: Without dead ends: 461 [2019-10-02 11:20:11,949 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-10-02 11:20:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-10-02 11:20:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 460. [2019-10-02 11:20:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-10-02 11:20:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 478 transitions. [2019-10-02 11:20:11,961 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 478 transitions. Word has length 151 [2019-10-02 11:20:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:11,962 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 478 transitions. [2019-10-02 11:20:11,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-10-02 11:20:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 478 transitions. [2019-10-02 11:20:11,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 11:20:11,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:11,964 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:11,964 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:11,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:11,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1896357822, now seen corresponding path program 5 times [2019-10-02 11:20:11,965 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:11,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:11,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:11,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:14,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:14,085 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-10-02 11:20:14,139 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:20:14,194 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-02 11:20:14,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:14,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 74 conjunts are in the unsatisfiable core [2019-10-02 11:20:14,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:14,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:14,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2019-10-02 11:20:14,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-02 11:20:14,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-02 11:20:14,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-10-02 11:20:14,264 INFO L87 Difference]: Start difference. First operand 460 states and 478 transitions. Second operand 75 states. [2019-10-02 11:20:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:22,670 INFO L93 Difference]: Finished difference Result 466 states and 484 transitions. [2019-10-02 11:20:22,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-10-02 11:20:22,670 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 153 [2019-10-02 11:20:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:22,674 INFO L225 Difference]: With dead ends: 466 [2019-10-02 11:20:22,674 INFO L226 Difference]: Without dead ends: 463 [2019-10-02 11:20:22,675 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-10-02 11:20:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-10-02 11:20:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 462. [2019-10-02 11:20:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-10-02 11:20:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 480 transitions. [2019-10-02 11:20:22,686 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 480 transitions. Word has length 153 [2019-10-02 11:20:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:22,687 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 480 transitions. [2019-10-02 11:20:22,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-02 11:20:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 480 transitions. [2019-10-02 11:20:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 11:20:22,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:22,689 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:22,689 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:22,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:22,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1326208088, now seen corresponding path program 6 times [2019-10-02 11:20:22,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:22,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:22,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:22,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:22,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:25,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:25,213 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-10-02 11:20:25,273 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:20:25,329 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-02 11:20:25,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:25,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 75 conjunts are in the unsatisfiable core [2019-10-02 11:20:25,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:20:25,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:25,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2019-10-02 11:20:25,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-02 11:20:25,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-02 11:20:25,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-10-02 11:20:25,391 INFO L87 Difference]: Start difference. First operand 462 states and 480 transitions. Second operand 76 states. [2019-10-02 11:20:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:33,823 INFO L93 Difference]: Finished difference Result 468 states and 486 transitions. [2019-10-02 11:20:33,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-02 11:20:33,824 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 155 [2019-10-02 11:20:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:33,827 INFO L225 Difference]: With dead ends: 468 [2019-10-02 11:20:33,827 INFO L226 Difference]: Without dead ends: 465 [2019-10-02 11:20:33,828 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-10-02 11:20:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-10-02 11:20:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 464. [2019-10-02 11:20:33,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-10-02 11:20:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 482 transitions. [2019-10-02 11:20:33,840 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 482 transitions. Word has length 155 [2019-10-02 11:20:33,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:33,841 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 482 transitions. [2019-10-02 11:20:33,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-10-02 11:20:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 482 transitions. [2019-10-02 11:20:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 11:20:33,842 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:33,843 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:33,843 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:33,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:33,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1126839694, now seen corresponding path program 7 times [2019-10-02 11:20:33,843 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:33,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:33,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:33,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:33,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:36,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:36,026 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-10-02 11:20:36,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:20:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:36,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 76 conjunts are in the unsatisfiable core [2019-10-02 11:20:36,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:36,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:36,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2019-10-02 11:20:36,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-10-02 11:20:36,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-10-02 11:20:36,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-10-02 11:20:36,195 INFO L87 Difference]: Start difference. First operand 464 states and 482 transitions. Second operand 77 states. [2019-10-02 11:20:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:44,587 INFO L93 Difference]: Finished difference Result 470 states and 488 transitions. [2019-10-02 11:20:44,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-02 11:20:44,588 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 157 [2019-10-02 11:20:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:44,590 INFO L225 Difference]: With dead ends: 470 [2019-10-02 11:20:44,591 INFO L226 Difference]: Without dead ends: 467 [2019-10-02 11:20:44,591 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-10-02 11:20:44,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-10-02 11:20:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 466. [2019-10-02 11:20:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-02 11:20:44,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 484 transitions. [2019-10-02 11:20:44,603 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 484 transitions. Word has length 157 [2019-10-02 11:20:44,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:44,603 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 484 transitions. [2019-10-02 11:20:44,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-10-02 11:20:44,604 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 484 transitions. [2019-10-02 11:20:44,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 11:20:44,605 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:44,605 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:44,606 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:44,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:44,606 INFO L82 PathProgramCache]: Analyzing trace with hash -568712692, now seen corresponding path program 8 times [2019-10-02 11:20:44,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:44,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:44,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:44,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:20:44,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:47,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:47,169 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-10-02 11:20:47,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:20:47,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:20:47,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:47,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 77 conjunts are in the unsatisfiable core [2019-10-02 11:20:47,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:47,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:47,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2019-10-02 11:20:47,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-10-02 11:20:47,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-10-02 11:20:47,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-10-02 11:20:47,350 INFO L87 Difference]: Start difference. First operand 466 states and 484 transitions. Second operand 78 states. [2019-10-02 11:20:55,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:55,821 INFO L93 Difference]: Finished difference Result 472 states and 490 transitions. [2019-10-02 11:20:55,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-10-02 11:20:55,821 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 159 [2019-10-02 11:20:55,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:55,825 INFO L225 Difference]: With dead ends: 472 [2019-10-02 11:20:55,825 INFO L226 Difference]: Without dead ends: 469 [2019-10-02 11:20:55,826 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-10-02 11:20:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-10-02 11:20:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 468. [2019-10-02 11:20:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-10-02 11:20:55,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 486 transitions. [2019-10-02 11:20:55,852 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 486 transitions. Word has length 159 [2019-10-02 11:20:55,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:55,852 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 486 transitions. [2019-10-02 11:20:55,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-10-02 11:20:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 486 transitions. [2019-10-02 11:20:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 11:20:55,854 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:55,854 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:55,855 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:55,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1079575770, now seen corresponding path program 9 times [2019-10-02 11:20:55,855 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:55,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:55,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:55,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:55,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:58,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:58,203 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-10-02 11:20:58,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:20:58,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-02 11:20:58,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:58,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 78 conjunts are in the unsatisfiable core [2019-10-02 11:20:58,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:58,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:58,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2019-10-02 11:20:58,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-02 11:20:58,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-02 11:20:58,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-10-02 11:20:58,395 INFO L87 Difference]: Start difference. First operand 468 states and 486 transitions. Second operand 79 states. [2019-10-02 11:21:02,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:02,417 INFO L93 Difference]: Finished difference Result 474 states and 492 transitions. [2019-10-02 11:21:02,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-02 11:21:02,418 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 161 [2019-10-02 11:21:02,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:02,422 INFO L225 Difference]: With dead ends: 474 [2019-10-02 11:21:02,422 INFO L226 Difference]: Without dead ends: 471 [2019-10-02 11:21:02,422 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-10-02 11:21:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-10-02 11:21:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 470. [2019-10-02 11:21:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-10-02 11:21:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 488 transitions. [2019-10-02 11:21:02,435 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 488 transitions. Word has length 161 [2019-10-02 11:21:02,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:02,435 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 488 transitions. [2019-10-02 11:21:02,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-02 11:21:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 488 transitions. [2019-10-02 11:21:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 11:21:02,437 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:02,438 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:21:02,438 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:02,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:02,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1902245312, now seen corresponding path program 10 times [2019-10-02 11:21:02,438 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:02,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:02,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:02,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:21:02,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:21:04,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:21:04,979 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-10-02 11:21:05,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:21:05,108 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:21:05,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:21:05,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 79 conjunts are in the unsatisfiable core [2019-10-02 11:21:05,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:21:05,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:21:05,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2019-10-02 11:21:05,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-02 11:21:05,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-02 11:21:05,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 11:21:05,166 INFO L87 Difference]: Start difference. First operand 470 states and 488 transitions. Second operand 80 states. [2019-10-02 11:21:13,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:13,589 INFO L93 Difference]: Finished difference Result 476 states and 494 transitions. [2019-10-02 11:21:13,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-02 11:21:13,590 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 163 [2019-10-02 11:21:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:13,596 INFO L225 Difference]: With dead ends: 476 [2019-10-02 11:21:13,596 INFO L226 Difference]: Without dead ends: 473 [2019-10-02 11:21:13,597 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 11:21:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-10-02 11:21:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 472. [2019-10-02 11:21:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-02 11:21:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 490 transitions. [2019-10-02 11:21:13,608 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 490 transitions. Word has length 163 [2019-10-02 11:21:13,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:13,608 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 490 transitions. [2019-10-02 11:21:13,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-10-02 11:21:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 490 transitions. [2019-10-02 11:21:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 11:21:13,610 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:13,611 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:21:13,611 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:13,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:13,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1605848614, now seen corresponding path program 11 times [2019-10-02 11:21:13,611 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:13,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:13,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:13,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:21:13,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:21:15,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:21:15,925 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-10-02 11:21:15,996 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:21:16,059 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-02 11:21:16,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:21:16,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 80 conjunts are in the unsatisfiable core [2019-10-02 11:21:16,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:21:16,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:21:16,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2019-10-02 11:21:16,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-10-02 11:21:16,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-10-02 11:21:16,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-10-02 11:21:16,105 INFO L87 Difference]: Start difference. First operand 472 states and 490 transitions. Second operand 81 states. [2019-10-02 11:21:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:19,102 INFO L93 Difference]: Finished difference Result 478 states and 496 transitions. [2019-10-02 11:21:19,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-10-02 11:21:19,105 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 165 [2019-10-02 11:21:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:19,108 INFO L225 Difference]: With dead ends: 478 [2019-10-02 11:21:19,108 INFO L226 Difference]: Without dead ends: 475 [2019-10-02 11:21:19,109 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-10-02 11:21:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-10-02 11:21:19,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 474. [2019-10-02 11:21:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-02 11:21:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 492 transitions. [2019-10-02 11:21:19,120 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 492 transitions. Word has length 165 [2019-10-02 11:21:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:19,120 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 492 transitions. [2019-10-02 11:21:19,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-10-02 11:21:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 492 transitions. [2019-10-02 11:21:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 11:21:19,122 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:19,122 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:21:19,122 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:19,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:19,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1334784140, now seen corresponding path program 12 times [2019-10-02 11:21:19,123 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:19,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:19,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:19,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:21:19,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:21:21,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:21:21,488 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-10-02 11:21:21,566 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:21:21,634 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-02 11:21:21,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:21:21,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 81 conjunts are in the unsatisfiable core [2019-10-02 11:21:21,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:21:21,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:21:21,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2019-10-02 11:21:21,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-02 11:21:21,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-02 11:21:21,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-10-02 11:21:21,693 INFO L87 Difference]: Start difference. First operand 474 states and 492 transitions. Second operand 82 states. [2019-10-02 11:21:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:30,136 INFO L93 Difference]: Finished difference Result 480 states and 498 transitions. [2019-10-02 11:21:30,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-02 11:21:30,136 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 167 [2019-10-02 11:21:30,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:30,139 INFO L225 Difference]: With dead ends: 480 [2019-10-02 11:21:30,139 INFO L226 Difference]: Without dead ends: 477 [2019-10-02 11:21:30,140 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-10-02 11:21:30,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-02 11:21:30,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 476. [2019-10-02 11:21:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-02 11:21:30,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 494 transitions. [2019-10-02 11:21:30,151 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 494 transitions. Word has length 167 [2019-10-02 11:21:30,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:30,152 INFO L475 AbstractCegarLoop]: Abstraction has 476 states and 494 transitions. [2019-10-02 11:21:30,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-02 11:21:30,152 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 494 transitions. [2019-10-02 11:21:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 11:21:30,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:30,154 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:21:30,154 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:30,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:30,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1460137614, now seen corresponding path program 13 times [2019-10-02 11:21:30,155 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:30,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:30,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:30,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:21:30,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:21:32,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:21:32,984 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-10-02 11:21:33,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:21:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:33,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 82 conjunts are in the unsatisfiable core [2019-10-02 11:21:33,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:21:33,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:21:33,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2019-10-02 11:21:33,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-02 11:21:33,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-02 11:21:33,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-10-02 11:21:33,164 INFO L87 Difference]: Start difference. First operand 476 states and 494 transitions. Second operand 83 states. [2019-10-02 11:21:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:40,566 INFO L93 Difference]: Finished difference Result 482 states and 500 transitions. [2019-10-02 11:21:40,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-02 11:21:40,567 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 169 [2019-10-02 11:21:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:40,570 INFO L225 Difference]: With dead ends: 482 [2019-10-02 11:21:40,570 INFO L226 Difference]: Without dead ends: 479 [2019-10-02 11:21:40,571 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-10-02 11:21:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-02 11:21:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 478. [2019-10-02 11:21:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-10-02 11:21:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 496 transitions. [2019-10-02 11:21:40,583 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 496 transitions. Word has length 169 [2019-10-02 11:21:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:40,583 INFO L475 AbstractCegarLoop]: Abstraction has 478 states and 496 transitions. [2019-10-02 11:21:40,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-02 11:21:40,584 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 496 transitions. [2019-10-02 11:21:40,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 11:21:40,585 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:40,586 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:21:40,586 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:40,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:40,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1269584088, now seen corresponding path program 14 times [2019-10-02 11:21:40,586 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:40,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:40,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:40,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:21:40,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:21:43,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:21:43,045 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-10-02 11:21:43,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:21:43,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:21:43,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:21:43,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 83 conjunts are in the unsatisfiable core [2019-10-02 11:21:43,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:21:43,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:21:43,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2019-10-02 11:21:43,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-10-02 11:21:43,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-10-02 11:21:43,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-10-02 11:21:43,256 INFO L87 Difference]: Start difference. First operand 478 states and 496 transitions. Second operand 84 states. [2019-10-02 11:21:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:47,436 INFO L93 Difference]: Finished difference Result 484 states and 502 transitions. [2019-10-02 11:21:47,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-02 11:21:47,436 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 171 [2019-10-02 11:21:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:47,439 INFO L225 Difference]: With dead ends: 484 [2019-10-02 11:21:47,439 INFO L226 Difference]: Without dead ends: 481 [2019-10-02 11:21:47,440 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-10-02 11:21:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-10-02 11:21:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 480. [2019-10-02 11:21:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-10-02 11:21:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 498 transitions. [2019-10-02 11:21:47,451 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 498 transitions. Word has length 171 [2019-10-02 11:21:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:47,451 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 498 transitions. [2019-10-02 11:21:47,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-10-02 11:21:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 498 transitions. [2019-10-02 11:21:47,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 11:21:47,453 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:47,454 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:21:47,454 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:47,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:47,454 INFO L82 PathProgramCache]: Analyzing trace with hash -307121854, now seen corresponding path program 15 times [2019-10-02 11:21:47,454 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:47,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:47,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:47,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:21:47,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:21:49,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:21:49,967 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-10-02 11:21:50,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:21:50,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-02 11:21:50,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:21:50,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 84 conjunts are in the unsatisfiable core [2019-10-02 11:21:50,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:21:50,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:21:50,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2019-10-02 11:21:50,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-10-02 11:21:50,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-10-02 11:21:50,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-10-02 11:21:50,184 INFO L87 Difference]: Start difference. First operand 480 states and 498 transitions. Second operand 85 states. [2019-10-02 11:21:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:53,332 INFO L93 Difference]: Finished difference Result 486 states and 504 transitions. [2019-10-02 11:21:53,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-10-02 11:21:53,332 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 173 [2019-10-02 11:21:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:53,335 INFO L225 Difference]: With dead ends: 486 [2019-10-02 11:21:53,335 INFO L226 Difference]: Without dead ends: 483 [2019-10-02 11:21:53,336 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-10-02 11:21:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-02 11:21:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 482. [2019-10-02 11:21:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-10-02 11:21:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 500 transitions. [2019-10-02 11:21:53,347 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 500 transitions. Word has length 173 [2019-10-02 11:21:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:53,348 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 500 transitions. [2019-10-02 11:21:53,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-10-02 11:21:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 500 transitions. [2019-10-02 11:21:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 11:21:53,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:53,350 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:21:53,350 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:53,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:53,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1201116380, now seen corresponding path program 16 times [2019-10-02 11:21:53,350 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:53,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:53,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:53,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:21:53,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:55,950 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:21:55,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:21:55,950 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-10-02 11:21:56,042 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:21:56,105 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:21:56,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:21:56,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 85 conjunts are in the unsatisfiable core [2019-10-02 11:21:56,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:21:56,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:21:56,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2019-10-02 11:21:56,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-10-02 11:21:56,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-10-02 11:21:56,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-10-02 11:21:56,173 INFO L87 Difference]: Start difference. First operand 482 states and 500 transitions. Second operand 86 states. [2019-10-02 11:21:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:59,392 INFO L93 Difference]: Finished difference Result 488 states and 506 transitions. [2019-10-02 11:21:59,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-02 11:21:59,392 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 175 [2019-10-02 11:21:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:59,395 INFO L225 Difference]: With dead ends: 488 [2019-10-02 11:21:59,395 INFO L226 Difference]: Without dead ends: 485 [2019-10-02 11:21:59,396 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-10-02 11:21:59,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-10-02 11:21:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 484. [2019-10-02 11:21:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-02 11:21:59,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 502 transitions. [2019-10-02 11:21:59,407 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 502 transitions. Word has length 175 [2019-10-02 11:21:59,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:59,407 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 502 transitions. [2019-10-02 11:21:59,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-10-02 11:21:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 502 transitions. [2019-10-02 11:21:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 11:21:59,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:59,409 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:21:59,410 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:59,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1080886794, now seen corresponding path program 17 times [2019-10-02 11:21:59,410 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:59,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:59,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:59,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:21:59,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:22:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:22:02,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:22:02,028 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:22:02,125 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:22:02,223 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-10-02 11:22:02,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:22:02,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 86 conjunts are in the unsatisfiable core [2019-10-02 11:22:02,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:22:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Stream closed [2019-10-02 11:22:02,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:22:02,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-10-02 11:22:02,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-10-02 11:22:02,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-10-02 11:22:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-10-02 11:22:02,316 INFO L87 Difference]: Start difference. First operand 484 states and 502 transitions. Second operand 87 states. [2019-10-02 11:22:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:22:06,732 INFO L93 Difference]: Finished difference Result 490 states and 508 transitions. [2019-10-02 11:22:06,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-10-02 11:22:06,732 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 177 [2019-10-02 11:22:06,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:22:06,735 INFO L225 Difference]: With dead ends: 490 [2019-10-02 11:22:06,735 INFO L226 Difference]: Without dead ends: 487 [2019-10-02 11:22:06,736 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-10-02 11:22:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-10-02 11:22:06,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 486. [2019-10-02 11:22:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-10-02 11:22:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 504 transitions. [2019-10-02 11:22:06,747 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 504 transitions. Word has length 177 [2019-10-02 11:22:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:22:06,747 INFO L475 AbstractCegarLoop]: Abstraction has 486 states and 504 transitions. [2019-10-02 11:22:06,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-10-02 11:22:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 504 transitions. [2019-10-02 11:22:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 11:22:06,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:22:06,749 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:22:06,749 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:22:06,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:22:06,750 INFO L82 PathProgramCache]: Analyzing trace with hash 642351248, now seen corresponding path program 18 times [2019-10-02 11:22:06,750 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:22:06,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:22:06,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:06,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:22:06,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:22:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:22:09,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:22:09,427 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:22:09,529 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:22:09,609 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-02 11:22:09,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:22:09,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 87 conjunts are in the unsatisfiable core [2019-10-02 11:22:09,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:22:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:22:09,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:22:09,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2019-10-02 11:22:09,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-10-02 11:22:09,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-10-02 11:22:09,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-10-02 11:22:09,669 INFO L87 Difference]: Start difference. First operand 486 states and 504 transitions. Second operand 88 states. [2019-10-02 11:22:17,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:22:17,833 INFO L93 Difference]: Finished difference Result 492 states and 510 transitions. [2019-10-02 11:22:17,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-10-02 11:22:17,833 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 179 [2019-10-02 11:22:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:22:17,836 INFO L225 Difference]: With dead ends: 492 [2019-10-02 11:22:17,836 INFO L226 Difference]: Without dead ends: 489 [2019-10-02 11:22:17,837 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-10-02 11:22:17,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-10-02 11:22:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 488. [2019-10-02 11:22:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-10-02 11:22:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 506 transitions. [2019-10-02 11:22:17,848 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 506 transitions. Word has length 179 [2019-10-02 11:22:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:22:17,848 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 506 transitions. [2019-10-02 11:22:17,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-10-02 11:22:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 506 transitions. [2019-10-02 11:22:17,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 11:22:17,850 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:22:17,850 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:22:17,850 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:22:17,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:22:17,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1183266646, now seen corresponding path program 19 times [2019-10-02 11:22:17,851 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:22:17,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:22:17,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:17,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:22:17,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:22:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:22:20,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:22:20,830 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:22:20,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:22:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:22:21,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 88 conjunts are in the unsatisfiable core [2019-10-02 11:22:21,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:22:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:22:21,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:22:21,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2019-10-02 11:22:21,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-10-02 11:22:21,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-10-02 11:22:21,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-10-02 11:22:21,076 INFO L87 Difference]: Start difference. First operand 488 states and 506 transitions. Second operand 89 states. [2019-10-02 11:22:29,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:22:29,558 INFO L93 Difference]: Finished difference Result 494 states and 512 transitions. [2019-10-02 11:22:29,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-02 11:22:29,558 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 181 [2019-10-02 11:22:29,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:22:29,561 INFO L225 Difference]: With dead ends: 494 [2019-10-02 11:22:29,561 INFO L226 Difference]: Without dead ends: 491 [2019-10-02 11:22:29,562 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-10-02 11:22:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-02 11:22:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 490. [2019-10-02 11:22:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-02 11:22:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 508 transitions. [2019-10-02 11:22:29,573 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 508 transitions. Word has length 181 [2019-10-02 11:22:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:22:29,573 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 508 transitions. [2019-10-02 11:22:29,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-10-02 11:22:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 508 transitions. [2019-10-02 11:22:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 11:22:29,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:22:29,576 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:22:29,576 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:22:29,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:22:29,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1039561284, now seen corresponding path program 20 times [2019-10-02 11:22:29,576 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:22:29,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:22:29,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:29,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:22:29,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:22:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:22:32,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:22:32,381 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:22:32,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:22:32,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:22:32,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:22:32,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 89 conjunts are in the unsatisfiable core [2019-10-02 11:22:32,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:22:32,609 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:22:32,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:22:32,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2019-10-02 11:22:32,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-10-02 11:22:32,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-10-02 11:22:32,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-10-02 11:22:32,623 INFO L87 Difference]: Start difference. First operand 490 states and 508 transitions. Second operand 90 states. [2019-10-02 11:22:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:22:36,396 INFO L93 Difference]: Finished difference Result 496 states and 514 transitions. [2019-10-02 11:22:36,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-10-02 11:22:36,398 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 183 [2019-10-02 11:22:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:22:36,400 INFO L225 Difference]: With dead ends: 496 [2019-10-02 11:22:36,400 INFO L226 Difference]: Without dead ends: 493 [2019-10-02 11:22:36,400 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-10-02 11:22:36,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-10-02 11:22:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 492. [2019-10-02 11:22:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-02 11:22:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 510 transitions. [2019-10-02 11:22:36,408 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 510 transitions. Word has length 183 [2019-10-02 11:22:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:22:36,409 INFO L475 AbstractCegarLoop]: Abstraction has 492 states and 510 transitions. [2019-10-02 11:22:36,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-10-02 11:22:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 510 transitions. [2019-10-02 11:22:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 11:22:36,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:22:36,411 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:22:36,411 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:22:36,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:22:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1716511394, now seen corresponding path program 21 times [2019-10-02 11:22:36,412 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:22:36,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:22:36,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:36,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:22:36,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:22:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:22:39,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:22:39,313 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:22:39,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:22:39,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-10-02 11:22:39,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:22:39,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 90 conjunts are in the unsatisfiable core [2019-10-02 11:22:39,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:22:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:22:39,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:22:39,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2019-10-02 11:22:39,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-10-02 11:22:39,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-10-02 11:22:39,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-10-02 11:22:39,578 INFO L87 Difference]: Start difference. First operand 492 states and 510 transitions. Second operand 91 states. [2019-10-02 11:22:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:22:48,112 INFO L93 Difference]: Finished difference Result 498 states and 516 transitions. [2019-10-02 11:22:48,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-10-02 11:22:48,113 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 185 [2019-10-02 11:22:48,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:22:48,115 INFO L225 Difference]: With dead ends: 498 [2019-10-02 11:22:48,115 INFO L226 Difference]: Without dead ends: 495 [2019-10-02 11:22:48,116 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-10-02 11:22:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-10-02 11:22:48,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 494. [2019-10-02 11:22:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-02 11:22:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 512 transitions. [2019-10-02 11:22:48,126 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 512 transitions. Word has length 185 [2019-10-02 11:22:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:22:48,127 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 512 transitions. [2019-10-02 11:22:48,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-10-02 11:22:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 512 transitions. [2019-10-02 11:22:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 11:22:48,128 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:22:48,129 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:22:48,129 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:22:48,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:22:48,129 INFO L82 PathProgramCache]: Analyzing trace with hash -307533320, now seen corresponding path program 22 times [2019-10-02 11:22:48,130 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:22:48,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:22:48,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:48,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:22:48,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:22:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:22:51,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:22:51,094 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:22:51,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:22:51,278 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:22:51,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:22:51,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 91 conjunts are in the unsatisfiable core [2019-10-02 11:22:51,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:22:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:22:51,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:22:51,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2019-10-02 11:22:51,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-10-02 11:22:51,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-10-02 11:22:51,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-10-02 11:22:51,514 INFO L87 Difference]: Start difference. First operand 494 states and 512 transitions. Second operand 92 states. [2019-10-02 11:22:57,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:22:57,072 INFO L93 Difference]: Finished difference Result 500 states and 518 transitions. [2019-10-02 11:22:57,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-10-02 11:22:57,073 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 187 [2019-10-02 11:22:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:22:57,076 INFO L225 Difference]: With dead ends: 500 [2019-10-02 11:22:57,076 INFO L226 Difference]: Without dead ends: 497 [2019-10-02 11:22:57,077 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-10-02 11:22:57,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-10-02 11:22:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 496. [2019-10-02 11:22:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-10-02 11:22:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 514 transitions. [2019-10-02 11:22:57,087 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 514 transitions. Word has length 187 [2019-10-02 11:22:57,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:22:57,087 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 514 transitions. [2019-10-02 11:22:57,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-10-02 11:22:57,088 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 514 transitions. [2019-10-02 11:22:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 11:22:57,089 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:22:57,090 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:22:57,090 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:22:57,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:22:57,090 INFO L82 PathProgramCache]: Analyzing trace with hash 805697554, now seen corresponding path program 23 times [2019-10-02 11:22:57,090 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:22:57,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:22:57,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:57,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:22:57,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:23:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:23:00,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:23:00,017 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:23:00,134 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:23:00,199 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-10-02 11:23:00,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:23:00,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 92 conjunts are in the unsatisfiable core [2019-10-02 11:23:00,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:23:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:23:00,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:23:00,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-10-02 11:23:00,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-10-02 11:23:00,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-10-02 11:23:00,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-10-02 11:23:00,259 INFO L87 Difference]: Start difference. First operand 496 states and 514 transitions. Second operand 93 states. [2019-10-02 11:23:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:23:06,626 INFO L93 Difference]: Finished difference Result 502 states and 520 transitions. [2019-10-02 11:23:06,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-10-02 11:23:06,626 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 189 [2019-10-02 11:23:06,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:23:06,629 INFO L225 Difference]: With dead ends: 502 [2019-10-02 11:23:06,629 INFO L226 Difference]: Without dead ends: 499 [2019-10-02 11:23:06,630 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-10-02 11:23:06,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-10-02 11:23:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 498. [2019-10-02 11:23:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-10-02 11:23:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 516 transitions. [2019-10-02 11:23:06,639 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 516 transitions. Word has length 189 [2019-10-02 11:23:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:23:06,640 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 516 transitions. [2019-10-02 11:23:06,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-10-02 11:23:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 516 transitions. [2019-10-02 11:23:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 11:23:06,642 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:23:06,642 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:23:06,642 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:23:06,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:23:06,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1173710764, now seen corresponding path program 24 times [2019-10-02 11:23:06,643 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:23:06,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:23:06,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:06,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:23:06,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:23:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:23:09,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:23:09,641 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:23:09,763 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:23:09,858 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-02 11:23:09,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:23:09,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 93 conjunts are in the unsatisfiable core [2019-10-02 11:23:09,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:23:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:23:09,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:23:09,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-10-02 11:23:09,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-10-02 11:23:09,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-10-02 11:23:09,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-10-02 11:23:09,930 INFO L87 Difference]: Start difference. First operand 498 states and 516 transitions. Second operand 94 states. [2019-10-02 11:23:18,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:23:18,254 INFO L93 Difference]: Finished difference Result 504 states and 522 transitions. [2019-10-02 11:23:18,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-10-02 11:23:18,254 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 191 [2019-10-02 11:23:18,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:23:18,257 INFO L225 Difference]: With dead ends: 504 [2019-10-02 11:23:18,257 INFO L226 Difference]: Without dead ends: 501 [2019-10-02 11:23:18,258 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-10-02 11:23:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-10-02 11:23:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 500. [2019-10-02 11:23:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-10-02 11:23:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 518 transitions. [2019-10-02 11:23:18,272 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 518 transitions. Word has length 191 [2019-10-02 11:23:18,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:23:18,272 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 518 transitions. [2019-10-02 11:23:18,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-10-02 11:23:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 518 transitions. [2019-10-02 11:23:18,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 11:23:18,273 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:23:18,274 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:23:18,274 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:23:18,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:23:18,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1647879994, now seen corresponding path program 25 times [2019-10-02 11:23:18,274 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:23:18,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:23:18,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:18,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:23:18,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:23:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:23:21,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:23:21,331 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:23:21,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:23:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:23:21,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 94 conjunts are in the unsatisfiable core [2019-10-02 11:23:21,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:23:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:23:21,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:23:21,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-10-02 11:23:21,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-10-02 11:23:21,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-10-02 11:23:21,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-10-02 11:23:21,579 INFO L87 Difference]: Start difference. First operand 500 states and 518 transitions. Second operand 95 states. [2019-10-02 11:23:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:23:29,774 INFO L93 Difference]: Finished difference Result 506 states and 524 transitions. [2019-10-02 11:23:29,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-10-02 11:23:29,775 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 193 [2019-10-02 11:23:29,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:23:29,777 INFO L225 Difference]: With dead ends: 506 [2019-10-02 11:23:29,777 INFO L226 Difference]: Without dead ends: 503 [2019-10-02 11:23:29,778 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-10-02 11:23:29,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-10-02 11:23:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 502. [2019-10-02 11:23:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-10-02 11:23:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 520 transitions. [2019-10-02 11:23:29,788 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 520 transitions. Word has length 193 [2019-10-02 11:23:29,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:23:29,788 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 520 transitions. [2019-10-02 11:23:29,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-10-02 11:23:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 520 transitions. [2019-10-02 11:23:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 11:23:29,801 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:23:29,801 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:23:29,801 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:23:29,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:23:29,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1222732640, now seen corresponding path program 26 times [2019-10-02 11:23:29,802 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:23:29,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:23:29,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:29,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:23:29,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:23:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:23:32,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:23:32,859 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:23:32,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:23:33,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:23:33,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:23:33,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 95 conjunts are in the unsatisfiable core [2019-10-02 11:23:33,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:23:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:23:33,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:23:33,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-10-02 11:23:33,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-10-02 11:23:33,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-10-02 11:23:33,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-10-02 11:23:33,167 INFO L87 Difference]: Start difference. First operand 502 states and 520 transitions. Second operand 96 states. [2019-10-02 11:23:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:23:41,266 INFO L93 Difference]: Finished difference Result 508 states and 526 transitions. [2019-10-02 11:23:41,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-10-02 11:23:41,266 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 195 [2019-10-02 11:23:41,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:23:41,269 INFO L225 Difference]: With dead ends: 508 [2019-10-02 11:23:41,269 INFO L226 Difference]: Without dead ends: 505 [2019-10-02 11:23:41,270 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-10-02 11:23:41,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-10-02 11:23:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 504. [2019-10-02 11:23:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-10-02 11:23:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 522 transitions. [2019-10-02 11:23:41,279 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 522 transitions. Word has length 195 [2019-10-02 11:23:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:23:41,279 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 522 transitions. [2019-10-02 11:23:41,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-10-02 11:23:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 522 transitions. [2019-10-02 11:23:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 11:23:41,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:23:41,281 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:23:41,281 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:23:41,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:23:41,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1782497414, now seen corresponding path program 27 times [2019-10-02 11:23:41,282 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:23:41,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:23:41,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:41,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:23:41,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:23:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:23:44,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:23:44,427 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:23:44,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:23:44,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-10-02 11:23:44,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:23:44,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-02 11:23:44,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:23:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:23:44,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:23:44,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-10-02 11:23:44,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-10-02 11:23:44,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-10-02 11:23:44,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-10-02 11:23:44,738 INFO L87 Difference]: Start difference. First operand 504 states and 522 transitions. Second operand 97 states. [2019-10-02 11:23:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:23:52,952 INFO L93 Difference]: Finished difference Result 510 states and 528 transitions. [2019-10-02 11:23:52,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-10-02 11:23:52,952 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 197 [2019-10-02 11:23:52,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:23:52,955 INFO L225 Difference]: With dead ends: 510 [2019-10-02 11:23:52,955 INFO L226 Difference]: Without dead ends: 507 [2019-10-02 11:23:52,955 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-10-02 11:23:52,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-10-02 11:23:52,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 506. [2019-10-02 11:23:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-02 11:23:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 524 transitions. [2019-10-02 11:23:52,962 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 524 transitions. Word has length 197 [2019-10-02 11:23:52,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:23:52,963 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 524 transitions. [2019-10-02 11:23:52,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-10-02 11:23:52,963 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 524 transitions. [2019-10-02 11:23:52,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 11:23:52,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:23:52,965 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:23:52,965 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:23:52,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:23:52,965 INFO L82 PathProgramCache]: Analyzing trace with hash 704410900, now seen corresponding path program 28 times [2019-10-02 11:23:52,965 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:23:52,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:23:52,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:52,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:23:52,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:23:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:23:56,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:23:56,246 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:23:56,380 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:23:56,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:23:56,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:23:56,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 97 conjunts are in the unsatisfiable core [2019-10-02 11:23:56,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:23:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:23:56,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:23:56,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-10-02 11:23:56,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-10-02 11:23:56,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-10-02 11:23:56,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-10-02 11:23:56,547 INFO L87 Difference]: Start difference. First operand 506 states and 524 transitions. Second operand 98 states. [2019-10-02 11:23:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:23:58,675 INFO L93 Difference]: Finished difference Result 512 states and 530 transitions. [2019-10-02 11:23:58,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-10-02 11:23:58,677 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 199 [2019-10-02 11:23:58,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:23:58,680 INFO L225 Difference]: With dead ends: 512 [2019-10-02 11:23:58,680 INFO L226 Difference]: Without dead ends: 509 [2019-10-02 11:23:58,680 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-10-02 11:23:58,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-10-02 11:23:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 508. [2019-10-02 11:23:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-10-02 11:23:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 526 transitions. [2019-10-02 11:23:58,689 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 526 transitions. Word has length 199 [2019-10-02 11:23:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:23:58,690 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 526 transitions. [2019-10-02 11:23:58,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-10-02 11:23:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 526 transitions. [2019-10-02 11:23:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 11:23:58,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:23:58,692 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:23:58,692 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:23:58,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:23:58,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1673483218, now seen corresponding path program 29 times [2019-10-02 11:23:58,692 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:23:58,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:23:58,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:58,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:23:58,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:24:01,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:24:01,988 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:24:02,123 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:24:02,199 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-02 11:24:02,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:24:02,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 98 conjunts are in the unsatisfiable core [2019-10-02 11:24:02,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:24:02,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:24:02,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-10-02 11:24:02,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-10-02 11:24:02,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-10-02 11:24:02,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-10-02 11:24:02,255 INFO L87 Difference]: Start difference. First operand 508 states and 526 transitions. Second operand 99 states. [2019-10-02 11:24:06,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:06,922 INFO L93 Difference]: Finished difference Result 514 states and 532 transitions. [2019-10-02 11:24:06,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-10-02 11:24:06,922 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 201 [2019-10-02 11:24:06,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:06,925 INFO L225 Difference]: With dead ends: 514 [2019-10-02 11:24:06,925 INFO L226 Difference]: Without dead ends: 511 [2019-10-02 11:24:06,926 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-10-02 11:24:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-10-02 11:24:06,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 510. [2019-10-02 11:24:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-02 11:24:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 528 transitions. [2019-10-02 11:24:06,932 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 528 transitions. Word has length 201 [2019-10-02 11:24:06,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:06,932 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 528 transitions. [2019-10-02 11:24:06,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-10-02 11:24:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 528 transitions. [2019-10-02 11:24:06,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 11:24:06,933 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:06,933 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:24:06,934 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:06,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:06,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1907129144, now seen corresponding path program 30 times [2019-10-02 11:24:06,934 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:06,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:06,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:06,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:24:06,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:24:10,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:24:10,220 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:24:10,377 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:24:10,480 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-10-02 11:24:10,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:24:10,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 99 conjunts are in the unsatisfiable core [2019-10-02 11:24:10,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:24:10,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:24:10,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-10-02 11:24:10,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-10-02 11:24:10,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-10-02 11:24:10,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-10-02 11:24:10,551 INFO L87 Difference]: Start difference. First operand 510 states and 528 transitions. Second operand 100 states. [2019-10-02 11:24:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:15,032 INFO L93 Difference]: Finished difference Result 516 states and 534 transitions. [2019-10-02 11:24:15,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-10-02 11:24:15,033 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 203 [2019-10-02 11:24:15,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:15,036 INFO L225 Difference]: With dead ends: 516 [2019-10-02 11:24:15,036 INFO L226 Difference]: Without dead ends: 513 [2019-10-02 11:24:15,037 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-10-02 11:24:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-10-02 11:24:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 512. [2019-10-02 11:24:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-02 11:24:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 530 transitions. [2019-10-02 11:24:15,045 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 530 transitions. Word has length 203 [2019-10-02 11:24:15,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:15,046 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 530 transitions. [2019-10-02 11:24:15,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-10-02 11:24:15,046 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 530 transitions. [2019-10-02 11:24:15,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 11:24:15,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:15,048 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:24:15,048 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:15,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:15,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1192402658, now seen corresponding path program 31 times [2019-10-02 11:24:15,048 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:15,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:15,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:15,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:24:15,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:24:18,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:24:18,479 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:24:18,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:24:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:18,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 100 conjunts are in the unsatisfiable core [2019-10-02 11:24:18,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:24:18,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:24:18,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-10-02 11:24:18,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-10-02 11:24:18,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-10-02 11:24:18,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-10-02 11:24:18,771 INFO L87 Difference]: Start difference. First operand 512 states and 530 transitions. Second operand 101 states. [2019-10-02 11:24:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:22,947 INFO L93 Difference]: Finished difference Result 518 states and 536 transitions. [2019-10-02 11:24:22,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-10-02 11:24:22,948 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 205 [2019-10-02 11:24:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:22,950 INFO L225 Difference]: With dead ends: 518 [2019-10-02 11:24:22,950 INFO L226 Difference]: Without dead ends: 515 [2019-10-02 11:24:22,951 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-10-02 11:24:22,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-10-02 11:24:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 514. [2019-10-02 11:24:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-10-02 11:24:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 532 transitions. [2019-10-02 11:24:22,960 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 532 transitions. Word has length 205 [2019-10-02 11:24:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:22,960 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 532 transitions. [2019-10-02 11:24:22,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-10-02 11:24:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 532 transitions. [2019-10-02 11:24:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 11:24:22,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:22,963 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:24:22,963 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:22,964 INFO L82 PathProgramCache]: Analyzing trace with hash -864839044, now seen corresponding path program 32 times [2019-10-02 11:24:22,964 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:22,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:22,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:22,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:24:22,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:24:26,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:24:26,436 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:24:26,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:24:26,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:24:26,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:24:26,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 101 conjunts are in the unsatisfiable core [2019-10-02 11:24:26,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:24:26,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:24:26,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-10-02 11:24:26,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-10-02 11:24:26,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-10-02 11:24:26,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-02 11:24:26,700 INFO L87 Difference]: Start difference. First operand 514 states and 532 transitions. Second operand 102 states. [2019-10-02 11:24:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:29,455 INFO L93 Difference]: Finished difference Result 519 states and 537 transitions. [2019-10-02 11:24:29,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-10-02 11:24:29,455 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 207 [2019-10-02 11:24:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:29,458 INFO L225 Difference]: With dead ends: 519 [2019-10-02 11:24:29,458 INFO L226 Difference]: Without dead ends: 516 [2019-10-02 11:24:29,459 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-02 11:24:29,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-10-02 11:24:29,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2019-10-02 11:24:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-10-02 11:24:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 534 transitions. [2019-10-02 11:24:29,467 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 534 transitions. Word has length 207 [2019-10-02 11:24:29,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:29,467 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 534 transitions. [2019-10-02 11:24:29,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-10-02 11:24:29,467 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 534 transitions. [2019-10-02 11:24:29,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 11:24:29,468 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:29,468 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:24:29,469 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:29,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:29,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2105808790, now seen corresponding path program 33 times [2019-10-02 11:24:29,469 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:29,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:29,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:29,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:24:29,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:24:31,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:24:31,214 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:24:31,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:24:31,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-10-02 11:24:31,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:24:31,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 108 conjunts are in the unsatisfiable core [2019-10-02 11:24:31,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:31,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:24:31,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:24:31,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-10-02 11:24:31,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-02 11:24:31,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-02 11:24:31,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 11:24:31,722 INFO L87 Difference]: Start difference. First operand 516 states and 534 transitions. Second operand 55 states. [2019-10-02 11:24:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:39,182 INFO L93 Difference]: Finished difference Result 522 states and 540 transitions. [2019-10-02 11:24:39,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-02 11:24:39,182 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2019-10-02 11:24:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:39,185 INFO L225 Difference]: With dead ends: 522 [2019-10-02 11:24:39,185 INFO L226 Difference]: Without dead ends: 519 [2019-10-02 11:24:39,186 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 11:24:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-10-02 11:24:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 518. [2019-10-02 11:24:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-10-02 11:24:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 536 transitions. [2019-10-02 11:24:39,199 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 536 transitions. Word has length 209 [2019-10-02 11:24:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:39,200 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 536 transitions. [2019-10-02 11:24:39,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-02 11:24:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 536 transitions. [2019-10-02 11:24:39,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 11:24:39,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:39,202 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:24:39,202 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:39,203 INFO L82 PathProgramCache]: Analyzing trace with hash 745125424, now seen corresponding path program 34 times [2019-10-02 11:24:39,203 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:39,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:39,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:39,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:24:39,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:24:40,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:24:40,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-10-02 11:24:40,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-02 11:24:40,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-02 11:24:40,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 11:24:40,362 INFO L87 Difference]: Start difference. First operand 518 states and 536 transitions. Second operand 52 states. [2019-10-02 11:24:41,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:41,457 INFO L93 Difference]: Finished difference Result 518 states and 536 transitions. [2019-10-02 11:24:41,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-02 11:24:41,457 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2019-10-02 11:24:41,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:41,458 INFO L225 Difference]: With dead ends: 518 [2019-10-02 11:24:41,458 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:24:41,459 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 11:24:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:24:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:24:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:24:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:24:41,460 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-10-02 11:24:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:41,460 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:24:41,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-02 11:24:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:24:41,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:24:41,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:24:41,828 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-10-02 11:24:41,970 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-10-02 11:24:42,217 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-10-02 11:24:42,330 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-10-02 11:24:42,552 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-10-02 11:24:43,749 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 307 DAG size of output: 307 [2019-10-02 11:24:43,929 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-10-02 11:24:44,180 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2019-10-02 11:24:44,384 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-10-02 11:24:44,693 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 104 [2019-10-02 11:24:45,008 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-10-02 11:24:45,192 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-10-02 11:24:45,477 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2019-10-02 11:24:45,570 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:24:45,570 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:24:45,570 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:24:45,570 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:24:45,570 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:24:45,570 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:24:45,570 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:24:45,571 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 1253) no Hoare annotation was computed. [2019-10-02 11:24:45,571 INFO L439 ceAbstractionStarter]: At program point L1126(lines 74 1127) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 11) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,571 INFO L439 ceAbstractionStarter]: At program point L994(lines 140 995) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 22)) [2019-10-02 11:24:45,571 INFO L439 ceAbstractionStarter]: At program point L862(lines 206 863) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 33)) [2019-10-02 11:24:45,571 INFO L439 ceAbstractionStarter]: At program point L730(lines 272 731) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 44)) [2019-10-02 11:24:45,571 INFO L439 ceAbstractionStarter]: At program point L598(lines 338 599) the Hoare annotation is: (or (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0))) [2019-10-02 11:24:45,572 INFO L439 ceAbstractionStarter]: At program point L466(lines 404 467) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= 62 main_~main__y~0) (<= main_~main__y~0 62) (<= 62 main_~main__x~0) (<= main_~main__x~0 62)) (and (<= 61 main_~main__y~0) (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= main_~main__x~0 61)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0)) (and (<= main_~main__y~0 65) (<= 65 main_~main__y~0) (<= main_~main__x~0 65) (<= 65 main_~main__x~0)) (and (<= main_~main__y~0 64) (<= main_~main__x~0 64) (<= 64 main_~main__x~0) (<= 64 main_~main__y~0)) (and (<= main_~main__x~0 66) (<= main_~main__y~0 66) (<= 66 main_~main__y~0) (<= 66 main_~main__x~0)) (and (<= main_~main__x~0 60) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 63 main_~main__x~0) (<= main_~main__y~0 63) (<= main_~main__x~0 63) (<= 63 main_~main__y~0))) [2019-10-02 11:24:45,572 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 539) no Hoare annotation was computed. [2019-10-02 11:24:45,572 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 671) no Hoare annotation was computed. [2019-10-02 11:24:45,572 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 1253) no Hoare annotation was computed. [2019-10-02 11:24:45,572 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 803) no Hoare annotation was computed. [2019-10-02 11:24:45,572 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 935) no Hoare annotation was computed. [2019-10-02 11:24:45,572 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 1067) no Hoare annotation was computed. [2019-10-02 11:24:45,572 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 1199) no Hoare annotation was computed. [2019-10-02 11:24:45,573 INFO L439 ceAbstractionStarter]: At program point L1162(lines 56 1163) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 8) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,573 INFO L439 ceAbstractionStarter]: At program point L1030(lines 122 1031) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 19) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,573 INFO L439 ceAbstractionStarter]: At program point L898(lines 188 899) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 30) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,573 INFO L439 ceAbstractionStarter]: At program point L766(lines 254 767) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 41) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,573 INFO L439 ceAbstractionStarter]: At program point L634(lines 320 635) the Hoare annotation is: (or (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50))) [2019-10-02 11:24:45,573 INFO L439 ceAbstractionStarter]: At program point L502(lines 386 503) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= 61 main_~main__y~0) (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= main_~main__x~0 61)) (and (<= 62 main_~main__y~0) (<= main_~main__y~0 62) (<= 62 main_~main__x~0) (<= main_~main__x~0 62)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0)) (and (<= main_~main__x~0 60) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 63 main_~main__x~0) (<= main_~main__y~0 63) (<= main_~main__x~0 63) (<= 63 main_~main__y~0))) [2019-10-02 11:24:45,573 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2019-10-02 11:24:45,574 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 467) no Hoare annotation was computed. [2019-10-02 11:24:45,574 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 599) no Hoare annotation was computed. [2019-10-02 11:24:45,574 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 731) no Hoare annotation was computed. [2019-10-02 11:24:45,574 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 863) no Hoare annotation was computed. [2019-10-02 11:24:45,574 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 995) no Hoare annotation was computed. [2019-10-02 11:24:45,574 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 1127) no Hoare annotation was computed. [2019-10-02 11:24:45,574 INFO L439 ceAbstractionStarter]: At program point L1198(lines 38 1199) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 5) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,574 INFO L439 ceAbstractionStarter]: At program point L1066(lines 104 1067) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 16) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,575 INFO L439 ceAbstractionStarter]: At program point L934(lines 170 935) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 27) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,575 INFO L439 ceAbstractionStarter]: At program point L802(lines 236 803) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 38)) [2019-10-02 11:24:45,575 INFO L439 ceAbstractionStarter]: At program point L670(lines 302 671) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 49)) [2019-10-02 11:24:45,575 INFO L439 ceAbstractionStarter]: At program point L538(lines 368 539) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= main_~main__x~0 60) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0))) [2019-10-02 11:24:45,575 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-10-02 11:24:45,575 INFO L443 ceAbstractionStarter]: For program point L374(lines 374 527) no Hoare annotation was computed. [2019-10-02 11:24:45,575 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 659) no Hoare annotation was computed. [2019-10-02 11:24:45,575 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 791) no Hoare annotation was computed. [2019-10-02 11:24:45,575 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 923) no Hoare annotation was computed. [2019-10-02 11:24:45,575 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 1055) no Hoare annotation was computed. [2019-10-02 11:24:45,576 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 1187) no Hoare annotation was computed. [2019-10-02 11:24:45,576 INFO L439 ceAbstractionStarter]: At program point L1234(lines 20 1235) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 2)) [2019-10-02 11:24:45,576 INFO L439 ceAbstractionStarter]: At program point L1102(lines 86 1103) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 13)) [2019-10-02 11:24:45,576 INFO L443 ceAbstractionStarter]: For program point L12(lines 12 1252) no Hoare annotation was computed. [2019-10-02 11:24:45,576 INFO L439 ceAbstractionStarter]: At program point L970(lines 152 971) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 24)) [2019-10-02 11:24:45,576 INFO L439 ceAbstractionStarter]: At program point L838(lines 218 839) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 35) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,576 INFO L439 ceAbstractionStarter]: At program point L706(lines 284 707) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 46)) [2019-10-02 11:24:45,576 INFO L439 ceAbstractionStarter]: At program point L574(lines 350 575) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0))) [2019-10-02 11:24:45,576 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 455) no Hoare annotation was computed. [2019-10-02 11:24:45,577 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 587) no Hoare annotation was computed. [2019-10-02 11:24:45,577 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 719) no Hoare annotation was computed. [2019-10-02 11:24:45,577 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 851) no Hoare annotation was computed. [2019-10-02 11:24:45,577 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 983) no Hoare annotation was computed. [2019-10-02 11:24:45,577 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 1115) no Hoare annotation was computed. [2019-10-02 11:24:45,577 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 1247) no Hoare annotation was computed. [2019-10-02 11:24:45,577 INFO L439 ceAbstractionStarter]: At program point L1138(lines 68 1139) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 10)) [2019-10-02 11:24:45,577 INFO L439 ceAbstractionStarter]: At program point L1006(lines 134 1007) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 21) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,577 INFO L439 ceAbstractionStarter]: At program point L874(lines 200 875) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 32)) [2019-10-02 11:24:45,577 INFO L439 ceAbstractionStarter]: At program point L742(lines 266 743) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 43) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,577 INFO L439 ceAbstractionStarter]: At program point L610(lines 332 611) the Hoare annotation is: (or (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50))) [2019-10-02 11:24:45,578 INFO L439 ceAbstractionStarter]: At program point L478(lines 398 479) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= 62 main_~main__y~0) (<= main_~main__y~0 62) (<= 62 main_~main__x~0) (<= main_~main__x~0 62)) (and (<= 61 main_~main__y~0) (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= main_~main__x~0 61)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) (and (<= main_~main__y~0 65) (<= 65 main_~main__y~0) (<= main_~main__x~0 65) (<= 65 main_~main__x~0)) (and (<= main_~main__y~0 64) (<= main_~main__x~0 64) (<= 64 main_~main__x~0) (<= 64 main_~main__y~0)) (and (<= main_~main__x~0 60) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 63 main_~main__x~0) (<= main_~main__y~0 63) (<= main_~main__x~0 63) (<= 63 main_~main__y~0))) [2019-10-02 11:24:45,578 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 439) no Hoare annotation was computed. [2019-10-02 11:24:45,578 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 515) no Hoare annotation was computed. [2019-10-02 11:24:45,578 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 647) no Hoare annotation was computed. [2019-10-02 11:24:45,578 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 779) no Hoare annotation was computed. [2019-10-02 11:24:45,578 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 911) no Hoare annotation was computed. [2019-10-02 11:24:45,578 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 1043) no Hoare annotation was computed. [2019-10-02 11:24:45,578 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 1175) no Hoare annotation was computed. [2019-10-02 11:24:45,578 INFO L439 ceAbstractionStarter]: At program point L1174(lines 50 1175) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 7) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,578 INFO L439 ceAbstractionStarter]: At program point L1042(lines 116 1043) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 18) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,578 INFO L439 ceAbstractionStarter]: At program point L910(lines 182 911) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 29)) [2019-10-02 11:24:45,579 INFO L439 ceAbstractionStarter]: At program point L778(lines 248 779) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 40) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,579 INFO L439 ceAbstractionStarter]: At program point L646(lines 314 647) the Hoare annotation is: (or (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50))) [2019-10-02 11:24:45,579 INFO L439 ceAbstractionStarter]: At program point L514(lines 380 515) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= 61 main_~main__y~0) (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= main_~main__x~0 61)) (and (<= 62 main_~main__y~0) (<= main_~main__y~0 62) (<= 62 main_~main__x~0) (<= main_~main__x~0 62)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) (and (<= main_~main__x~0 60) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50))) [2019-10-02 11:24:45,579 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 575) no Hoare annotation was computed. [2019-10-02 11:24:45,579 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 707) no Hoare annotation was computed. [2019-10-02 11:24:45,579 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 839) no Hoare annotation was computed. [2019-10-02 11:24:45,579 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 971) no Hoare annotation was computed. [2019-10-02 11:24:45,579 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 1103) no Hoare annotation was computed. [2019-10-02 11:24:45,579 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 1235) no Hoare annotation was computed. [2019-10-02 11:24:45,579 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 428) no Hoare annotation was computed. [2019-10-02 11:24:45,579 INFO L439 ceAbstractionStarter]: At program point L1210(lines 32 1211) the Hoare annotation is: (and (<= main_~main__x~0 4) (<= main_~main__y~0 50) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,580 INFO L439 ceAbstractionStarter]: At program point L1078(lines 98 1079) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 15)) [2019-10-02 11:24:45,580 INFO L439 ceAbstractionStarter]: At program point L946(lines 164 947) the Hoare annotation is: (and (<= main_~main__x~0 26) (<= main_~main__y~0 50) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,580 INFO L439 ceAbstractionStarter]: At program point L814(lines 230 815) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 37) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,580 INFO L439 ceAbstractionStarter]: At program point L682(lines 296 683) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 48) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,580 INFO L439 ceAbstractionStarter]: At program point L550(lines 362 551) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0))) [2019-10-02 11:24:45,580 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 503) no Hoare annotation was computed. [2019-10-02 11:24:45,580 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 635) no Hoare annotation was computed. [2019-10-02 11:24:45,580 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 767) no Hoare annotation was computed. [2019-10-02 11:24:45,580 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 899) no Hoare annotation was computed. [2019-10-02 11:24:45,580 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 1031) no Hoare annotation was computed. [2019-10-02 11:24:45,581 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 1163) no Hoare annotation was computed. [2019-10-02 11:24:45,581 INFO L439 ceAbstractionStarter]: At program point L1246(lines 14 1247) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 1)) [2019-10-02 11:24:45,581 INFO L439 ceAbstractionStarter]: At program point L1114(lines 80 1115) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 12)) [2019-10-02 11:24:45,581 INFO L439 ceAbstractionStarter]: At program point L982(lines 146 983) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 23) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,581 INFO L439 ceAbstractionStarter]: At program point L850(lines 212 851) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 34) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,581 INFO L439 ceAbstractionStarter]: At program point L718(lines 278 719) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 45) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,581 INFO L439 ceAbstractionStarter]: At program point L586(lines 344 587) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0))) [2019-10-02 11:24:45,582 INFO L439 ceAbstractionStarter]: At program point L454(lines 410 455) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= 61 main_~main__y~0) (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= main_~main__x~0 61)) (and (<= main_~main__x~0 91) (<= 91 main_~main__x~0) (<= main_~main__y~0 91) (<= 91 main_~main__y~0)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) (and (<= main_~main__y~0 74) (<= 74 main_~main__y~0) (<= main_~main__x~0 74) (<= 74 main_~main__x~0)) (and (<= 75 main_~main__y~0) (<= main_~main__x~0 75) (<= 75 main_~main__x~0) (<= main_~main__y~0 75)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0)) (and (<= 72 main_~main__x~0) (<= main_~main__y~0 72) (<= 72 main_~main__y~0) (<= main_~main__x~0 72)) (and (<= main_~main__x~0 82) (<= 82 main_~main__x~0) (<= main_~main__y~0 82) (<= 82 main_~main__y~0)) (and (<= main_~main__y~0 64) (<= main_~main__x~0 64) (<= 64 main_~main__x~0) (<= 64 main_~main__y~0)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 89 main_~main__y~0) (<= main_~main__y~0 89) (<= main_~main__x~0 89) (<= 89 main_~main__x~0)) (and (<= main_~main__y~0 90) (<= 90 main_~main__y~0) (<= 90 main_~main__x~0) (<= main_~main__x~0 90)) (and (<= 87 main_~main__x~0) (<= main_~main__y~0 87) (<= main_~main__x~0 87) (<= 87 main_~main__y~0)) (and (<= main_~main__x~0 78) (<= main_~main__y~0 78) (<= 78 main_~main__x~0) (<= 78 main_~main__y~0)) (and (<= main_~main__x~0 95) (<= main_~main__y~0 95) (<= 95 main_~main__x~0) (<= 95 main_~main__y~0)) (and (<= main_~main__y~0 77) (<= 77 main_~main__y~0) (<= main_~main__x~0 77) (<= 77 main_~main__x~0)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) (and (<= 63 main_~main__x~0) (<= main_~main__y~0 63) (<= main_~main__x~0 63) (<= 63 main_~main__y~0)) (and (<= main_~main__y~0 100) (<= 100 main_~main__x~0) (<= 100 main_~main__y~0)) (and (<= 76 main_~main__x~0) (<= main_~main__x~0 76) (<= main_~main__y~0 76) (<= 76 main_~main__y~0)) (and (<= 79 main_~main__x~0) (<= 79 main_~main__y~0) (<= main_~main__x~0 79) (<= main_~main__y~0 79)) (and (<= main_~main__x~0 80) (<= main_~main__y~0 80) (<= 80 main_~main__x~0) (<= 80 main_~main__y~0)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= main_~main__x~0 73) (<= 73 main_~main__x~0) (<= main_~main__y~0 73) (<= 73 main_~main__y~0)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__x~0 93) (<= main_~main__y~0 93) (<= 93 main_~main__y~0) (<= 93 main_~main__x~0)) (and (<= main_~main__y~0 97) (<= 97 main_~main__x~0) (<= 97 main_~main__y~0) (<= main_~main__x~0 97)) (and (<= main_~main__x~0 94) (<= 94 main_~main__x~0) (<= main_~main__y~0 94) (<= 94 main_~main__y~0)) (and (<= 70 main_~main__x~0) (<= main_~main__y~0 70) (<= main_~main__x~0 70) (<= 70 main_~main__y~0)) (and (<= main_~main__y~0 65) (<= 65 main_~main__y~0) (<= main_~main__x~0 65) (<= 65 main_~main__x~0)) (and (<= main_~main__y~0 84) (<= 84 main_~main__y~0) (<= 84 main_~main__x~0) (<= main_~main__x~0 84)) (and (<= main_~main__x~0 66) (<= main_~main__y~0 66) (<= 66 main_~main__y~0) (<= 66 main_~main__x~0)) (and (<= main_~main__x~0 60) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) (and (<= main_~main__x~0 69) (<= main_~main__y~0 69) (<= 69 main_~main__y~0) (<= 69 main_~main__x~0)) (and (<= main_~main__y~0 71) (<= 71 main_~main__y~0) (<= 71 main_~main__x~0) (<= main_~main__x~0 71)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 62 main_~main__y~0) (<= main_~main__y~0 62) (<= 62 main_~main__x~0) (<= main_~main__x~0 62)) (and (<= main_~main__y~0 68) (<= 68 main_~main__x~0) (<= main_~main__x~0 68) (<= 68 main_~main__y~0)) (and (<= main_~main__x~0 99) (<= 99 main_~main__x~0) (<= main_~main__y~0 99) (<= 99 main_~main__y~0)) (and (<= main_~main__x~0 96) (<= main_~main__y~0 96) (<= 96 main_~main__y~0) (<= 96 main_~main__x~0)) (and (<= main_~main__x~0 81) (<= main_~main__y~0 81) (<= 81 main_~main__x~0) (<= 81 main_~main__y~0)) (and (<= main_~main__y~0 98) (<= 98 main_~main__y~0) (<= main_~main__x~0 98) (<= 98 main_~main__x~0)) (and (<= 86 main_~main__x~0) (<= main_~main__x~0 86) (<= main_~main__y~0 86) (<= 86 main_~main__y~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= 85 main_~main__y~0) (<= main_~main__x~0 85) (<= 85 main_~main__x~0) (<= main_~main__y~0 85)) (and (<= main_~main__x~0 92) (<= 92 main_~main__x~0) (<= main_~main__y~0 92) (<= 92 main_~main__y~0)) (and (<= main_~main__x~0 67) (<= 67 main_~main__x~0) (<= main_~main__y~0 67) (<= 67 main_~main__y~0)) (and (<= main_~main__x~0 88) (<= 88 main_~main__x~0) (<= main_~main__y~0 88) (<= 88 main_~main__y~0)) (and (<= main_~main__y~0 83) (<= main_~main__x~0 83) (<= 83 main_~main__x~0) (<= 83 main_~main__y~0))) [2019-10-02 11:24:45,582 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 563) no Hoare annotation was computed. [2019-10-02 11:24:45,582 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 695) no Hoare annotation was computed. [2019-10-02 11:24:45,582 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 827) no Hoare annotation was computed. [2019-10-02 11:24:45,582 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 959) no Hoare annotation was computed. [2019-10-02 11:24:45,582 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 1091) no Hoare annotation was computed. [2019-10-02 11:24:45,583 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 1223) no Hoare annotation was computed. [2019-10-02 11:24:45,583 INFO L439 ceAbstractionStarter]: At program point L1150(lines 62 1151) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 9) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,583 INFO L439 ceAbstractionStarter]: At program point L1018(lines 128 1019) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 20) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,583 INFO L439 ceAbstractionStarter]: At program point L886(lines 194 887) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 31)) [2019-10-02 11:24:45,583 INFO L439 ceAbstractionStarter]: At program point L754(lines 260 755) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 42)) [2019-10-02 11:24:45,583 INFO L439 ceAbstractionStarter]: At program point L622(lines 326 623) the Hoare annotation is: (or (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50))) [2019-10-02 11:24:45,584 INFO L439 ceAbstractionStarter]: At program point L490(lines 392 491) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= 62 main_~main__y~0) (<= main_~main__y~0 62) (<= 62 main_~main__x~0) (<= main_~main__x~0 62)) (and (<= 61 main_~main__y~0) (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= main_~main__x~0 61)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) (and (<= main_~main__y~0 64) (<= main_~main__x~0 64) (<= 64 main_~main__x~0) (<= 64 main_~main__y~0)) (and (<= main_~main__x~0 60) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 63 main_~main__x~0) (<= main_~main__y~0 63) (<= main_~main__x~0 63) (<= 63 main_~main__y~0))) [2019-10-02 11:24:45,584 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 491) no Hoare annotation was computed. [2019-10-02 11:24:45,584 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 623) no Hoare annotation was computed. [2019-10-02 11:24:45,584 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 755) no Hoare annotation was computed. [2019-10-02 11:24:45,584 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 887) no Hoare annotation was computed. [2019-10-02 11:24:45,584 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 1019) no Hoare annotation was computed. [2019-10-02 11:24:45,584 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 1151) no Hoare annotation was computed. [2019-10-02 11:24:45,584 INFO L439 ceAbstractionStarter]: At program point L1186(lines 44 1187) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 6)) [2019-10-02 11:24:45,584 INFO L439 ceAbstractionStarter]: At program point L1054(lines 110 1055) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 17) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,584 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 1253) the Hoare annotation is: true [2019-10-02 11:24:45,584 INFO L439 ceAbstractionStarter]: At program point L922(lines 176 923) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 28)) [2019-10-02 11:24:45,584 INFO L439 ceAbstractionStarter]: At program point L790(lines 242 791) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 39)) [2019-10-02 11:24:45,585 INFO L439 ceAbstractionStarter]: At program point L658(lines 308 659) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) [2019-10-02 11:24:45,585 INFO L439 ceAbstractionStarter]: At program point L526(lines 374 527) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= main_~main__x~0 60) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) (and (<= 61 main_~main__y~0) (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= main_~main__x~0 61)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0))) [2019-10-02 11:24:45,585 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 551) no Hoare annotation was computed. [2019-10-02 11:24:45,585 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 683) no Hoare annotation was computed. [2019-10-02 11:24:45,585 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 815) no Hoare annotation was computed. [2019-10-02 11:24:45,585 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 947) no Hoare annotation was computed. [2019-10-02 11:24:45,585 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 1079) no Hoare annotation was computed. [2019-10-02 11:24:45,585 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 1211) no Hoare annotation was computed. [2019-10-02 11:24:45,585 INFO L439 ceAbstractionStarter]: At program point L1222(lines 26 1223) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 3)) [2019-10-02 11:24:45,585 INFO L439 ceAbstractionStarter]: At program point L1090(lines 92 1091) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 14)) [2019-10-02 11:24:45,585 INFO L439 ceAbstractionStarter]: At program point L958(lines 158 959) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 25) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,586 INFO L439 ceAbstractionStarter]: At program point L826(lines 224 827) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 36) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,586 INFO L439 ceAbstractionStarter]: At program point L694(lines 290 695) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 47) (<= 50 main_~main__y~0)) [2019-10-02 11:24:45,586 INFO L439 ceAbstractionStarter]: At program point L562(lines 356 563) the Hoare annotation is: (or (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50)) (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0))) [2019-10-02 11:24:45,586 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 479) no Hoare annotation was computed. [2019-10-02 11:24:45,586 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 611) no Hoare annotation was computed. [2019-10-02 11:24:45,586 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 743) no Hoare annotation was computed. [2019-10-02 11:24:45,586 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 875) no Hoare annotation was computed. [2019-10-02 11:24:45,586 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 1007) no Hoare annotation was computed. [2019-10-02 11:24:45,586 INFO L443 ceAbstractionStarter]: For program point L68(lines 68 1139) no Hoare annotation was computed. [2019-10-02 11:24:45,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:24:45 BoogieIcfgContainer [2019-10-02 11:24:45,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:24:45,646 INFO L168 Benchmark]: Toolchain (without parser) took 351891.36 ms. Allocated memory was 131.1 MB in the beginning and 898.1 MB in the end (delta: 767.0 MB). Free memory was 84.7 MB in the beginning and 422.7 MB in the end (delta: -338.0 MB). Peak memory consumption was 739.0 MB. Max. memory is 7.1 GB. [2019-10-02 11:24:45,646 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 131.1 MB. Free memory was 104.0 MB in the beginning and 103.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:24:45,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 652.37 ms. Allocated memory was 131.1 MB in the beginning and 198.7 MB in the end (delta: 67.6 MB). Free memory was 84.5 MB in the beginning and 170.1 MB in the end (delta: -85.7 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. [2019-10-02 11:24:45,648 INFO L168 Benchmark]: Boogie Preprocessor took 61.72 ms. Allocated memory is still 198.7 MB. Free memory was 170.1 MB in the beginning and 167.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-02 11:24:45,648 INFO L168 Benchmark]: RCFGBuilder took 1022.66 ms. Allocated memory is still 198.7 MB. Free memory was 167.5 MB in the beginning and 104.2 MB in the end (delta: 63.2 MB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:24:45,649 INFO L168 Benchmark]: TraceAbstraction took 350149.21 ms. Allocated memory was 198.7 MB in the beginning and 898.1 MB in the end (delta: 699.4 MB). Free memory was 103.6 MB in the beginning and 422.7 MB in the end (delta: -319.1 MB). Peak memory consumption was 690.3 MB. Max. memory is 7.1 GB. [2019-10-02 11:24:45,652 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 131.1 MB. Free memory was 104.0 MB in the beginning and 103.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 652.37 ms. Allocated memory was 131.1 MB in the beginning and 198.7 MB in the end (delta: 67.6 MB). Free memory was 84.5 MB in the beginning and 170.1 MB in the end (delta: -85.7 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.72 ms. Allocated memory is still 198.7 MB. Free memory was 170.1 MB in the beginning and 167.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1022.66 ms. Allocated memory is still 198.7 MB. Free memory was 167.5 MB in the beginning and 104.2 MB in the end (delta: 63.2 MB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 350149.21 ms. Allocated memory was 198.7 MB in the beginning and 898.1 MB in the end (delta: 699.4 MB). Free memory was 103.6 MB in the beginning and 422.7 MB in the end (delta: -319.1 MB). Peak memory consumption was 690.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 439]: 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: 56]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 8) && 50 <= main__y - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 40) && 50 <= main__y - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 33 - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: (((((((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((main__x <= 60 && 60 <= main__x) && 60 <= main__y) && main__y <= 60)) || (((61 <= main__y && 61 <= main__x) && main__y <= 61) && main__x <= 61)) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (main__x <= 26 && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 19) && 50 <= main__y - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 12 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 44 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 5) && 50 <= main__y - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 37) && 50 <= main__y - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 30) && 50 <= main__y - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: ((((((((((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((62 <= main__y && main__y <= 62) && 62 <= main__x) && main__x <= 62)) || (((61 <= main__y && 61 <= main__x) && main__y <= 61) && main__x <= 61)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || (((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x)) || (((main__y <= 64 && main__x <= 64) && 64 <= main__x) && 64 <= main__y)) || (((main__x <= 60 && 60 <= main__x) && 60 <= main__y) && main__y <= 60)) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((63 <= main__x && main__y <= 63) && main__x <= 63) && 63 <= main__y) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 23) && 50 <= main__y - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: (((((((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 16) && 50 <= main__y - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 48) && 50 <= main__y - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 9) && 50 <= main__y - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 41) && 50 <= main__y - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 2 - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 34) && 50 <= main__y - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((((((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((main__x <= 60 && 60 <= main__x) && 60 <= main__y) && main__y <= 60)) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 27) && 50 <= main__y - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((61 <= main__y && 61 <= main__x) && main__y <= 61) && main__x <= 61)) || (((main__x <= 91 && 91 <= main__x) && main__y <= 91) && 91 <= main__y)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y)) || (((main__y <= 74 && 74 <= main__y) && main__x <= 74) && 74 <= main__x)) || (((75 <= main__y && main__x <= 75) && 75 <= main__x) && main__y <= 75)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y)) || (((72 <= main__x && main__y <= 72) && 72 <= main__y) && main__x <= 72)) || (((main__x <= 82 && 82 <= main__x) && main__y <= 82) && 82 <= main__y)) || (((main__y <= 64 && main__x <= 64) && 64 <= main__x) && 64 <= main__y)) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((89 <= main__y && main__y <= 89) && main__x <= 89) && 89 <= main__x)) || (((main__y <= 90 && 90 <= main__y) && 90 <= main__x) && main__x <= 90)) || (((87 <= main__x && main__y <= 87) && main__x <= 87) && 87 <= main__y)) || (((main__x <= 78 && main__y <= 78) && 78 <= main__x) && 78 <= main__y)) || (((main__x <= 95 && main__y <= 95) && 95 <= main__x) && 95 <= main__y)) || (((main__y <= 77 && 77 <= main__y) && main__x <= 77) && 77 <= main__x)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x)) || (((63 <= main__x && main__y <= 63) && main__x <= 63) && 63 <= main__y)) || ((main__y <= 100 && 100 <= main__x) && 100 <= main__y)) || (((76 <= main__x && main__x <= 76) && main__y <= 76) && 76 <= main__y)) || (((79 <= main__x && 79 <= main__y) && main__x <= 79) && main__y <= 79)) || (((main__x <= 80 && main__y <= 80) && 80 <= main__x) && 80 <= main__y)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 73 && 73 <= main__x) && main__y <= 73) && 73 <= main__y)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || (((main__x <= 93 && main__y <= 93) && 93 <= main__y) && 93 <= main__x)) || (((main__y <= 97 && 97 <= main__x) && 97 <= main__y) && main__x <= 97)) || (((main__x <= 94 && 94 <= main__x) && main__y <= 94) && 94 <= main__y)) || (((70 <= main__x && main__y <= 70) && main__x <= 70) && 70 <= main__y)) || (((main__y <= 65 && 65 <= main__y) && main__x <= 65) && 65 <= main__x)) || (((main__y <= 84 && 84 <= main__y) && 84 <= main__x) && main__x <= 84)) || (((main__x <= 66 && main__y <= 66) && 66 <= main__y) && 66 <= main__x)) || (((main__x <= 60 && 60 <= main__x) && 60 <= main__y) && main__y <= 60)) || (((main__x <= 69 && main__y <= 69) && 69 <= main__y) && 69 <= main__x)) || (((main__y <= 71 && 71 <= main__y) && 71 <= main__x) && main__x <= 71)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((62 <= main__y && main__y <= 62) && 62 <= main__x) && main__x <= 62)) || (((main__y <= 68 && 68 <= main__x) && main__x <= 68) && 68 <= main__y)) || (((main__x <= 99 && 99 <= main__x) && main__y <= 99) && 99 <= main__y)) || (((main__x <= 96 && main__y <= 96) && 96 <= main__y) && 96 <= main__x)) || (((main__x <= 81 && main__y <= 81) && 81 <= main__x) && 81 <= main__y)) || (((main__y <= 98 && 98 <= main__y) && main__x <= 98) && 98 <= main__x)) || (((86 <= main__x && main__x <= 86) && main__y <= 86) && 86 <= main__y)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((85 <= main__y && main__x <= 85) && 85 <= main__x) && main__y <= 85)) || (((main__x <= 92 && 92 <= main__x) && main__y <= 92) && 92 <= main__y)) || (((main__x <= 67 && 67 <= main__x) && main__y <= 67) && 67 <= main__y)) || (((main__x <= 88 && 88 <= main__x) && main__y <= 88) && 88 <= main__y)) || (((main__y <= 83 && main__x <= 83) && 83 <= main__x) && 83 <= main__y) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 20) && 50 <= main__y - InvariantResult [Line: 320]: Loop Invariant Derived loop invariant: ((((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50) - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 13 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 45) && 50 <= main__y - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 6 - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 38 - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 31 - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: (((((((((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((61 <= main__y && 61 <= main__x) && main__y <= 61) && main__x <= 61)) || (((62 <= main__y && main__y <= 62) && 62 <= main__x) && main__x <= 62)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || (((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y)) || (((main__x <= 60 && 60 <= main__x) && 60 <= main__y) && main__y <= 60)) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((63 <= main__x && main__y <= 63) && main__x <= 63) && 63 <= main__y) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 24 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 17) && 50 <= main__y - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 49 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 10 - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 42 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 3 - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 35) && 50 <= main__y - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: (((((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 28 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((((((((((((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((62 <= main__y && main__y <= 62) && 62 <= main__x) && main__x <= 62)) || (((61 <= main__y && 61 <= main__x) && main__y <= 61) && main__x <= 61)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || (((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y)) || (((main__y <= 65 && 65 <= main__y) && main__x <= 65) && 65 <= main__x)) || (((main__y <= 64 && main__x <= 64) && 64 <= main__x) && 64 <= main__y)) || (((main__x <= 66 && main__y <= 66) && 66 <= main__y) && 66 <= main__x)) || (((main__x <= 60 && 60 <= main__x) && 60 <= main__y) && main__y <= 60)) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((63 <= main__x && main__y <= 63) && main__x <= 63) && 63 <= main__y) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 21) && 50 <= main__y - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50) - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 14 - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 46 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 7) && 50 <= main__y - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 39 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 32 - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((((((((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((61 <= main__y && 61 <= main__x) && main__y <= 61) && main__x <= 61)) || (((62 <= main__y && main__y <= 62) && 62 <= main__x) && main__x <= 62)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || (((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x)) || (((main__x <= 60 && 60 <= main__x) && 60 <= main__y) && main__y <= 60)) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 25) && 50 <= main__y - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 18) && 50 <= main__y - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 50 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 11) && 50 <= main__y - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 43) && 50 <= main__y - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (main__x <= 4 && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 36) && 50 <= main__y - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y) - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 29 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (((((((((((((((((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y) || (((62 <= main__y && main__y <= 62) && 62 <= main__x) && main__x <= 62)) || (((61 <= main__y && 61 <= main__x) && main__y <= 61) && main__x <= 61)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || (((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y)) || (((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x)) || (((main__y <= 65 && 65 <= main__y) && main__x <= 65) && 65 <= main__x)) || (((main__y <= 64 && main__x <= 64) && 64 <= main__x) && 64 <= main__y)) || (((main__x <= 60 && 60 <= main__x) && 60 <= main__y) && main__y <= 60)) || (((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x)) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50)) || (((63 <= main__x && main__y <= 63) && main__x <= 63) && 63 <= main__y) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 22 - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x) || (((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51)) || (((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x)) || ((main__y <= 50 && 50 <= main__y) && main__x <= 50) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 15 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 47) && 50 <= main__y - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 149 locations, 1 error locations. SAFE Result, 350.0s OverallTime, 45 OverallIterations, 34 TraceHistogramMax, 229.6s AutomataDifference, 0.0s DeadEndRemovalTime, 4.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2571 SDtfs, 10143 SDslu, 29212 SDs, 0 SdLazy, 375998 SolverSat, 10529 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 175.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9311 GetRequests, 5896 SyntacticMatches, 1 SemanticMatches, 3414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4207 ImplicationChecksByTransitivity, 102.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=518occurred in iteration=44, 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.5s AutomataMinimizationTime, 45 MinimizatonAttempts, 33 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 71 PreInvPairs, 324 NumberOfFragments, 3106 HoareAnnotationTreeSize, 71 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 71 FomulaSimplificationsInter, 507 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 106.7s InterpolantComputationTime, 13466 NumberOfCodeBlocks, 13466 NumberOfCodeBlocksAsserted, 372 NumberOfCheckSat, 13388 ConstructedInterpolants, 0 QuantifiedInterpolants, 7027072 SizeOfPredicates, 35 NumberOfNonLiveVariables, 14454 ConjunctsInSsa, 2844 ConjunctsInUnsatCore, 78 InterpolantComputations, 12 PerfectInterpolantSequences, 1156/26214 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...