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/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:55:57,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:55:57,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:55:57,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:55:57,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:55:57,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:55:57,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:55:57,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:55:57,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:55:57,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:55:57,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:55:57,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:55:57,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:55:57,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:55:57,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:55:57,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:55:57,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:55:57,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:55:57,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:55:57,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:55:57,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:55:57,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:55:57,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:55:57,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:55:57,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:55:57,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:55:57,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:55:57,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:55:57,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:55:57,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:55:57,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:55:57,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:55:57,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:55:57,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:55:57,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:55:57,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:55:57,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:55:57,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:55:57,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:55:57,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:55:57,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:55:57,740 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-09-08 11:55:57,766 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:55:57,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:55:57,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:55:57,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:55:57,768 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:55:57,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:55:57,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:55:57,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:55:57,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:55:57,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:55:57,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:55:57,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:55:57,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:55:57,770 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:55:57,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:55:57,770 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:55:57,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:55:57,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:55:57,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:55:57,771 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:55:57,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:55:57,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:55:57,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:55:57,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:55:57,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:55:57,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:55:57,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:55:57,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:55:57,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:55:57,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:55:57,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:55:57,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:55:57,821 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:55:57,824 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:55:57,824 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 11:55:57,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a54a6991/c3d2edd1067640d19f9c0f2e319ed8ce/FLAG089d3ff14 [2019-09-08 11:55:58,459 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:55:58,461 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 11:55:58,476 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a54a6991/c3d2edd1067640d19f9c0f2e319ed8ce/FLAG089d3ff14 [2019-09-08 11:55:58,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a54a6991/c3d2edd1067640d19f9c0f2e319ed8ce [2019-09-08 11:55:58,707 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:55:58,709 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:55:58,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:55:58,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:55:58,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:55:58,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:55:58" (1/1) ... [2019-09-08 11:55:58,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ffd4eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:55:58, skipping insertion in model container [2019-09-08 11:55:58,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:55:58" (1/1) ... [2019-09-08 11:55:58,727 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:55:58,836 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:55:59,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:55:59,657 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:56:00,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:56:00,057 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:56:00,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:56:00 WrapperNode [2019-09-08 11:56:00,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:56:00,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:56:00,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:56:00,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:56:00,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:56:00" (1/1) ... [2019-09-08 11:56:00,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:56:00" (1/1) ... [2019-09-08 11:56:00,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:56:00" (1/1) ... [2019-09-08 11:56:00,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:56:00" (1/1) ... [2019-09-08 11:56:00,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:56:00" (1/1) ... [2019-09-08 11:56:00,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:56:00" (1/1) ... [2019-09-08 11:56:00,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:56:00" (1/1) ... [2019-09-08 11:56:00,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:56:00,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:56:00,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:56:00,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:56:00,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:56:00" (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-09-08 11:56:00,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:56:00,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:56:00,272 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:56:00,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:56:00,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:56:00,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:56:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:56:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:56:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:56:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:56:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:56:00,275 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:56:00,275 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:56:00,276 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:56:00,276 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:56:00,277 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:56:00,278 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:56:00,279 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:56:00,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:56:00,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:56:02,596 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:56:02,597 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:56:02,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:56:02 BoogieIcfgContainer [2019-09-08 11:56:02,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:56:02,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:56:02,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:56:02,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:56:02,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:55:58" (1/3) ... [2019-09-08 11:56:02,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a0aa04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:56:02, skipping insertion in model container [2019-09-08 11:56:02,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:56:00" (2/3) ... [2019-09-08 11:56:02,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a0aa04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:56:02, skipping insertion in model container [2019-09-08 11:56:02,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:56:02" (3/3) ... [2019-09-08 11:56:02,611 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 11:56:02,621 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:56:02,641 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-09-08 11:56:02,658 INFO L252 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-09-08 11:56:02,692 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:56:02,693 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:56:02,693 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:56:02,693 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:56:02,693 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:56:02,693 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:56:02,694 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:56:02,694 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:56:02,694 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:56:02,721 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states. [2019-09-08 11:56:02,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 11:56:02,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:02,738 INFO L399 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] [2019-09-08 11:56:02,740 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:02,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:02,746 INFO L82 PathProgramCache]: Analyzing trace with hash -221233155, now seen corresponding path program 1 times [2019-09-08 11:56:02,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:02,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:02,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:02,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:02,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:03,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:03,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:56:03,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:56:03,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:56:03,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:56:03,246 INFO L87 Difference]: Start difference. First operand 542 states. Second operand 5 states. [2019-09-08 11:56:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:03,943 INFO L93 Difference]: Finished difference Result 716 states and 1240 transitions. [2019-09-08 11:56:03,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:56:03,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-08 11:56:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:03,963 INFO L225 Difference]: With dead ends: 716 [2019-09-08 11:56:03,963 INFO L226 Difference]: Without dead ends: 421 [2019-09-08 11:56:03,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:56:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-09-08 11:56:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-09-08 11:56:04,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-08 11:56:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 534 transitions. [2019-09-08 11:56:04,136 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 534 transitions. Word has length 63 [2019-09-08 11:56:04,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:04,137 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 534 transitions. [2019-09-08 11:56:04,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:56:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 534 transitions. [2019-09-08 11:56:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 11:56:04,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:04,147 INFO L399 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] [2019-09-08 11:56:04,148 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:04,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:04,149 INFO L82 PathProgramCache]: Analyzing trace with hash -490750818, now seen corresponding path program 1 times [2019-09-08 11:56:04,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:04,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:04,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:04,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:04,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:04,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:04,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:56:04,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:56:04,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:56:04,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:56:04,329 INFO L87 Difference]: Start difference. First operand 421 states and 534 transitions. Second operand 5 states. [2019-09-08 11:56:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:04,634 INFO L93 Difference]: Finished difference Result 519 states and 656 transitions. [2019-09-08 11:56:04,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:56:04,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-08 11:56:04,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:04,639 INFO L225 Difference]: With dead ends: 519 [2019-09-08 11:56:04,641 INFO L226 Difference]: Without dead ends: 303 [2019-09-08 11:56:04,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:56:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-08 11:56:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-08 11:56:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-08 11:56:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 381 transitions. [2019-09-08 11:56:04,672 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 381 transitions. Word has length 63 [2019-09-08 11:56:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:04,673 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 381 transitions. [2019-09-08 11:56:04,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:56:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 381 transitions. [2019-09-08 11:56:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 11:56:04,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:04,676 INFO L399 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] [2019-09-08 11:56:04,676 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:04,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:04,677 INFO L82 PathProgramCache]: Analyzing trace with hash 556502945, now seen corresponding path program 1 times [2019-09-08 11:56:04,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:04,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:04,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:04,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:04,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:04,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:04,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:56:04,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:56:04,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:56:04,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:56:04,828 INFO L87 Difference]: Start difference. First operand 303 states and 381 transitions. Second operand 6 states. [2019-09-08 11:56:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:05,139 INFO L93 Difference]: Finished difference Result 552 states and 699 transitions. [2019-09-08 11:56:05,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:56:05,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-09-08 11:56:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:05,167 INFO L225 Difference]: With dead ends: 552 [2019-09-08 11:56:05,167 INFO L226 Difference]: Without dead ends: 392 [2019-09-08 11:56:05,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:56:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-08 11:56:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 352. [2019-09-08 11:56:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 11:56:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 456 transitions. [2019-09-08 11:56:05,191 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 456 transitions. Word has length 63 [2019-09-08 11:56:05,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:05,192 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 456 transitions. [2019-09-08 11:56:05,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:56:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 456 transitions. [2019-09-08 11:56:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:56:05,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:05,194 INFO L399 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] [2019-09-08 11:56:05,195 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:05,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:05,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1040476392, now seen corresponding path program 1 times [2019-09-08 11:56:05,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:05,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:05,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:05,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:05,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:56:05,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:56:05,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:56:05,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:56:05,337 INFO L87 Difference]: Start difference. First operand 352 states and 456 transitions. Second operand 5 states. [2019-09-08 11:56:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:05,582 INFO L93 Difference]: Finished difference Result 528 states and 694 transitions. [2019-09-08 11:56:05,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:56:05,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-08 11:56:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:05,585 INFO L225 Difference]: With dead ends: 528 [2019-09-08 11:56:05,586 INFO L226 Difference]: Without dead ends: 314 [2019-09-08 11:56:05,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:56:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-08 11:56:05,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-09-08 11:56:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 11:56:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 406 transitions. [2019-09-08 11:56:05,604 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 406 transitions. Word has length 64 [2019-09-08 11:56:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:05,605 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 406 transitions. [2019-09-08 11:56:05,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:56:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 406 transitions. [2019-09-08 11:56:05,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:56:05,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:05,607 INFO L399 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] [2019-09-08 11:56:05,608 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:05,608 INFO L82 PathProgramCache]: Analyzing trace with hash 811942748, now seen corresponding path program 1 times [2019-09-08 11:56:05,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:05,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:05,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:05,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:05,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:05,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:05,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:56:05,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:56:05,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:56:05,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:56:05,846 INFO L87 Difference]: Start difference. First operand 314 states and 406 transitions. Second operand 9 states. [2019-09-08 11:56:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:06,705 INFO L93 Difference]: Finished difference Result 867 states and 1196 transitions. [2019-09-08 11:56:06,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:56:06,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-09-08 11:56:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:06,711 INFO L225 Difference]: With dead ends: 867 [2019-09-08 11:56:06,711 INFO L226 Difference]: Without dead ends: 724 [2019-09-08 11:56:06,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:56:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-08 11:56:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 314. [2019-09-08 11:56:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 11:56:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 405 transitions. [2019-09-08 11:56:06,740 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 405 transitions. Word has length 65 [2019-09-08 11:56:06,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:06,742 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 405 transitions. [2019-09-08 11:56:06,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:56:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 405 transitions. [2019-09-08 11:56:06,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:56:06,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:06,744 INFO L399 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] [2019-09-08 11:56:06,745 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:06,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:06,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1192590481, now seen corresponding path program 1 times [2019-09-08 11:56:06,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:06,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:06,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:06,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:06,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:06,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:06,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:56:06,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:56:06,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:56:06,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:56:06,986 INFO L87 Difference]: Start difference. First operand 314 states and 405 transitions. Second operand 9 states. [2019-09-08 11:56:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:07,848 INFO L93 Difference]: Finished difference Result 717 states and 973 transitions. [2019-09-08 11:56:07,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:56:07,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-09-08 11:56:07,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:07,854 INFO L225 Difference]: With dead ends: 717 [2019-09-08 11:56:07,854 INFO L226 Difference]: Without dead ends: 712 [2019-09-08 11:56:07,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:56:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-08 11:56:07,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 314. [2019-09-08 11:56:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 11:56:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 404 transitions. [2019-09-08 11:56:07,921 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 404 transitions. Word has length 65 [2019-09-08 11:56:07,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:07,921 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 404 transitions. [2019-09-08 11:56:07,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:56:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 404 transitions. [2019-09-08 11:56:07,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:56:07,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:07,923 INFO L399 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] [2019-09-08 11:56:07,923 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:07,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:07,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1959558393, now seen corresponding path program 1 times [2019-09-08 11:56:07,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:07,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:07,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:07,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:07,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:08,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:08,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:56:08,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:56:08,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:56:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:56:08,090 INFO L87 Difference]: Start difference. First operand 314 states and 404 transitions. Second operand 8 states. [2019-09-08 11:56:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:08,599 INFO L93 Difference]: Finished difference Result 597 states and 776 transitions. [2019-09-08 11:56:08,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:56:08,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-09-08 11:56:08,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:08,604 INFO L225 Difference]: With dead ends: 597 [2019-09-08 11:56:08,604 INFO L226 Difference]: Without dead ends: 406 [2019-09-08 11:56:08,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:56:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-08 11:56:08,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 314. [2019-09-08 11:56:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 11:56:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 403 transitions. [2019-09-08 11:56:08,644 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 403 transitions. Word has length 65 [2019-09-08 11:56:08,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:08,645 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 403 transitions. [2019-09-08 11:56:08,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:56:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 403 transitions. [2019-09-08 11:56:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:56:08,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:08,653 INFO L399 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] [2019-09-08 11:56:08,653 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:08,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash 297751041, now seen corresponding path program 1 times [2019-09-08 11:56:08,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:08,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:08,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:08,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:08,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:08,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:08,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:56:08,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:56:08,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:56:08,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:56:08,901 INFO L87 Difference]: Start difference. First operand 314 states and 403 transitions. Second operand 9 states. [2019-09-08 11:56:09,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:09,912 INFO L93 Difference]: Finished difference Result 822 states and 1129 transitions. [2019-09-08 11:56:09,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:56:09,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:56:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:09,916 INFO L225 Difference]: With dead ends: 822 [2019-09-08 11:56:09,917 INFO L226 Difference]: Without dead ends: 712 [2019-09-08 11:56:09,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:56:09,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-08 11:56:09,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 314. [2019-09-08 11:56:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 11:56:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 402 transitions. [2019-09-08 11:56:09,945 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 402 transitions. Word has length 67 [2019-09-08 11:56:09,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:09,946 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 402 transitions. [2019-09-08 11:56:09,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:56:09,946 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 402 transitions. [2019-09-08 11:56:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:56:09,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:09,947 INFO L399 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] [2019-09-08 11:56:09,947 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:09,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:09,948 INFO L82 PathProgramCache]: Analyzing trace with hash -101064039, now seen corresponding path program 1 times [2019-09-08 11:56:09,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:09,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:09,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:09,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:09,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:10,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:10,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:56:10,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:56:10,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:56:10,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:56:10,086 INFO L87 Difference]: Start difference. First operand 314 states and 402 transitions. Second operand 9 states. [2019-09-08 11:56:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:11,436 INFO L93 Difference]: Finished difference Result 846 states and 1163 transitions. [2019-09-08 11:56:11,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:56:11,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:56:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:11,442 INFO L225 Difference]: With dead ends: 846 [2019-09-08 11:56:11,442 INFO L226 Difference]: Without dead ends: 724 [2019-09-08 11:56:11,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:56:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-08 11:56:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 314. [2019-09-08 11:56:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 11:56:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 401 transitions. [2019-09-08 11:56:11,492 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 401 transitions. Word has length 67 [2019-09-08 11:56:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:11,493 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 401 transitions. [2019-09-08 11:56:11,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:56:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 401 transitions. [2019-09-08 11:56:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:56:11,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:11,495 INFO L399 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] [2019-09-08 11:56:11,496 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:11,496 INFO L82 PathProgramCache]: Analyzing trace with hash 217206227, now seen corresponding path program 1 times [2019-09-08 11:56:11,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:11,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:11,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:11,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:11,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:11,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:11,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:56:11,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:56:11,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:56:11,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:56:11,735 INFO L87 Difference]: Start difference. First operand 314 states and 401 transitions. Second operand 9 states. [2019-09-08 11:56:12,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:12,956 INFO L93 Difference]: Finished difference Result 819 states and 1124 transitions. [2019-09-08 11:56:12,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:56:12,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:56:12,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:12,960 INFO L225 Difference]: With dead ends: 819 [2019-09-08 11:56:12,960 INFO L226 Difference]: Without dead ends: 712 [2019-09-08 11:56:12,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:56:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-08 11:56:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 314. [2019-09-08 11:56:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 11:56:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 400 transitions. [2019-09-08 11:56:13,003 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 400 transitions. Word has length 67 [2019-09-08 11:56:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:13,004 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 400 transitions. [2019-09-08 11:56:13,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:56:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 400 transitions. [2019-09-08 11:56:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:56:13,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:13,005 INFO L399 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] [2019-09-08 11:56:13,006 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:13,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:13,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1537942501, now seen corresponding path program 1 times [2019-09-08 11:56:13,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:13,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:13,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:13,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:13,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:13,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:13,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:56:13,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:56:13,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:56:13,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:56:13,175 INFO L87 Difference]: Start difference. First operand 314 states and 400 transitions. Second operand 9 states. [2019-09-08 11:56:14,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:14,214 INFO L93 Difference]: Finished difference Result 841 states and 1154 transitions. [2019-09-08 11:56:14,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:56:14,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:56:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:14,220 INFO L225 Difference]: With dead ends: 841 [2019-09-08 11:56:14,221 INFO L226 Difference]: Without dead ends: 724 [2019-09-08 11:56:14,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:56:14,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-08 11:56:14,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 314. [2019-09-08 11:56:14,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 11:56:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 399 transitions. [2019-09-08 11:56:14,271 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 399 transitions. Word has length 67 [2019-09-08 11:56:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:14,271 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 399 transitions. [2019-09-08 11:56:14,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:56:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 399 transitions. [2019-09-08 11:56:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:56:14,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:14,273 INFO L399 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] [2019-09-08 11:56:14,274 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:14,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:14,274 INFO L82 PathProgramCache]: Analyzing trace with hash -149286562, now seen corresponding path program 1 times [2019-09-08 11:56:14,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:14,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:14,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:14,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:14,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:14,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:14,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:56:14,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:56:14,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:56:14,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:56:14,435 INFO L87 Difference]: Start difference. First operand 314 states and 399 transitions. Second operand 9 states. [2019-09-08 11:56:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:15,423 INFO L93 Difference]: Finished difference Result 876 states and 1196 transitions. [2019-09-08 11:56:15,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:56:15,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:56:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:15,427 INFO L225 Difference]: With dead ends: 876 [2019-09-08 11:56:15,427 INFO L226 Difference]: Without dead ends: 724 [2019-09-08 11:56:15,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:56:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-08 11:56:15,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 314. [2019-09-08 11:56:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 11:56:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 398 transitions. [2019-09-08 11:56:15,462 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 398 transitions. Word has length 67 [2019-09-08 11:56:15,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:15,462 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 398 transitions. [2019-09-08 11:56:15,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:56:15,462 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 398 transitions. [2019-09-08 11:56:15,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:56:15,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:15,463 INFO L399 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] [2019-09-08 11:56:15,464 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:15,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:15,464 INFO L82 PathProgramCache]: Analyzing trace with hash 415538350, now seen corresponding path program 1 times [2019-09-08 11:56:15,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:15,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:15,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:15,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:15,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:15,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:15,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:56:15,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:56:15,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:56:15,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:56:15,600 INFO L87 Difference]: Start difference. First operand 314 states and 398 transitions. Second operand 9 states. [2019-09-08 11:56:16,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:16,656 INFO L93 Difference]: Finished difference Result 717 states and 965 transitions. [2019-09-08 11:56:16,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:56:16,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:56:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:16,660 INFO L225 Difference]: With dead ends: 717 [2019-09-08 11:56:16,660 INFO L226 Difference]: Without dead ends: 712 [2019-09-08 11:56:16,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:56:16,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-08 11:56:16,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 314. [2019-09-08 11:56:16,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 11:56:16,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 397 transitions. [2019-09-08 11:56:16,694 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 397 transitions. Word has length 67 [2019-09-08 11:56:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:16,695 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 397 transitions. [2019-09-08 11:56:16,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:56:16,695 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 397 transitions. [2019-09-08 11:56:16,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:56:16,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:16,696 INFO L399 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] [2019-09-08 11:56:16,696 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:16,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:16,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1403250118, now seen corresponding path program 1 times [2019-09-08 11:56:16,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:16,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:16,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:16,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:16,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:16,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:16,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:56:16,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:56:16,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:56:16,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:56:16,827 INFO L87 Difference]: Start difference. First operand 314 states and 397 transitions. Second operand 9 states. [2019-09-08 11:56:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:18,082 INFO L93 Difference]: Finished difference Result 741 states and 998 transitions. [2019-09-08 11:56:18,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:56:18,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:56:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:18,085 INFO L225 Difference]: With dead ends: 741 [2019-09-08 11:56:18,085 INFO L226 Difference]: Without dead ends: 724 [2019-09-08 11:56:18,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:56:18,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-08 11:56:18,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 314. [2019-09-08 11:56:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 11:56:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 396 transitions. [2019-09-08 11:56:18,121 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 396 transitions. Word has length 67 [2019-09-08 11:56:18,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:18,121 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 396 transitions. [2019-09-08 11:56:18,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:56:18,121 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 396 transitions. [2019-09-08 11:56:18,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:56:18,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:18,122 INFO L399 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] [2019-09-08 11:56:18,123 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:18,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:18,123 INFO L82 PathProgramCache]: Analyzing trace with hash 819188212, now seen corresponding path program 1 times [2019-09-08 11:56:18,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:18,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:18,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:18,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:18,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:19,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:19,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 11:56:19,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 11:56:19,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 11:56:19,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:56:19,075 INFO L87 Difference]: Start difference. First operand 314 states and 396 transitions. Second operand 19 states. [2019-09-08 11:56:19,883 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-08 11:56:20,014 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-08 11:56:20,149 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 11:56:20,358 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 11:56:20,494 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 11:56:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:22,801 INFO L93 Difference]: Finished difference Result 968 states and 1295 transitions. [2019-09-08 11:56:22,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:56:22,836 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2019-09-08 11:56:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:22,840 INFO L225 Difference]: With dead ends: 968 [2019-09-08 11:56:22,840 INFO L226 Difference]: Without dead ends: 830 [2019-09-08 11:56:22,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 11:56:22,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2019-09-08 11:56:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 320. [2019-09-08 11:56:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-08 11:56:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 402 transitions. [2019-09-08 11:56:22,888 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 402 transitions. Word has length 69 [2019-09-08 11:56:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:22,889 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 402 transitions. [2019-09-08 11:56:22,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 11:56:22,889 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 402 transitions. [2019-09-08 11:56:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:56:22,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:22,890 INFO L399 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] [2019-09-08 11:56:22,891 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:22,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:22,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2009849792, now seen corresponding path program 1 times [2019-09-08 11:56:22,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:22,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:22,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:22,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:22,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:23,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:23,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:56:23,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:56:23,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:56:23,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:56:23,628 INFO L87 Difference]: Start difference. First operand 320 states and 402 transitions. Second operand 17 states. [2019-09-08 11:56:24,180 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 11:56:24,323 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-08 11:56:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:25,574 INFO L93 Difference]: Finished difference Result 858 states and 1168 transitions. [2019-09-08 11:56:25,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:56:25,574 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2019-09-08 11:56:25,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:25,577 INFO L225 Difference]: With dead ends: 858 [2019-09-08 11:56:25,577 INFO L226 Difference]: Without dead ends: 730 [2019-09-08 11:56:25,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:56:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-09-08 11:56:25,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 310. [2019-09-08 11:56:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 11:56:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 388 transitions. [2019-09-08 11:56:25,626 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 388 transitions. Word has length 69 [2019-09-08 11:56:25,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:25,626 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 388 transitions. [2019-09-08 11:56:25,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:56:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2019-09-08 11:56:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:56:25,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:25,628 INFO L399 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] [2019-09-08 11:56:25,628 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:25,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:25,628 INFO L82 PathProgramCache]: Analyzing trace with hash -628951207, now seen corresponding path program 1 times [2019-09-08 11:56:25,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:25,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:25,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:25,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:25,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:26,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:26,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:56:26,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:56:26,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:56:26,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:56:26,898 INFO L87 Difference]: Start difference. First operand 310 states and 388 transitions. Second operand 21 states. [2019-09-08 11:56:27,043 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-08 11:56:27,829 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-08 11:56:28,044 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-08 11:56:28,316 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-08 11:56:28,524 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:56:28,762 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:56:28,972 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:56:29,989 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-08 11:56:30,261 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 11:56:30,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:30,987 INFO L93 Difference]: Finished difference Result 897 states and 1168 transitions. [2019-09-08 11:56:30,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 11:56:30,987 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-09-08 11:56:30,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:30,991 INFO L225 Difference]: With dead ends: 897 [2019-09-08 11:56:30,991 INFO L226 Difference]: Without dead ends: 788 [2019-09-08 11:56:30,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 11:56:30,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-08 11:56:31,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 325. [2019-09-08 11:56:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-08 11:56:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 409 transitions. [2019-09-08 11:56:31,051 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 409 transitions. Word has length 69 [2019-09-08 11:56:31,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:31,052 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 409 transitions. [2019-09-08 11:56:31,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:56:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 409 transitions. [2019-09-08 11:56:31,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:56:31,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:31,053 INFO L399 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] [2019-09-08 11:56:31,054 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:31,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:31,054 INFO L82 PathProgramCache]: Analyzing trace with hash -2003011199, now seen corresponding path program 1 times [2019-09-08 11:56:31,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:31,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:31,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:31,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:31,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:31,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:31,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:56:31,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:56:31,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:56:31,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:56:31,803 INFO L87 Difference]: Start difference. First operand 325 states and 409 transitions. Second operand 17 states. [2019-09-08 11:56:32,373 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 11:56:33,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:33,697 INFO L93 Difference]: Finished difference Result 645 states and 849 transitions. [2019-09-08 11:56:33,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 11:56:33,697 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2019-09-08 11:56:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:33,700 INFO L225 Difference]: With dead ends: 645 [2019-09-08 11:56:33,700 INFO L226 Difference]: Without dead ends: 511 [2019-09-08 11:56:33,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:56:33,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-08 11:56:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 314. [2019-09-08 11:56:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 11:56:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 395 transitions. [2019-09-08 11:56:33,758 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 395 transitions. Word has length 69 [2019-09-08 11:56:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:33,759 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 395 transitions. [2019-09-08 11:56:33,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:56:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 395 transitions. [2019-09-08 11:56:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:56:33,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:33,760 INFO L399 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] [2019-09-08 11:56:33,761 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:33,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:33,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1595609728, now seen corresponding path program 1 times [2019-09-08 11:56:33,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:33,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:33,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:33,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:33,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:34,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:34,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:56:34,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:56:34,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:56:34,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:56:34,072 INFO L87 Difference]: Start difference. First operand 314 states and 395 transitions. Second operand 11 states. [2019-09-08 11:56:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:34,793 INFO L93 Difference]: Finished difference Result 685 states and 927 transitions. [2019-09-08 11:56:34,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 11:56:34,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-08 11:56:34,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:34,796 INFO L225 Difference]: With dead ends: 685 [2019-09-08 11:56:34,796 INFO L226 Difference]: Without dead ends: 576 [2019-09-08 11:56:34,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:56:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-08 11:56:34,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 310. [2019-09-08 11:56:34,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 11:56:34,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 390 transitions. [2019-09-08 11:56:34,860 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 390 transitions. Word has length 70 [2019-09-08 11:56:34,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:34,860 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 390 transitions. [2019-09-08 11:56:34,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:56:34,860 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 390 transitions. [2019-09-08 11:56:34,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:56:34,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:34,861 INFO L399 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] [2019-09-08 11:56:34,862 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:34,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:34,862 INFO L82 PathProgramCache]: Analyzing trace with hash -110122555, now seen corresponding path program 1 times [2019-09-08 11:56:34,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:34,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:34,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:34,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:34,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:35,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:35,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:56:35,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:56:35,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:56:35,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:56:35,203 INFO L87 Difference]: Start difference. First operand 310 states and 390 transitions. Second operand 11 states. [2019-09-08 11:56:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:35,981 INFO L93 Difference]: Finished difference Result 671 states and 912 transitions. [2019-09-08 11:56:35,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:56:35,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-08 11:56:35,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:35,986 INFO L225 Difference]: With dead ends: 671 [2019-09-08 11:56:35,986 INFO L226 Difference]: Without dead ends: 565 [2019-09-08 11:56:35,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:56:35,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-09-08 11:56:36,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 309. [2019-09-08 11:56:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-09-08 11:56:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 388 transitions. [2019-09-08 11:56:36,053 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 388 transitions. Word has length 70 [2019-09-08 11:56:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:36,053 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 388 transitions. [2019-09-08 11:56:36,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:56:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 388 transitions. [2019-09-08 11:56:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:56:36,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:36,054 INFO L399 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] [2019-09-08 11:56:36,055 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:36,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:36,055 INFO L82 PathProgramCache]: Analyzing trace with hash -154027530, now seen corresponding path program 1 times [2019-09-08 11:56:36,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:36,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:36,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:36,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:36,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:36,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:36,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:56:36,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:56:36,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:56:36,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:56:36,501 INFO L87 Difference]: Start difference. First operand 309 states and 388 transitions. Second operand 13 states. [2019-09-08 11:56:37,045 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-09-08 11:56:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:37,983 INFO L93 Difference]: Finished difference Result 1211 states and 1679 transitions. [2019-09-08 11:56:37,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:56:37,984 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-09-08 11:56:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:37,989 INFO L225 Difference]: With dead ends: 1211 [2019-09-08 11:56:37,989 INFO L226 Difference]: Without dead ends: 1195 [2019-09-08 11:56:37,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-09-08 11:56:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-09-08 11:56:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 293. [2019-09-08 11:56:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-09-08 11:56:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 371 transitions. [2019-09-08 11:56:38,067 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 371 transitions. Word has length 70 [2019-09-08 11:56:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:38,068 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 371 transitions. [2019-09-08 11:56:38,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:56:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 371 transitions. [2019-09-08 11:56:38,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:56:38,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:38,070 INFO L399 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] [2019-09-08 11:56:38,070 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:38,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:38,071 INFO L82 PathProgramCache]: Analyzing trace with hash 918653497, now seen corresponding path program 1 times [2019-09-08 11:56:38,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:38,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:38,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:38,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:38,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:56:38,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:56:38,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:56:38,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:56:38,643 INFO L87 Difference]: Start difference. First operand 293 states and 371 transitions. Second operand 12 states. [2019-09-08 11:56:39,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:39,597 INFO L93 Difference]: Finished difference Result 684 states and 930 transitions. [2019-09-08 11:56:39,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:56:39,601 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-09-08 11:56:39,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:39,604 INFO L225 Difference]: With dead ends: 684 [2019-09-08 11:56:39,604 INFO L226 Difference]: Without dead ends: 564 [2019-09-08 11:56:39,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:56:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-08 11:56:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 277. [2019-09-08 11:56:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-08 11:56:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 351 transitions. [2019-09-08 11:56:39,676 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 351 transitions. Word has length 70 [2019-09-08 11:56:39,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:39,677 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 351 transitions. [2019-09-08 11:56:39,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:56:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 351 transitions. [2019-09-08 11:56:39,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:56:39,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:39,678 INFO L399 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] [2019-09-08 11:56:39,678 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:39,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:39,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2033083250, now seen corresponding path program 1 times [2019-09-08 11:56:39,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:39,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:39,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:39,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:39,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:40,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:40,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:56:40,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:56:40,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:56:40,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:56:40,080 INFO L87 Difference]: Start difference. First operand 277 states and 351 transitions. Second operand 12 states. [2019-09-08 11:56:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:41,347 INFO L93 Difference]: Finished difference Result 796 states and 1092 transitions. [2019-09-08 11:56:41,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:56:41,347 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-09-08 11:56:41,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:41,350 INFO L225 Difference]: With dead ends: 796 [2019-09-08 11:56:41,350 INFO L226 Difference]: Without dead ends: 671 [2019-09-08 11:56:41,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:56:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-09-08 11:56:41,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 246. [2019-09-08 11:56:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-09-08 11:56:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 311 transitions. [2019-09-08 11:56:41,421 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 311 transitions. Word has length 70 [2019-09-08 11:56:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:41,421 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 311 transitions. [2019-09-08 11:56:41,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:56:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 311 transitions. [2019-09-08 11:56:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:56:41,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:41,423 INFO L399 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] [2019-09-08 11:56:41,423 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:41,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:41,424 INFO L82 PathProgramCache]: Analyzing trace with hash -33038995, now seen corresponding path program 1 times [2019-09-08 11:56:41,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:41,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:41,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:41,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:41,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:41,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:41,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:56:41,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:56:41,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:56:41,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:56:41,545 INFO L87 Difference]: Start difference. First operand 246 states and 311 transitions. Second operand 9 states. [2019-09-08 11:56:42,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:42,345 INFO L93 Difference]: Finished difference Result 532 states and 710 transitions. [2019-09-08 11:56:42,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:56:42,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 11:56:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:42,347 INFO L225 Difference]: With dead ends: 532 [2019-09-08 11:56:42,347 INFO L226 Difference]: Without dead ends: 402 [2019-09-08 11:56:42,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:56:42,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-08 11:56:42,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 246. [2019-09-08 11:56:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-09-08 11:56:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 310 transitions. [2019-09-08 11:56:42,417 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 310 transitions. Word has length 70 [2019-09-08 11:56:42,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:42,418 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 310 transitions. [2019-09-08 11:56:42,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:56:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 310 transitions. [2019-09-08 11:56:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:56:42,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:42,419 INFO L399 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] [2019-09-08 11:56:42,419 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:42,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:42,420 INFO L82 PathProgramCache]: Analyzing trace with hash -34978696, now seen corresponding path program 1 times [2019-09-08 11:56:42,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:42,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:42,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:42,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:42,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:42,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:42,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:56:42,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:56:42,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:56:42,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:56:42,866 INFO L87 Difference]: Start difference. First operand 246 states and 310 transitions. Second operand 11 states. [2019-09-08 11:56:43,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:43,534 INFO L93 Difference]: Finished difference Result 504 states and 676 transitions. [2019-09-08 11:56:43,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:56:43,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-08 11:56:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:43,536 INFO L225 Difference]: With dead ends: 504 [2019-09-08 11:56:43,536 INFO L226 Difference]: Without dead ends: 500 [2019-09-08 11:56:43,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:56:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-09-08 11:56:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 242. [2019-09-08 11:56:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-08 11:56:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 306 transitions. [2019-09-08 11:56:43,592 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 306 transitions. Word has length 70 [2019-09-08 11:56:43,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:43,593 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 306 transitions. [2019-09-08 11:56:43,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:56:43,593 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 306 transitions. [2019-09-08 11:56:43,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:56:43,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:43,594 INFO L399 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] [2019-09-08 11:56:43,594 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:43,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:43,594 INFO L82 PathProgramCache]: Analyzing trace with hash 292721495, now seen corresponding path program 1 times [2019-09-08 11:56:43,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:43,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:43,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:43,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:43,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:43,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:43,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:56:43,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:56:43,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:56:43,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:56:43,699 INFO L87 Difference]: Start difference. First operand 242 states and 306 transitions. Second operand 9 states. [2019-09-08 11:56:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:44,287 INFO L93 Difference]: Finished difference Result 398 states and 517 transitions. [2019-09-08 11:56:44,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 11:56:44,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-08 11:56:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:44,289 INFO L225 Difference]: With dead ends: 398 [2019-09-08 11:56:44,289 INFO L226 Difference]: Without dead ends: 391 [2019-09-08 11:56:44,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:56:44,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-08 11:56:44,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 242. [2019-09-08 11:56:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-08 11:56:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 305 transitions. [2019-09-08 11:56:44,362 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 305 transitions. Word has length 71 [2019-09-08 11:56:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:44,362 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 305 transitions. [2019-09-08 11:56:44,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:56:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 305 transitions. [2019-09-08 11:56:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:56:44,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:44,363 INFO L399 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] [2019-09-08 11:56:44,364 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:44,364 INFO L82 PathProgramCache]: Analyzing trace with hash -288197998, now seen corresponding path program 1 times [2019-09-08 11:56:44,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:44,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:44,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:44,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:44,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:56:44,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:56:44,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:56:44,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:56:44,478 INFO L87 Difference]: Start difference. First operand 242 states and 305 transitions. Second operand 9 states. [2019-09-08 11:56:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:45,068 INFO L93 Difference]: Finished difference Result 398 states and 515 transitions. [2019-09-08 11:56:45,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 11:56:45,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-08 11:56:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:45,070 INFO L225 Difference]: With dead ends: 398 [2019-09-08 11:56:45,070 INFO L226 Difference]: Without dead ends: 391 [2019-09-08 11:56:45,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:56:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-08 11:56:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 242. [2019-09-08 11:56:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-08 11:56:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 304 transitions. [2019-09-08 11:56:45,133 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 304 transitions. Word has length 71 [2019-09-08 11:56:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:45,133 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 304 transitions. [2019-09-08 11:56:45,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:56:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 304 transitions. [2019-09-08 11:56:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:56:45,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:45,134 INFO L399 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] [2019-09-08 11:56:45,135 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:45,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:45,135 INFO L82 PathProgramCache]: Analyzing trace with hash -256536824, now seen corresponding path program 1 times [2019-09-08 11:56:45,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:45,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:45,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:45,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:45,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:45,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:45,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 11:56:45,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 11:56:45,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 11:56:45,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:56:45,909 INFO L87 Difference]: Start difference. First operand 242 states and 304 transitions. Second operand 23 states. [2019-09-08 11:56:46,178 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2019-09-08 11:56:47,025 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 11:56:47,227 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-08 11:56:47,473 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-09-08 11:56:47,637 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 11:56:47,792 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 11:56:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:51,600 INFO L93 Difference]: Finished difference Result 1337 states and 1859 transitions. [2019-09-08 11:56:51,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 11:56:51,601 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-09-08 11:56:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:51,605 INFO L225 Difference]: With dead ends: 1337 [2019-09-08 11:56:51,605 INFO L226 Difference]: Without dead ends: 1331 [2019-09-08 11:56:51,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=308, Invalid=1498, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 11:56:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-09-08 11:56:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 258. [2019-09-08 11:56:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-08 11:56:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 324 transitions. [2019-09-08 11:56:51,681 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 324 transitions. Word has length 72 [2019-09-08 11:56:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:51,681 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 324 transitions. [2019-09-08 11:56:51,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 11:56:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 324 transitions. [2019-09-08 11:56:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:56:51,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:51,682 INFO L399 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] [2019-09-08 11:56:51,683 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:51,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:51,683 INFO L82 PathProgramCache]: Analyzing trace with hash 424447858, now seen corresponding path program 1 times [2019-09-08 11:56:51,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:51,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:51,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:51,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:51,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:52,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:52,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 11:56:52,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:56:52,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:56:52,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:56:52,186 INFO L87 Difference]: Start difference. First operand 258 states and 324 transitions. Second operand 14 states. [2019-09-08 11:56:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:53,703 INFO L93 Difference]: Finished difference Result 533 states and 695 transitions. [2019-09-08 11:56:53,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:56:53,704 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2019-09-08 11:56:53,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:53,706 INFO L225 Difference]: With dead ends: 533 [2019-09-08 11:56:53,706 INFO L226 Difference]: Without dead ends: 513 [2019-09-08 11:56:53,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:56:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-08 11:56:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 253. [2019-09-08 11:56:53,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-08 11:56:53,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 318 transitions. [2019-09-08 11:56:53,767 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 318 transitions. Word has length 73 [2019-09-08 11:56:53,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:53,767 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 318 transitions. [2019-09-08 11:56:53,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:56:53,767 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 318 transitions. [2019-09-08 11:56:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:56:53,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:53,768 INFO L399 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] [2019-09-08 11:56:53,768 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:53,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:53,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1502313025, now seen corresponding path program 1 times [2019-09-08 11:56:53,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:53,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:53,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:53,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:53,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:54,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:54,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 11:56:54,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 11:56:54,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 11:56:54,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:56:54,596 INFO L87 Difference]: Start difference. First operand 253 states and 318 transitions. Second operand 19 states. [2019-09-08 11:56:55,206 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 11:56:55,398 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-08 11:56:55,554 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-08 11:56:55,706 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-08 11:56:55,963 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 11:56:57,226 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-09-08 11:56:58,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:58,096 INFO L93 Difference]: Finished difference Result 733 states and 981 transitions. [2019-09-08 11:56:58,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:56:58,099 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2019-09-08 11:56:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:58,102 INFO L225 Difference]: With dead ends: 733 [2019-09-08 11:56:58,102 INFO L226 Difference]: Without dead ends: 725 [2019-09-08 11:56:58,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 11:56:58,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-09-08 11:56:58,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 258. [2019-09-08 11:56:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-08 11:56:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 323 transitions. [2019-09-08 11:56:58,163 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 323 transitions. Word has length 73 [2019-09-08 11:56:58,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:58,163 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 323 transitions. [2019-09-08 11:56:58,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 11:56:58,163 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 323 transitions. [2019-09-08 11:56:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:56:58,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:58,164 INFO L399 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] [2019-09-08 11:56:58,164 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:58,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:58,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2067734093, now seen corresponding path program 1 times [2019-09-08 11:56:58,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:58,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:58,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:58,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:58,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:56:58,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:58,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:56:58,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:56:58,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:56:58,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:56:58,549 INFO L87 Difference]: Start difference. First operand 258 states and 323 transitions. Second operand 12 states. [2019-09-08 11:56:58,973 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-08 11:56:59,122 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-08 11:56:59,348 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-09-08 11:56:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:59,945 INFO L93 Difference]: Finished difference Result 614 states and 840 transitions. [2019-09-08 11:56:59,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:56:59,945 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-08 11:56:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:59,947 INFO L225 Difference]: With dead ends: 614 [2019-09-08 11:56:59,948 INFO L226 Difference]: Without dead ends: 608 [2019-09-08 11:56:59,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:56:59,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-08 11:57:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 236. [2019-09-08 11:57:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-09-08 11:57:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 297 transitions. [2019-09-08 11:57:00,019 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 297 transitions. Word has length 73 [2019-09-08 11:57:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:00,019 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 297 transitions. [2019-09-08 11:57:00,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:57:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 297 transitions. [2019-09-08 11:57:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:57:00,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:00,021 INFO L399 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] [2019-09-08 11:57:00,021 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1554071027, now seen corresponding path program 1 times [2019-09-08 11:57:00,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:00,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:00,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:00,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:00,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:57:00,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:57:00,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:57:00,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:57:00,451 INFO L87 Difference]: Start difference. First operand 236 states and 297 transitions. Second operand 13 states. [2019-09-08 11:57:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:02,024 INFO L93 Difference]: Finished difference Result 845 states and 1182 transitions. [2019-09-08 11:57:02,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:57:02,024 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2019-09-08 11:57:02,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:02,027 INFO L225 Difference]: With dead ends: 845 [2019-09-08 11:57:02,028 INFO L226 Difference]: Without dead ends: 827 [2019-09-08 11:57:02,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:57:02,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2019-09-08 11:57:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 218. [2019-09-08 11:57:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-08 11:57:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 278 transitions. [2019-09-08 11:57:02,093 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 278 transitions. Word has length 73 [2019-09-08 11:57:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:02,093 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 278 transitions. [2019-09-08 11:57:02,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:57:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 278 transitions. [2019-09-08 11:57:02,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:57:02,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:02,094 INFO L399 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] [2019-09-08 11:57:02,094 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:02,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:02,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1379799190, now seen corresponding path program 1 times [2019-09-08 11:57:02,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:02,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:02,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:02,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:02,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:02,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:02,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:57:02,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:57:02,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:57:02,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:57:02,458 INFO L87 Difference]: Start difference. First operand 218 states and 278 transitions. Second operand 10 states. [2019-09-08 11:57:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:03,009 INFO L93 Difference]: Finished difference Result 463 states and 632 transitions. [2019-09-08 11:57:03,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 11:57:03,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-09-08 11:57:03,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:03,011 INFO L225 Difference]: With dead ends: 463 [2019-09-08 11:57:03,011 INFO L226 Difference]: Without dead ends: 434 [2019-09-08 11:57:03,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:57:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-09-08 11:57:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 189. [2019-09-08 11:57:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-08 11:57:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 247 transitions. [2019-09-08 11:57:03,074 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 247 transitions. Word has length 74 [2019-09-08 11:57:03,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:03,074 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 247 transitions. [2019-09-08 11:57:03,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:57:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 247 transitions. [2019-09-08 11:57:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 11:57:03,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:03,075 INFO L399 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] [2019-09-08 11:57:03,076 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:03,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:03,076 INFO L82 PathProgramCache]: Analyzing trace with hash 973327812, now seen corresponding path program 1 times [2019-09-08 11:57:03,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:03,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:03,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:03,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:03,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:03,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:03,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:03,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:03,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:03,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:03,144 INFO L87 Difference]: Start difference. First operand 189 states and 247 transitions. Second operand 3 states. [2019-09-08 11:57:03,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:03,294 INFO L93 Difference]: Finished difference Result 391 states and 547 transitions. [2019-09-08 11:57:03,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:03,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-08 11:57:03,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:03,296 INFO L225 Difference]: With dead ends: 391 [2019-09-08 11:57:03,296 INFO L226 Difference]: Without dead ends: 286 [2019-09-08 11:57:03,297 INFO L628 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-09-08 11:57:03,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-08 11:57:03,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-09-08 11:57:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-09-08 11:57:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 386 transitions. [2019-09-08 11:57:03,392 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 386 transitions. Word has length 95 [2019-09-08 11:57:03,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:03,392 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 386 transitions. [2019-09-08 11:57:03,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 386 transitions. [2019-09-08 11:57:03,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:57:03,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:03,393 INFO L399 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] [2019-09-08 11:57:03,394 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:03,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:03,394 INFO L82 PathProgramCache]: Analyzing trace with hash -338945445, now seen corresponding path program 1 times [2019-09-08 11:57:03,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:03,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:03,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:03,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:03,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:03,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:03,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:57:03,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:57:03,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:57:03,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:57:03,466 INFO L87 Difference]: Start difference. First operand 284 states and 386 transitions. Second operand 5 states. [2019-09-08 11:57:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:04,199 INFO L93 Difference]: Finished difference Result 1232 states and 1786 transitions. [2019-09-08 11:57:04,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:57:04,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 11:57:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:04,203 INFO L225 Difference]: With dead ends: 1232 [2019-09-08 11:57:04,203 INFO L226 Difference]: Without dead ends: 1032 [2019-09-08 11:57:04,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:57:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2019-09-08 11:57:04,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 498. [2019-09-08 11:57:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-09-08 11:57:04,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 698 transitions. [2019-09-08 11:57:04,444 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 698 transitions. Word has length 97 [2019-09-08 11:57:04,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:04,444 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 698 transitions. [2019-09-08 11:57:04,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:57:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 698 transitions. [2019-09-08 11:57:04,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:57:04,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:04,446 INFO L399 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] [2019-09-08 11:57:04,446 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:04,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:04,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1085518228, now seen corresponding path program 1 times [2019-09-08 11:57:04,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:04,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:04,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:04,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:04,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:04,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:04,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:04,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:04,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:04,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:04,501 INFO L87 Difference]: Start difference. First operand 498 states and 698 transitions. Second operand 3 states. [2019-09-08 11:57:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:04,829 INFO L93 Difference]: Finished difference Result 1118 states and 1600 transitions. [2019-09-08 11:57:04,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:04,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 11:57:04,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:04,832 INFO L225 Difference]: With dead ends: 1118 [2019-09-08 11:57:04,832 INFO L226 Difference]: Without dead ends: 704 [2019-09-08 11:57:04,833 INFO L628 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-09-08 11:57:04,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-09-08 11:57:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 694. [2019-09-08 11:57:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-09-08 11:57:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 970 transitions. [2019-09-08 11:57:05,099 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 970 transitions. Word has length 97 [2019-09-08 11:57:05,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:05,100 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 970 transitions. [2019-09-08 11:57:05,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 970 transitions. [2019-09-08 11:57:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:57:05,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:05,101 INFO L399 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] [2019-09-08 11:57:05,101 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:05,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:05,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1152011740, now seen corresponding path program 1 times [2019-09-08 11:57:05,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:05,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:05,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:05,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:05,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:05,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:05,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:05,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:05,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:05,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:05,155 INFO L87 Difference]: Start difference. First operand 694 states and 970 transitions. Second operand 3 states. [2019-09-08 11:57:05,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:05,659 INFO L93 Difference]: Finished difference Result 1629 states and 2319 transitions. [2019-09-08 11:57:05,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:05,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 11:57:05,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:05,662 INFO L225 Difference]: With dead ends: 1629 [2019-09-08 11:57:05,662 INFO L226 Difference]: Without dead ends: 1019 [2019-09-08 11:57:05,663 INFO L628 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-09-08 11:57:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-09-08 11:57:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1017. [2019-09-08 11:57:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2019-09-08 11:57:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1429 transitions. [2019-09-08 11:57:06,079 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1429 transitions. Word has length 97 [2019-09-08 11:57:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:06,080 INFO L475 AbstractCegarLoop]: Abstraction has 1017 states and 1429 transitions. [2019-09-08 11:57:06,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1429 transitions. [2019-09-08 11:57:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:57:06,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:06,082 INFO L399 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] [2019-09-08 11:57:06,082 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:06,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:06,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1716786779, now seen corresponding path program 1 times [2019-09-08 11:57:06,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:06,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:06,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:06,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:06,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:06,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:06,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:57:06,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:57:06,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:57:06,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:57:06,144 INFO L87 Difference]: Start difference. First operand 1017 states and 1429 transitions. Second operand 5 states. [2019-09-08 11:57:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:07,917 INFO L93 Difference]: Finished difference Result 4713 states and 6681 transitions. [2019-09-08 11:57:07,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:57:07,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 11:57:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:07,932 INFO L225 Difference]: With dead ends: 4713 [2019-09-08 11:57:07,932 INFO L226 Difference]: Without dead ends: 3780 [2019-09-08 11:57:07,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:57:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2019-09-08 11:57:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 2020. [2019-09-08 11:57:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-09-08 11:57:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2840 transitions. [2019-09-08 11:57:08,735 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2840 transitions. Word has length 97 [2019-09-08 11:57:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:08,735 INFO L475 AbstractCegarLoop]: Abstraction has 2020 states and 2840 transitions. [2019-09-08 11:57:08,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:57:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2840 transitions. [2019-09-08 11:57:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:57:08,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:08,737 INFO L399 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] [2019-09-08 11:57:08,737 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:08,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:08,737 INFO L82 PathProgramCache]: Analyzing trace with hash -703031205, now seen corresponding path program 1 times [2019-09-08 11:57:08,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:08,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:08,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:08,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:08,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:08,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:08,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:57:08,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:57:08,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:57:08,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:57:08,792 INFO L87 Difference]: Start difference. First operand 2020 states and 2840 transitions. Second operand 5 states. [2019-09-08 11:57:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:11,637 INFO L93 Difference]: Finished difference Result 8460 states and 11940 transitions. [2019-09-08 11:57:11,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:57:11,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 11:57:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:11,651 INFO L225 Difference]: With dead ends: 8460 [2019-09-08 11:57:11,651 INFO L226 Difference]: Without dead ends: 6524 [2019-09-08 11:57:11,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:57:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6524 states. [2019-09-08 11:57:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6524 to 4098. [2019-09-08 11:57:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-09-08 11:57:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5734 transitions. [2019-09-08 11:57:13,312 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5734 transitions. Word has length 97 [2019-09-08 11:57:13,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:13,313 INFO L475 AbstractCegarLoop]: Abstraction has 4098 states and 5734 transitions. [2019-09-08 11:57:13,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:57:13,313 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5734 transitions. [2019-09-08 11:57:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:57:13,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:13,314 INFO L399 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] [2019-09-08 11:57:13,315 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:13,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:13,315 INFO L82 PathProgramCache]: Analyzing trace with hash -71633169, now seen corresponding path program 1 times [2019-09-08 11:57:13,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:13,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:13,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:13,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:13,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:13,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:13,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:13,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:13,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:13,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:13,363 INFO L87 Difference]: Start difference. First operand 4098 states and 5734 transitions. Second operand 3 states. [2019-09-08 11:57:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:15,200 INFO L93 Difference]: Finished difference Result 8526 states and 11952 transitions. [2019-09-08 11:57:15,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:15,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 11:57:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:15,211 INFO L225 Difference]: With dead ends: 8526 [2019-09-08 11:57:15,211 INFO L226 Difference]: Without dead ends: 4512 [2019-09-08 11:57:15,218 INFO L628 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-09-08 11:57:15,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2019-09-08 11:57:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4462. [2019-09-08 11:57:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4462 states. [2019-09-08 11:57:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4462 states to 4462 states and 6202 transitions. [2019-09-08 11:57:17,164 INFO L78 Accepts]: Start accepts. Automaton has 4462 states and 6202 transitions. Word has length 98 [2019-09-08 11:57:17,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:17,165 INFO L475 AbstractCegarLoop]: Abstraction has 4462 states and 6202 transitions. [2019-09-08 11:57:17,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4462 states and 6202 transitions. [2019-09-08 11:57:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:57:17,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:17,166 INFO L399 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] [2019-09-08 11:57:17,166 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:17,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:17,166 INFO L82 PathProgramCache]: Analyzing trace with hash -755637834, now seen corresponding path program 1 times [2019-09-08 11:57:17,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:17,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:17,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:17,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:17,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:17,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:17,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:57:17,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:57:17,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:57:17,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:57:17,222 INFO L87 Difference]: Start difference. First operand 4462 states and 6202 transitions. Second operand 5 states. [2019-09-08 11:57:21,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:21,524 INFO L93 Difference]: Finished difference Result 13766 states and 19038 transitions. [2019-09-08 11:57:21,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:57:21,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 11:57:21,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:21,543 INFO L225 Difference]: With dead ends: 13766 [2019-09-08 11:57:21,543 INFO L226 Difference]: Without dead ends: 9388 [2019-09-08 11:57:21,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:57:21,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9388 states. [2019-09-08 11:57:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9388 to 5494. [2019-09-08 11:57:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5494 states. [2019-09-08 11:57:24,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5494 states to 5494 states and 7522 transitions. [2019-09-08 11:57:24,032 INFO L78 Accepts]: Start accepts. Automaton has 5494 states and 7522 transitions. Word has length 98 [2019-09-08 11:57:24,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:24,032 INFO L475 AbstractCegarLoop]: Abstraction has 5494 states and 7522 transitions. [2019-09-08 11:57:24,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:57:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 5494 states and 7522 transitions. [2019-09-08 11:57:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:57:24,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:24,033 INFO L399 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] [2019-09-08 11:57:24,033 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:24,034 INFO L82 PathProgramCache]: Analyzing trace with hash 911061584, now seen corresponding path program 1 times [2019-09-08 11:57:24,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:24,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:24,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:24,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:24,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:24,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:24,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:57:24,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:57:24,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:57:24,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:57:24,113 INFO L87 Difference]: Start difference. First operand 5494 states and 7522 transitions. Second operand 6 states. [2019-09-08 11:57:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:28,226 INFO L93 Difference]: Finished difference Result 8766 states and 11779 transitions. [2019-09-08 11:57:28,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:57:28,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-08 11:57:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:28,242 INFO L225 Difference]: With dead ends: 8766 [2019-09-08 11:57:28,243 INFO L226 Difference]: Without dead ends: 8764 [2019-09-08 11:57:28,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:57:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8764 states. [2019-09-08 11:57:30,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8764 to 5590. [2019-09-08 11:57:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5590 states. [2019-09-08 11:57:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 7586 transitions. [2019-09-08 11:57:30,882 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 7586 transitions. Word has length 98 [2019-09-08 11:57:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:30,882 INFO L475 AbstractCegarLoop]: Abstraction has 5590 states and 7586 transitions. [2019-09-08 11:57:30,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:57:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 7586 transitions. [2019-09-08 11:57:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:57:30,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:30,883 INFO L399 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] [2019-09-08 11:57:30,884 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:30,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:30,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2097306132, now seen corresponding path program 1 times [2019-09-08 11:57:30,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:30,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:30,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:30,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:30,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:30,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:30,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:30,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:30,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:30,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:30,933 INFO L87 Difference]: Start difference. First operand 5590 states and 7586 transitions. Second operand 3 states. [2019-09-08 11:57:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:33,262 INFO L93 Difference]: Finished difference Result 10786 states and 14612 transitions. [2019-09-08 11:57:33,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:33,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:57:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:33,269 INFO L225 Difference]: With dead ends: 10786 [2019-09-08 11:57:33,269 INFO L226 Difference]: Without dead ends: 5280 [2019-09-08 11:57:33,278 INFO L628 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-09-08 11:57:33,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2019-09-08 11:57:35,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 4614. [2019-09-08 11:57:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4614 states. [2019-09-08 11:57:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 6164 transitions. [2019-09-08 11:57:35,386 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 6164 transitions. Word has length 99 [2019-09-08 11:57:35,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:35,386 INFO L475 AbstractCegarLoop]: Abstraction has 4614 states and 6164 transitions. [2019-09-08 11:57:35,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 6164 transitions. [2019-09-08 11:57:35,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:57:35,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:35,387 INFO L399 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] [2019-09-08 11:57:35,388 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:35,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:35,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1226521472, now seen corresponding path program 1 times [2019-09-08 11:57:35,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:35,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:35,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:35,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:35,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:35,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:35,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:35,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:35,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:35,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:35,437 INFO L87 Difference]: Start difference. First operand 4614 states and 6164 transitions. Second operand 3 states. [2019-09-08 11:57:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:38,539 INFO L93 Difference]: Finished difference Result 11382 states and 15190 transitions. [2019-09-08 11:57:38,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:38,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 11:57:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:38,587 INFO L225 Difference]: With dead ends: 11382 [2019-09-08 11:57:38,588 INFO L226 Difference]: Without dead ends: 6852 [2019-09-08 11:57:38,592 INFO L628 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-09-08 11:57:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6852 states. [2019-09-08 11:57:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 4968. [2019-09-08 11:57:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4968 states. [2019-09-08 11:57:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4968 states to 4968 states and 6542 transitions. [2019-09-08 11:57:40,680 INFO L78 Accepts]: Start accepts. Automaton has 4968 states and 6542 transitions. Word has length 100 [2019-09-08 11:57:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:40,680 INFO L475 AbstractCegarLoop]: Abstraction has 4968 states and 6542 transitions. [2019-09-08 11:57:40,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:40,680 INFO L276 IsEmpty]: Start isEmpty. Operand 4968 states and 6542 transitions. [2019-09-08 11:57:40,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 11:57:40,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:40,681 INFO L399 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] [2019-09-08 11:57:40,681 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:40,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:40,681 INFO L82 PathProgramCache]: Analyzing trace with hash -82823700, now seen corresponding path program 1 times [2019-09-08 11:57:40,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:40,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:40,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:40,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:40,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:40,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:40,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:40,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:40,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:40,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:40,735 INFO L87 Difference]: Start difference. First operand 4968 states and 6542 transitions. Second operand 3 states. [2019-09-08 11:57:43,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:43,458 INFO L93 Difference]: Finished difference Result 10898 states and 14274 transitions. [2019-09-08 11:57:43,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:43,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 11:57:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:43,465 INFO L225 Difference]: With dead ends: 10898 [2019-09-08 11:57:43,466 INFO L226 Difference]: Without dead ends: 6014 [2019-09-08 11:57:43,470 INFO L628 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-09-08 11:57:43,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2019-09-08 11:57:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 5698. [2019-09-08 11:57:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5698 states. [2019-09-08 11:57:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 7390 transitions. [2019-09-08 11:57:45,959 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 7390 transitions. Word has length 101 [2019-09-08 11:57:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:45,960 INFO L475 AbstractCegarLoop]: Abstraction has 5698 states and 7390 transitions. [2019-09-08 11:57:45,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 7390 transitions. [2019-09-08 11:57:45,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:57:45,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:45,960 INFO L399 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] [2019-09-08 11:57:45,961 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:45,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:45,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1734817196, now seen corresponding path program 1 times [2019-09-08 11:57:45,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:45,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:45,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:45,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:45,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:46,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:46,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:46,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:46,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:46,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:46,005 INFO L87 Difference]: Start difference. First operand 5698 states and 7390 transitions. Second operand 3 states. [2019-09-08 11:57:48,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:48,798 INFO L93 Difference]: Finished difference Result 11678 states and 15136 transitions. [2019-09-08 11:57:48,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:48,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 11:57:48,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:48,805 INFO L225 Difference]: With dead ends: 11678 [2019-09-08 11:57:48,805 INFO L226 Difference]: Without dead ends: 6064 [2019-09-08 11:57:48,812 INFO L628 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-09-08 11:57:48,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6064 states. [2019-09-08 11:57:51,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6064 to 5942. [2019-09-08 11:57:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5942 states. [2019-09-08 11:57:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5942 states to 5942 states and 7634 transitions. [2019-09-08 11:57:51,469 INFO L78 Accepts]: Start accepts. Automaton has 5942 states and 7634 transitions. Word has length 102 [2019-09-08 11:57:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:51,469 INFO L475 AbstractCegarLoop]: Abstraction has 5942 states and 7634 transitions. [2019-09-08 11:57:51,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 5942 states and 7634 transitions. [2019-09-08 11:57:51,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 11:57:51,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:51,471 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:57:51,471 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:51,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:51,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1955395367, now seen corresponding path program 1 times [2019-09-08 11:57:51,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:51,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:51,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:51,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:51,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 11:57:51,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:51,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:57:51,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:57:51,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:57:51,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:57:51,600 INFO L87 Difference]: Start difference. First operand 5942 states and 7634 transitions. Second operand 6 states. [2019-09-08 11:58:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:02,847 INFO L93 Difference]: Finished difference Result 29572 states and 37931 transitions. [2019-09-08 11:58:02,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:58:02,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-08 11:58:02,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:02,870 INFO L225 Difference]: With dead ends: 29572 [2019-09-08 11:58:02,870 INFO L226 Difference]: Without dead ends: 23714 [2019-09-08 11:58:02,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23714 states. [2019-09-08 11:58:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23714 to 9734. [2019-09-08 11:58:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9734 states. [2019-09-08 11:58:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9734 states to 9734 states and 12442 transitions. [2019-09-08 11:58:07,616 INFO L78 Accepts]: Start accepts. Automaton has 9734 states and 12442 transitions. Word has length 126 [2019-09-08 11:58:07,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:07,616 INFO L475 AbstractCegarLoop]: Abstraction has 9734 states and 12442 transitions. [2019-09-08 11:58:07,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:58:07,616 INFO L276 IsEmpty]: Start isEmpty. Operand 9734 states and 12442 transitions. [2019-09-08 11:58:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 11:58:07,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:07,618 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:58:07,619 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:07,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:07,619 INFO L82 PathProgramCache]: Analyzing trace with hash 100336857, now seen corresponding path program 1 times [2019-09-08 11:58:07,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:07,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:07,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:07,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:07,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 11:58:07,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:07,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:58:07,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:58:07,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:58:07,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:58:07,721 INFO L87 Difference]: Start difference. First operand 9734 states and 12442 transitions. Second operand 6 states. [2019-09-08 11:58:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:20,698 INFO L93 Difference]: Finished difference Result 33064 states and 42331 transitions. [2019-09-08 11:58:20,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:58:20,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-08 11:58:20,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:20,723 INFO L225 Difference]: With dead ends: 33064 [2019-09-08 11:58:20,724 INFO L226 Difference]: Without dead ends: 27206 [2019-09-08 11:58:20,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:58:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27206 states. [2019-09-08 11:58:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27206 to 15390. [2019-09-08 11:58:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15390 states. [2019-09-08 11:58:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15390 states to 15390 states and 19574 transitions. [2019-09-08 11:58:28,097 INFO L78 Accepts]: Start accepts. Automaton has 15390 states and 19574 transitions. Word has length 126 [2019-09-08 11:58:28,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:28,098 INFO L475 AbstractCegarLoop]: Abstraction has 15390 states and 19574 transitions. [2019-09-08 11:58:28,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:58:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 15390 states and 19574 transitions. [2019-09-08 11:58:28,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 11:58:28,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:28,100 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:58:28,100 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:28,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:28,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1975486169, now seen corresponding path program 1 times [2019-09-08 11:58:28,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:28,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:28,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:28,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:28,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:28,167 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:58:28,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:28,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:58:28,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:58:28,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:58:28,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:58:28,169 INFO L87 Difference]: Start difference. First operand 15390 states and 19574 transitions. Second operand 3 states. [2019-09-08 11:58:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:35,306 INFO L93 Difference]: Finished difference Result 29062 states and 36740 transitions. [2019-09-08 11:58:35,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:58:35,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 11:58:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:35,320 INFO L225 Difference]: With dead ends: 29062 [2019-09-08 11:58:35,320 INFO L226 Difference]: Without dead ends: 13756 [2019-09-08 11:58:35,337 INFO L628 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-09-08 11:58:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13756 states. [2019-09-08 11:58:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13756 to 13694. [2019-09-08 11:58:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13694 states. [2019-09-08 11:58:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13694 states to 13694 states and 16918 transitions. [2019-09-08 11:58:42,121 INFO L78 Accepts]: Start accepts. Automaton has 13694 states and 16918 transitions. Word has length 126 [2019-09-08 11:58:42,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:42,122 INFO L475 AbstractCegarLoop]: Abstraction has 13694 states and 16918 transitions. [2019-09-08 11:58:42,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:58:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 13694 states and 16918 transitions. [2019-09-08 11:58:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 11:58:42,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:42,124 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:58:42,125 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:42,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:42,125 INFO L82 PathProgramCache]: Analyzing trace with hash -430522632, now seen corresponding path program 1 times [2019-09-08 11:58:42,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:42,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:42,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:42,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:42,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 11:58:42,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:42,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:58:42,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:58:42,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:58:42,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:58:42,365 INFO L87 Difference]: Start difference. First operand 13694 states and 16918 transitions. Second operand 6 states. [2019-09-08 11:58:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:56,596 INFO L93 Difference]: Finished difference Result 31756 states and 39477 transitions. [2019-09-08 11:58:56,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:58:56,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-08 11:58:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:56,619 INFO L225 Difference]: With dead ends: 31756 [2019-09-08 11:58:56,619 INFO L226 Difference]: Without dead ends: 26954 [2019-09-08 11:58:56,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:58:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26954 states. [2019-09-08 11:59:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26954 to 17230. [2019-09-08 11:59:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17230 states. [2019-09-08 11:59:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17230 states to 17230 states and 21278 transitions. [2019-09-08 11:59:05,186 INFO L78 Accepts]: Start accepts. Automaton has 17230 states and 21278 transitions. Word has length 127 [2019-09-08 11:59:05,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:05,187 INFO L475 AbstractCegarLoop]: Abstraction has 17230 states and 21278 transitions. [2019-09-08 11:59:05,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:59:05,187 INFO L276 IsEmpty]: Start isEmpty. Operand 17230 states and 21278 transitions. [2019-09-08 11:59:05,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 11:59:05,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:05,189 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:59:05,189 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:05,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:05,189 INFO L82 PathProgramCache]: Analyzing trace with hash 674022136, now seen corresponding path program 1 times [2019-09-08 11:59:05,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:05,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:05,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:05,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:05,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 11:59:05,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:05,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:59:05,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:59:05,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:59:05,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:59:05,305 INFO L87 Difference]: Start difference. First operand 17230 states and 21278 transitions. Second operand 6 states. [2019-09-08 11:59:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:20,783 INFO L93 Difference]: Finished difference Result 35172 states and 43681 transitions. [2019-09-08 11:59:20,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:59:20,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-08 11:59:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:20,810 INFO L225 Difference]: With dead ends: 35172 [2019-09-08 11:59:20,810 INFO L226 Difference]: Without dead ends: 30370 [2019-09-08 11:59:20,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:20,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30370 states. [2019-09-08 11:59:31,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30370 to 20766. [2019-09-08 11:59:31,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20766 states. [2019-09-08 11:59:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20766 states to 20766 states and 25638 transitions. [2019-09-08 11:59:31,741 INFO L78 Accepts]: Start accepts. Automaton has 20766 states and 25638 transitions. Word has length 127 [2019-09-08 11:59:31,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:31,741 INFO L475 AbstractCegarLoop]: Abstraction has 20766 states and 25638 transitions. [2019-09-08 11:59:31,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:59:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 20766 states and 25638 transitions. [2019-09-08 11:59:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:59:31,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:31,745 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:59:31,745 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:31,745 INFO L82 PathProgramCache]: Analyzing trace with hash -827875054, now seen corresponding path program 1 times [2019-09-08 11:59:31,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:31,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:31,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:31,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:31,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 11:59:31,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:31,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:59:31,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:59:31,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:59:31,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:31,880 INFO L87 Difference]: Start difference. First operand 20766 states and 25638 transitions. Second operand 9 states. [2019-09-08 11:59:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:54,250 INFO L93 Difference]: Finished difference Result 62156 states and 76764 transitions. [2019-09-08 11:59:54,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:59:54,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-08 11:59:54,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:54,291 INFO L225 Difference]: With dead ends: 62156 [2019-09-08 11:59:54,291 INFO L226 Difference]: Without dead ends: 41468 [2019-09-08 11:59:54,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:59:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41468 states. [2019-09-08 12:00:05,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41468 to 20766. [2019-09-08 12:00:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20766 states. [2019-09-08 12:00:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20766 states to 20766 states and 25637 transitions. [2019-09-08 12:00:05,034 INFO L78 Accepts]: Start accepts. Automaton has 20766 states and 25637 transitions. Word has length 128 [2019-09-08 12:00:05,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:05,034 INFO L475 AbstractCegarLoop]: Abstraction has 20766 states and 25637 transitions. [2019-09-08 12:00:05,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:00:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 20766 states and 25637 transitions. [2019-09-08 12:00:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:00:05,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:05,037 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:00:05,037 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:05,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:05,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1614558263, now seen corresponding path program 1 times [2019-09-08 12:00:05,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:05,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:05,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:05,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:05,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:00:05,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:00:05,457 INFO L223 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-09-08 12:00:05,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:05,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 12:00:05,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:00:06,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:00:06,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:00:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 12:00:06,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:00:06,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-09-08 12:00:06,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:00:06,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:00:06,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:00:06,671 INFO L87 Difference]: Start difference. First operand 20766 states and 25637 transitions. Second operand 20 states. [2019-09-08 12:00:06,971 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 12:00:07,474 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 12:00:08,256 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-08 12:00:08,602 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 12:00:09,316 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-08 12:00:09,771 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 12:00:10,097 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-08 12:00:10,381 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 12:00:10,658 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-08 12:00:11,032 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 12:00:11,325 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-08 12:00:11,526 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-08 12:00:11,878 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-08 12:00:12,303 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 12:00:12,541 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-08 12:00:13,070 WARN L188 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 12:00:13,716 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-08 12:00:14,084 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-08 12:00:14,446 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-08 12:00:14,706 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-08 12:00:15,297 WARN L188 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-08 12:00:15,592 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-08 12:00:16,058 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 12:00:16,639 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-08 12:00:17,034 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-08 12:00:17,428 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-08 12:00:17,826 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-09-08 12:00:18,235 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-08 12:00:18,729 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-08 12:00:19,007 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-08 12:00:19,339 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-08 12:00:19,674 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-08 12:00:20,176 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-08 12:00:20,596 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-08 12:00:22,181 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-08 12:00:22,615 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 12:00:23,265 WARN L188 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 12:00:23,609 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-08 12:00:23,942 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 12:00:24,830 WARN L188 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-08 12:00:25,135 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 12:00:25,595 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 12:00:25,986 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 12:00:26,488 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-08 12:00:26,920 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-08 12:00:27,307 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-09-08 12:00:27,689 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 12:00:28,308 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-08 12:00:28,747 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-08 12:00:29,129 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-08 12:00:29,560 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-08 12:00:30,222 WARN L188 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 12:00:30,855 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-08 12:00:31,371 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-09-08 12:00:31,781 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 12:00:32,123 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-08 12:00:32,450 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 12:00:32,721 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-08 12:00:33,057 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-09-08 12:00:33,397 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-08 12:00:33,825 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-08 12:00:34,310 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-08 12:00:34,642 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-08 12:00:35,040 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2019-09-08 12:00:35,353 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-08 12:00:35,738 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-08 12:00:36,062 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-08 12:00:36,409 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-08 12:00:36,944 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-08 12:00:37,403 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-08 12:00:37,678 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-08 12:00:38,072 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 12:00:38,793 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 12:00:39,134 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-08 12:00:42,134 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-08 12:00:42,829 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 12:00:43,213 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 12:00:44,300 WARN L188 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-08 12:00:44,649 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-08 12:00:45,045 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 12:00:45,404 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-08 12:00:46,291 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-08 12:00:46,781 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-08 12:00:47,208 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-08 12:00:47,505 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-08 12:00:47,771 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 12:00:48,500 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-08 12:00:48,976 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-08 12:00:49,325 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 12:00:49,761 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-08 12:00:50,204 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 12:00:51,655 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-08 12:00:52,293 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-08 12:00:52,873 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-09-08 12:00:53,265 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 12:00:53,622 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 12:00:54,067 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-08 12:01:00,184 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-08 12:01:00,705 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 12:01:02,031 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-08 12:01:02,530 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 12:01:03,299 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-08 12:01:03,821 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-08 12:01:04,596 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 12:01:05,633 WARN L188 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 12:01:12,107 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 12:01:12,933 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 12:01:13,769 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 12:01:14,206 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 12:01:15,689 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 12:01:16,735 WARN L188 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 12:01:17,222 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 12:01:18,413 WARN L188 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-08 12:01:22,903 WARN L188 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 12:01:23,564 WARN L188 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 12:01:23,995 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-08 12:01:25,692 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-08 12:01:26,788 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-08 12:01:27,181 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-08 12:01:27,783 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-08 12:01:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:01:57,875 INFO L93 Difference]: Finished difference Result 113650 states and 138928 transitions. [2019-09-08 12:01:57,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-08 12:01:57,875 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 130 [2019-09-08 12:01:57,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:01:58,260 INFO L225 Difference]: With dead ends: 113650 [2019-09-08 12:01:58,260 INFO L226 Difference]: Without dead ends: 92968 [2019-09-08 12:01:58,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7274 ImplicationChecksByTransitivity, 46.5s TimeCoverageRelationStatistics Valid=3777, Invalid=16529, Unknown=0, NotChecked=0, Total=20306 [2019-09-08 12:01:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92968 states. [2019-09-08 12:02:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92968 to 62446. [2019-09-08 12:02:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62446 states. [2019-09-08 12:02:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62446 states to 62446 states and 76768 transitions. [2019-09-08 12:02:40,429 INFO L78 Accepts]: Start accepts. Automaton has 62446 states and 76768 transitions. Word has length 130 [2019-09-08 12:02:40,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:40,430 INFO L475 AbstractCegarLoop]: Abstraction has 62446 states and 76768 transitions. [2019-09-08 12:02:40,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:02:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 62446 states and 76768 transitions. [2019-09-08 12:02:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 12:02:40,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:40,443 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:02:40,444 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:40,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1802869750, now seen corresponding path program 1 times [2019-09-08 12:02:40,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:40,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:40,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:40,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:40,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:02:40,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:02:40,813 INFO L223 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-09-08 12:02:40,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:40,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 12:02:40,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:02:41,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:02:41,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:02:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:02:41,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:02:41,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-09-08 12:02:41,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:02:41,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:02:41,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:02:41,554 INFO L87 Difference]: Start difference. First operand 62446 states and 76768 transitions. Second operand 20 states. [2019-09-08 12:02:41,755 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-08 12:02:42,276 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 12:02:42,479 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 12:02:43,085 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:02:43,570 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:02:43,965 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:02:44,362 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:02:44,752 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:02:45,150 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:02:45,487 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:02:45,712 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:02:45,956 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:02:46,245 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 12:02:47,817 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 12:02:48,083 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:03:01,312 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:03:02,073 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 12:03:02,377 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 12:03:06,111 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 12:03:44,974 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 12:05:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:05,604 INFO L93 Difference]: Finished difference Result 247730 states and 301904 transitions. [2019-09-08 12:05:05,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:05:05,605 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 131 [2019-09-08 12:05:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:06,057 INFO L225 Difference]: With dead ends: 247730 [2019-09-08 12:05:06,058 INFO L226 Difference]: Without dead ends: 185400 [2019-09-08 12:05:06,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=496, Invalid=1310, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 12:05:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185400 states. [2019-09-08 12:06:38,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185400 to 125402. [2019-09-08 12:06:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125402 states. [2019-09-08 12:06:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125402 states to 125402 states and 153348 transitions. [2019-09-08 12:06:38,168 INFO L78 Accepts]: Start accepts. Automaton has 125402 states and 153348 transitions. Word has length 131 [2019-09-08 12:06:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:38,168 INFO L475 AbstractCegarLoop]: Abstraction has 125402 states and 153348 transitions. [2019-09-08 12:06:38,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:06:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 125402 states and 153348 transitions. [2019-09-08 12:06:38,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:06:38,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:38,177 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:06:38,177 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:38,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:38,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1670981759, now seen corresponding path program 1 times [2019-09-08 12:06:38,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:38,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:38,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:38,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:38,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:38,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:06:38,400 INFO L223 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) [2019-09-08 12:06:38,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:06:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:38,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 12:06:38,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:06:38,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:06:38,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:06:39,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:06:39,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:06:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:39,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:06:39,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-08 12:06:39,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:06:39,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:06:39,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:06:39,295 INFO L87 Difference]: Start difference. First operand 125402 states and 153348 transitions. Second operand 20 states.