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.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:30:51,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:30:51,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:30:51,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:30:51,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:30:51,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:30:51,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:30:51,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:30:51,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:30:51,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:30:51,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:30:51,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:30:51,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:30:51,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:30:51,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:30:51,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:30:51,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:30:51,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:30:51,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:30:51,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:30:51,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:30:51,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:30:51,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:30:51,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:30:51,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:30:51,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:30:51,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:30:51,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:30:51,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:30:51,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:30:51,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:30:51,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:30:51,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:30:51,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:30:51,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:30:51,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:30:51,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:30:51,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:30:51,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:30:51,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:30:51,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:30:51,689 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 12:30:51,703 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:30:51,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:30:51,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:30:51,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:30:51,705 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:30:51,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:30:51,705 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:30:51,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:30:51,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:30:51,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:30:51,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:30:51,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:30:51,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:30:51,707 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:30:51,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:30:51,707 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:30:51,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:30:51,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:30:51,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:30:51,708 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:30:51,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:30:51,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:30:51,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:30:51,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:30:51,709 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:30:51,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:30:51,709 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:30:51,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:30:51,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:30:51,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:30:51,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:30:51,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:30:51,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:30:51,768 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:30:51,769 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:30:51,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c68528b6/53723949f679443383ab231f8cb95eb4/FLAG8eb8c370c [2019-09-08 12:30:52,640 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:30:52,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:30:52,676 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c68528b6/53723949f679443383ab231f8cb95eb4/FLAG8eb8c370c [2019-09-08 12:30:52,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c68528b6/53723949f679443383ab231f8cb95eb4 [2019-09-08 12:30:52,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:30:52,720 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:30:52,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:30:52,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:30:52,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:30:52,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:30:52" (1/1) ... [2019-09-08 12:30:52,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7669911c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:30:52, skipping insertion in model container [2019-09-08 12:30:52,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:30:52" (1/1) ... [2019-09-08 12:30:52,738 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:30:52,891 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:30:54,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:30:54,322 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:30:54,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:30:54,999 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:30:54,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:30:54 WrapperNode [2019-09-08 12:30:55,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:30:55,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:30:55,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:30:55,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:30:55,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:30:54" (1/1) ... [2019-09-08 12:30:55,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:30:54" (1/1) ... [2019-09-08 12:30:55,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:30:54" (1/1) ... [2019-09-08 12:30:55,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:30:54" (1/1) ... [2019-09-08 12:30:55,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:30:54" (1/1) ... [2019-09-08 12:30:55,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:30:54" (1/1) ... [2019-09-08 12:30:55,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:30:54" (1/1) ... [2019-09-08 12:30:55,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:30:55,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:30:55,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:30:55,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:30:55,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:30:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:30:55,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:30:55,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:30:55,355 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:30:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:30:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:30:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:30:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:30:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:30:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:30:55,359 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:30:55,359 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:30:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:30:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:30:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:30:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:30:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:30:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:30:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:30:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:30:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:30:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:30:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:30:58,779 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:30:58,780 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:30:58,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:30:58 BoogieIcfgContainer [2019-09-08 12:30:58,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:30:58,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:30:58,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:30:58,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:30:58,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:30:52" (1/3) ... [2019-09-08 12:30:58,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61428018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:30:58, skipping insertion in model container [2019-09-08 12:30:58,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:30:54" (2/3) ... [2019-09-08 12:30:58,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61428018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:30:58, skipping insertion in model container [2019-09-08 12:30:58,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:30:58" (3/3) ... [2019-09-08 12:30:58,795 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:30:58,805 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:30:58,838 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-08 12:30:58,857 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-08 12:30:58,908 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:30:58,908 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:30:58,909 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:30:58,909 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:30:58,909 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:30:58,909 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:30:58,909 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:30:58,910 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:30:58,910 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:30:58,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states. [2019-09-08 12:30:59,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:30:59,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:59,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, 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:30:59,008 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:59,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:59,015 INFO L82 PathProgramCache]: Analyzing trace with hash -583578649, now seen corresponding path program 1 times [2019-09-08 12:30:59,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:59,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:59,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:59,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:59,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:59,800 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 12:30:59,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:59,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:30:59,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:30:59,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:30:59,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:30:59,825 INFO L87 Difference]: Start difference. First operand 1129 states. Second operand 5 states. [2019-09-08 12:31:00,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:00,790 INFO L93 Difference]: Finished difference Result 1710 states and 3006 transitions. [2019-09-08 12:31:00,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:31:00,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-08 12:31:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:00,813 INFO L225 Difference]: With dead ends: 1710 [2019-09-08 12:31:00,813 INFO L226 Difference]: Without dead ends: 872 [2019-09-08 12:31:00,821 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 12:31:00,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-09-08 12:31:00,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2019-09-08 12:31:00,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-09-08 12:31:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1122 transitions. [2019-09-08 12:31:00,919 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1122 transitions. Word has length 89 [2019-09-08 12:31:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:00,919 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 1122 transitions. [2019-09-08 12:31:00,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1122 transitions. [2019-09-08 12:31:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:31:00,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:00,928 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] [2019-09-08 12:31:00,931 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:00,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:00,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2090250761, now seen corresponding path program 1 times [2019-09-08 12:31:00,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:00,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:00,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:00,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:00,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:01,270 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 12:31:01,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:01,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:31:01,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:31:01,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:31:01,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:31:01,276 INFO L87 Difference]: Start difference. First operand 872 states and 1122 transitions. Second operand 5 states. [2019-09-08 12:31:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:01,867 INFO L93 Difference]: Finished difference Result 1441 states and 1910 transitions. [2019-09-08 12:31:01,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:31:01,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-08 12:31:01,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:01,873 INFO L225 Difference]: With dead ends: 1441 [2019-09-08 12:31:01,873 INFO L226 Difference]: Without dead ends: 747 [2019-09-08 12:31:01,875 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 12:31:01,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-09-08 12:31:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-09-08 12:31:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-09-08 12:31:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 980 transitions. [2019-09-08 12:31:01,915 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 980 transitions. Word has length 90 [2019-09-08 12:31:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:01,917 INFO L475 AbstractCegarLoop]: Abstraction has 747 states and 980 transitions. [2019-09-08 12:31:01,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 980 transitions. [2019-09-08 12:31:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:31:01,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:01,922 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] [2019-09-08 12:31:01,923 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:01,924 INFO L82 PathProgramCache]: Analyzing trace with hash -592131867, now seen corresponding path program 1 times [2019-09-08 12:31:01,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:01,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:01,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:01,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:01,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:02,106 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 12:31:02,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:02,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:31:02,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:31:02,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:31:02,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:31:02,108 INFO L87 Difference]: Start difference. First operand 747 states and 980 transitions. Second operand 5 states. [2019-09-08 12:31:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:02,689 INFO L93 Difference]: Finished difference Result 1316 states and 1767 transitions. [2019-09-08 12:31:02,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:31:02,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-08 12:31:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:02,694 INFO L225 Difference]: With dead ends: 1316 [2019-09-08 12:31:02,694 INFO L226 Difference]: Without dead ends: 689 [2019-09-08 12:31:02,696 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 12:31:02,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-09-08 12:31:02,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-09-08 12:31:02,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-09-08 12:31:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 913 transitions. [2019-09-08 12:31:02,725 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 913 transitions. Word has length 91 [2019-09-08 12:31:02,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:02,726 INFO L475 AbstractCegarLoop]: Abstraction has 689 states and 913 transitions. [2019-09-08 12:31:02,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 913 transitions. [2019-09-08 12:31:02,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:31:02,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:02,729 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] [2019-09-08 12:31:02,730 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:02,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:02,730 INFO L82 PathProgramCache]: Analyzing trace with hash -21106018, now seen corresponding path program 1 times [2019-09-08 12:31:02,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:02,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:02,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:02,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:02,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:02,941 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 12:31:02,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:02,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:31:02,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:31:02,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:31:02,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:31:02,944 INFO L87 Difference]: Start difference. First operand 689 states and 913 transitions. Second operand 5 states. [2019-09-08 12:31:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:03,684 INFO L93 Difference]: Finished difference Result 1258 states and 1699 transitions. [2019-09-08 12:31:03,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:31:03,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-08 12:31:03,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:03,691 INFO L225 Difference]: With dead ends: 1258 [2019-09-08 12:31:03,691 INFO L226 Difference]: Without dead ends: 663 [2019-09-08 12:31:03,693 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 12:31:03,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-08 12:31:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-09-08 12:31:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-08 12:31:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 882 transitions. [2019-09-08 12:31:03,727 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 882 transitions. Word has length 92 [2019-09-08 12:31:03,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:03,727 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 882 transitions. [2019-09-08 12:31:03,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 882 transitions. [2019-09-08 12:31:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:31:03,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:03,731 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] [2019-09-08 12:31:03,732 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:03,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:03,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1839633213, now seen corresponding path program 1 times [2019-09-08 12:31:03,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:03,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:03,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:03,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:03,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:03,924 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 12:31:03,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:03,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:31:03,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:31:03,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:31:03,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:31:03,926 INFO L87 Difference]: Start difference. First operand 663 states and 882 transitions. Second operand 5 states. [2019-09-08 12:31:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:04,536 INFO L93 Difference]: Finished difference Result 1232 states and 1667 transitions. [2019-09-08 12:31:04,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:31:04,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 12:31:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:04,541 INFO L225 Difference]: With dead ends: 1232 [2019-09-08 12:31:04,541 INFO L226 Difference]: Without dead ends: 644 [2019-09-08 12:31:04,543 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 12:31:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-09-08 12:31:04,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-09-08 12:31:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-09-08 12:31:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 860 transitions. [2019-09-08 12:31:04,588 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 860 transitions. Word has length 93 [2019-09-08 12:31:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:04,589 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 860 transitions. [2019-09-08 12:31:04,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 860 transitions. [2019-09-08 12:31:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:31:04,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:04,593 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] [2019-09-08 12:31:04,594 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:04,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1412961549, now seen corresponding path program 1 times [2019-09-08 12:31:04,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:04,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:04,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:04,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:04,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:04,794 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 12:31:04,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:04,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:31:04,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:31:04,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:31:04,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:31:04,796 INFO L87 Difference]: Start difference. First operand 644 states and 860 transitions. Second operand 5 states. [2019-09-08 12:31:05,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:05,534 INFO L93 Difference]: Finished difference Result 1213 states and 1644 transitions. [2019-09-08 12:31:05,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:31:05,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-08 12:31:05,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:05,538 INFO L225 Difference]: With dead ends: 1213 [2019-09-08 12:31:05,538 INFO L226 Difference]: Without dead ends: 639 [2019-09-08 12:31:05,540 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 12:31:05,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-08 12:31:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-08 12:31:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 853 transitions. [2019-09-08 12:31:05,576 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 853 transitions. Word has length 94 [2019-09-08 12:31:05,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:05,577 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 853 transitions. [2019-09-08 12:31:05,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:31:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 853 transitions. [2019-09-08 12:31:05,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:31:05,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:05,581 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 12:31:05,581 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:05,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:05,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1447378303, now seen corresponding path program 1 times [2019-09-08 12:31:05,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:05,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:05,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:05,887 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 12:31:05,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:05,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:05,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:05,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:05,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:05,890 INFO L87 Difference]: Start difference. First operand 639 states and 853 transitions. Second operand 9 states. [2019-09-08 12:31:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:08,507 INFO L93 Difference]: Finished difference Result 1256 states and 1719 transitions. [2019-09-08 12:31:08,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:08,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-08 12:31:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:08,515 INFO L225 Difference]: With dead ends: 1256 [2019-09-08 12:31:08,515 INFO L226 Difference]: Without dead ends: 1133 [2019-09-08 12:31:08,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:31:08,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-09-08 12:31:08,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 639. [2019-09-08 12:31:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 852 transitions. [2019-09-08 12:31:08,552 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 852 transitions. Word has length 95 [2019-09-08 12:31:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:08,553 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 852 transitions. [2019-09-08 12:31:08,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 852 transitions. [2019-09-08 12:31:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:31:08,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:08,555 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 12:31:08,556 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:08,556 INFO L82 PathProgramCache]: Analyzing trace with hash -102853389, now seen corresponding path program 1 times [2019-09-08 12:31:08,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:08,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:08,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:08,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:08,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:08,749 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 12:31:08,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:08,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:08,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:08,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:08,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:08,750 INFO L87 Difference]: Start difference. First operand 639 states and 852 transitions. Second operand 9 states. [2019-09-08 12:31:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:10,831 INFO L93 Difference]: Finished difference Result 1329 states and 1814 transitions. [2019-09-08 12:31:10,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:10,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-08 12:31:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:10,838 INFO L225 Difference]: With dead ends: 1329 [2019-09-08 12:31:10,838 INFO L226 Difference]: Without dead ends: 1137 [2019-09-08 12:31:10,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:31:10,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-09-08 12:31:10,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 639. [2019-09-08 12:31:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:10,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 851 transitions. [2019-09-08 12:31:10,882 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 851 transitions. Word has length 95 [2019-09-08 12:31:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:10,883 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 851 transitions. [2019-09-08 12:31:10,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 851 transitions. [2019-09-08 12:31:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:31:10,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:10,885 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 12:31:10,886 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:10,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:10,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1602183325, now seen corresponding path program 1 times [2019-09-08 12:31:10,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:10,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:10,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:10,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:10,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:11,113 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 12:31:11,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:11,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:31:11,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:31:11,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:31:11,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:31:11,114 INFO L87 Difference]: Start difference. First operand 639 states and 851 transitions. Second operand 8 states. [2019-09-08 12:31:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:12,649 INFO L93 Difference]: Finished difference Result 1201 states and 1560 transitions. [2019-09-08 12:31:12,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:31:12,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-09-08 12:31:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:12,654 INFO L225 Difference]: With dead ends: 1201 [2019-09-08 12:31:12,654 INFO L226 Difference]: Without dead ends: 856 [2019-09-08 12:31:12,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:31:12,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-09-08 12:31:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 639. [2019-09-08 12:31:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 850 transitions. [2019-09-08 12:31:12,702 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 850 transitions. Word has length 95 [2019-09-08 12:31:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:12,702 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 850 transitions. [2019-09-08 12:31:12,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:31:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 850 transitions. [2019-09-08 12:31:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:31:12,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:12,705 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 12:31:12,705 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:12,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1113047675, now seen corresponding path program 1 times [2019-09-08 12:31:12,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:12,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:12,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:12,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:12,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:12,940 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 12:31:12,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:12,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:12,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:12,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:12,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:12,942 INFO L87 Difference]: Start difference. First operand 639 states and 850 transitions. Second operand 9 states. [2019-09-08 12:31:14,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:14,839 INFO L93 Difference]: Finished difference Result 1195 states and 1615 transitions. [2019-09-08 12:31:14,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:14,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:31:14,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:14,848 INFO L225 Difference]: With dead ends: 1195 [2019-09-08 12:31:14,848 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 12:31:14,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:31:14,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 12:31:14,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-08 12:31:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 849 transitions. [2019-09-08 12:31:14,896 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 849 transitions. Word has length 97 [2019-09-08 12:31:14,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:14,896 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 849 transitions. [2019-09-08 12:31:14,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:14,897 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 849 transitions. [2019-09-08 12:31:14,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:31:14,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:14,899 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 12:31:14,900 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:14,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:14,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1446852495, now seen corresponding path program 1 times [2019-09-08 12:31:14,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:14,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:14,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:14,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:14,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:15,155 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 12:31:15,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:15,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:15,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:15,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:15,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:15,156 INFO L87 Difference]: Start difference. First operand 639 states and 849 transitions. Second operand 9 states. [2019-09-08 12:31:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:17,432 INFO L93 Difference]: Finished difference Result 1233 states and 1667 transitions. [2019-09-08 12:31:17,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:17,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:31:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:17,439 INFO L225 Difference]: With dead ends: 1233 [2019-09-08 12:31:17,439 INFO L226 Difference]: Without dead ends: 1125 [2019-09-08 12:31:17,440 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 12:31:17,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-08 12:31:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-08 12:31:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 848 transitions. [2019-09-08 12:31:17,491 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 848 transitions. Word has length 97 [2019-09-08 12:31:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:17,492 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 848 transitions. [2019-09-08 12:31:17,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 848 transitions. [2019-09-08 12:31:17,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:31:17,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:17,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, 1, 1, 1, 1, 1, 1, 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:31:17,496 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:17,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:17,496 INFO L82 PathProgramCache]: Analyzing trace with hash 794751107, now seen corresponding path program 1 times [2019-09-08 12:31:17,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:17,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:17,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:17,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:17,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:17,708 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 12:31:17,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:17,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:17,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:17,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:17,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:17,710 INFO L87 Difference]: Start difference. First operand 639 states and 848 transitions. Second operand 9 states. [2019-09-08 12:31:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:19,637 INFO L93 Difference]: Finished difference Result 1195 states and 1613 transitions. [2019-09-08 12:31:19,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:19,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:31:19,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:19,644 INFO L225 Difference]: With dead ends: 1195 [2019-09-08 12:31:19,644 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 12:31:19,645 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 12:31:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 12:31:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-08 12:31:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 847 transitions. [2019-09-08 12:31:19,694 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 847 transitions. Word has length 97 [2019-09-08 12:31:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:19,695 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 847 transitions. [2019-09-08 12:31:19,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 847 transitions. [2019-09-08 12:31:19,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:31:19,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:19,697 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 12:31:19,698 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:19,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:19,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1280890073, now seen corresponding path program 1 times [2019-09-08 12:31:19,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:19,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:19,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:19,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:19,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:19,871 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 12:31:19,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:19,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:19,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:19,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:19,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:19,873 INFO L87 Difference]: Start difference. First operand 639 states and 847 transitions. Second operand 9 states. [2019-09-08 12:31:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:22,196 INFO L93 Difference]: Finished difference Result 1359 states and 1833 transitions. [2019-09-08 12:31:22,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:22,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:31:22,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:22,202 INFO L225 Difference]: With dead ends: 1359 [2019-09-08 12:31:22,202 INFO L226 Difference]: Without dead ends: 1137 [2019-09-08 12:31:22,203 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 12:31:22,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-09-08 12:31:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 639. [2019-09-08 12:31:22,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 846 transitions. [2019-09-08 12:31:22,255 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 846 transitions. Word has length 97 [2019-09-08 12:31:22,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:22,256 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 846 transitions. [2019-09-08 12:31:22,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 846 transitions. [2019-09-08 12:31:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:31:22,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:22,258 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 12:31:22,258 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:22,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:22,259 INFO L82 PathProgramCache]: Analyzing trace with hash 299483909, now seen corresponding path program 1 times [2019-09-08 12:31:22,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:22,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:22,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:22,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:22,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:22,475 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 12:31:22,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:22,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:22,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:22,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:22,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:22,477 INFO L87 Difference]: Start difference. First operand 639 states and 846 transitions. Second operand 9 states. [2019-09-08 12:31:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:24,388 INFO L93 Difference]: Finished difference Result 1082 states and 1435 transitions. [2019-09-08 12:31:24,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:24,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:31:24,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:24,394 INFO L225 Difference]: With dead ends: 1082 [2019-09-08 12:31:24,394 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:31:24,395 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 12:31:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:31:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:31:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 845 transitions. [2019-09-08 12:31:24,510 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 845 transitions. Word has length 97 [2019-09-08 12:31:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:24,511 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 845 transitions. [2019-09-08 12:31:24,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 845 transitions. [2019-09-08 12:31:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:31:24,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:24,513 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 12:31:24,514 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:24,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:24,515 INFO L82 PathProgramCache]: Analyzing trace with hash 990068976, now seen corresponding path program 1 times [2019-09-08 12:31:24,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:24,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:24,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:24,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:24,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:24,747 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 12:31:24,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:24,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:24,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:24,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:24,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:24,749 INFO L87 Difference]: Start difference. First operand 639 states and 845 transitions. Second operand 9 states. [2019-09-08 12:31:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:26,611 INFO L93 Difference]: Finished difference Result 1191 states and 1605 transitions. [2019-09-08 12:31:26,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:26,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:31:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:26,618 INFO L225 Difference]: With dead ends: 1191 [2019-09-08 12:31:26,618 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 12:31:26,619 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 12:31:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 12:31:26,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-08 12:31:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 844 transitions. [2019-09-08 12:31:26,673 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 844 transitions. Word has length 97 [2019-09-08 12:31:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:26,674 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 844 transitions. [2019-09-08 12:31:26,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 844 transitions. [2019-09-08 12:31:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:31:26,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:26,677 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:26,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:26,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1326473449, now seen corresponding path program 1 times [2019-09-08 12:31:26,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:26,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:26,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:26,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:26,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:26,919 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 12:31:26,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:26,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:26,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:26,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:26,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:26,922 INFO L87 Difference]: Start difference. First operand 639 states and 844 transitions. Second operand 9 states. [2019-09-08 12:31:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:29,254 INFO L93 Difference]: Finished difference Result 1224 states and 1654 transitions. [2019-09-08 12:31:29,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:29,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:31:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:29,260 INFO L225 Difference]: With dead ends: 1224 [2019-09-08 12:31:29,260 INFO L226 Difference]: Without dead ends: 1125 [2019-09-08 12:31:29,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:31:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-08 12:31:29,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-08 12:31:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 843 transitions. [2019-09-08 12:31:29,323 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 843 transitions. Word has length 97 [2019-09-08 12:31:29,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:29,323 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 843 transitions. [2019-09-08 12:31:29,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:29,324 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 843 transitions. [2019-09-08 12:31:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:31:29,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:29,326 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 12:31:29,326 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:29,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:29,327 INFO L82 PathProgramCache]: Analyzing trace with hash -975840379, now seen corresponding path program 1 times [2019-09-08 12:31:29,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:29,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:29,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:29,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:29,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:29,505 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 12:31:29,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:29,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:29,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:29,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:29,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:29,506 INFO L87 Difference]: Start difference. First operand 639 states and 843 transitions. Second operand 9 states. [2019-09-08 12:31:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:31,606 INFO L93 Difference]: Finished difference Result 1233 states and 1661 transitions. [2019-09-08 12:31:31,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:31,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:31:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:31,612 INFO L225 Difference]: With dead ends: 1233 [2019-09-08 12:31:31,612 INFO L226 Difference]: Without dead ends: 1125 [2019-09-08 12:31:31,614 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 12:31:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-08 12:31:31,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-08 12:31:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 842 transitions. [2019-09-08 12:31:31,680 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 842 transitions. Word has length 97 [2019-09-08 12:31:31,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:31,680 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 842 transitions. [2019-09-08 12:31:31,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:31,681 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 842 transitions. [2019-09-08 12:31:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:31:31,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:31,683 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 12:31:31,689 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:31,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:31,689 INFO L82 PathProgramCache]: Analyzing trace with hash -846389634, now seen corresponding path program 1 times [2019-09-08 12:31:31,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:31,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:31,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:31,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:31,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:31,906 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 12:31:31,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:31,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:31,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:31,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:31,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:31,908 INFO L87 Difference]: Start difference. First operand 639 states and 842 transitions. Second operand 9 states. [2019-09-08 12:31:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:34,522 INFO L93 Difference]: Finished difference Result 1271 states and 1720 transitions. [2019-09-08 12:31:34,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:34,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:31:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:34,527 INFO L225 Difference]: With dead ends: 1271 [2019-09-08 12:31:34,527 INFO L226 Difference]: Without dead ends: 1133 [2019-09-08 12:31:34,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:31:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-09-08 12:31:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 639. [2019-09-08 12:31:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 841 transitions. [2019-09-08 12:31:34,583 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 841 transitions. Word has length 97 [2019-09-08 12:31:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:34,584 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 841 transitions. [2019-09-08 12:31:34,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 841 transitions. [2019-09-08 12:31:34,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:31:34,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:34,586 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 12:31:34,586 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:34,587 INFO L82 PathProgramCache]: Analyzing trace with hash -614722141, now seen corresponding path program 1 times [2019-09-08 12:31:34,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:34,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:34,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:34,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:34,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:34,754 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 12:31:34,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:34,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:34,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:34,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:34,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:34,757 INFO L87 Difference]: Start difference. First operand 639 states and 841 transitions. Second operand 9 states. [2019-09-08 12:31:37,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:37,027 INFO L93 Difference]: Finished difference Result 1239 states and 1663 transitions. [2019-09-08 12:31:37,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:37,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:31:37,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:37,031 INFO L225 Difference]: With dead ends: 1239 [2019-09-08 12:31:37,032 INFO L226 Difference]: Without dead ends: 1125 [2019-09-08 12:31:37,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:31:37,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-08 12:31:37,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-08 12:31:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 840 transitions. [2019-09-08 12:31:37,078 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 840 transitions. Word has length 99 [2019-09-08 12:31:37,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:37,078 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 840 transitions. [2019-09-08 12:31:37,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 840 transitions. [2019-09-08 12:31:37,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:31:37,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:37,080 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 12:31:37,081 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:37,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:37,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1600456637, now seen corresponding path program 1 times [2019-09-08 12:31:37,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:37,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:37,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:37,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:37,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:37,255 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 12:31:37,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:37,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:37,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:37,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:37,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:37,257 INFO L87 Difference]: Start difference. First operand 639 states and 840 transitions. Second operand 9 states. [2019-09-08 12:31:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:39,607 INFO L93 Difference]: Finished difference Result 1286 states and 1729 transitions. [2019-09-08 12:31:39,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:39,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:31:39,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:39,614 INFO L225 Difference]: With dead ends: 1286 [2019-09-08 12:31:39,614 INFO L226 Difference]: Without dead ends: 1133 [2019-09-08 12:31:39,614 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 12:31:39,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-09-08 12:31:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 639. [2019-09-08 12:31:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 839 transitions. [2019-09-08 12:31:39,684 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 839 transitions. Word has length 99 [2019-09-08 12:31:39,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:39,684 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 839 transitions. [2019-09-08 12:31:39,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 839 transitions. [2019-09-08 12:31:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:31:39,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:39,686 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 12:31:39,687 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:39,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:39,687 INFO L82 PathProgramCache]: Analyzing trace with hash -16190442, now seen corresponding path program 1 times [2019-09-08 12:31:39,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:39,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:39,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:39,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:39,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:39,910 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 12:31:39,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:39,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:39,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:39,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:39,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:39,912 INFO L87 Difference]: Start difference. First operand 639 states and 839 transitions. Second operand 9 states. [2019-09-08 12:31:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:42,238 INFO L93 Difference]: Finished difference Result 1233 states and 1655 transitions. [2019-09-08 12:31:42,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:42,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:31:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:42,245 INFO L225 Difference]: With dead ends: 1233 [2019-09-08 12:31:42,245 INFO L226 Difference]: Without dead ends: 1125 [2019-09-08 12:31:42,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:31:42,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-08 12:31:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-08 12:31:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 838 transitions. [2019-09-08 12:31:42,294 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 838 transitions. Word has length 99 [2019-09-08 12:31:42,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:42,294 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 838 transitions. [2019-09-08 12:31:42,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 838 transitions. [2019-09-08 12:31:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:31:42,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:42,296 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 12:31:42,296 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:42,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:42,297 INFO L82 PathProgramCache]: Analyzing trace with hash 113260303, now seen corresponding path program 1 times [2019-09-08 12:31:42,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:42,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:42,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:42,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:42,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:42,482 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 12:31:42,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:42,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:42,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:42,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:42,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:42,484 INFO L87 Difference]: Start difference. First operand 639 states and 838 transitions. Second operand 9 states. [2019-09-08 12:31:44,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:44,527 INFO L93 Difference]: Finished difference Result 1195 states and 1601 transitions. [2019-09-08 12:31:44,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:44,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:31:44,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:44,536 INFO L225 Difference]: With dead ends: 1195 [2019-09-08 12:31:44,536 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 12:31:44,537 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 12:31:44,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 12:31:44,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-08 12:31:44,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 837 transitions. [2019-09-08 12:31:44,606 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 837 transitions. Word has length 99 [2019-09-08 12:31:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:44,606 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 837 transitions. [2019-09-08 12:31:44,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 837 transitions. [2019-09-08 12:31:44,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:31:44,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:44,609 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 12:31:44,610 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:44,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:44,610 INFO L82 PathProgramCache]: Analyzing trace with hash -503675873, now seen corresponding path program 1 times [2019-09-08 12:31:44,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:44,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:44,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:44,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:44,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:44,838 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 12:31:44,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:44,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:44,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:44,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:44,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:44,840 INFO L87 Difference]: Start difference. First operand 639 states and 837 transitions. Second operand 9 states. [2019-09-08 12:31:46,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:46,825 INFO L93 Difference]: Finished difference Result 1126 states and 1493 transitions. [2019-09-08 12:31:46,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:46,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:31:46,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:46,830 INFO L225 Difference]: With dead ends: 1126 [2019-09-08 12:31:46,830 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 12:31:46,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:31:46,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 12:31:46,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-08 12:31:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 836 transitions. [2019-09-08 12:31:46,881 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 836 transitions. Word has length 99 [2019-09-08 12:31:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:46,881 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 836 transitions. [2019-09-08 12:31:46,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 836 transitions. [2019-09-08 12:31:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:31:46,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:46,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 12:31:46,883 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:46,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:46,884 INFO L82 PathProgramCache]: Analyzing trace with hash -118627712, now seen corresponding path program 1 times [2019-09-08 12:31:46,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:46,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:46,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:46,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:46,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:47,050 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 12:31:47,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:47,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:47,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:47,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:47,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:47,055 INFO L87 Difference]: Start difference. First operand 639 states and 836 transitions. Second operand 9 states. [2019-09-08 12:31:49,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:49,395 INFO L93 Difference]: Finished difference Result 1271 states and 1704 transitions. [2019-09-08 12:31:49,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:49,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:31:49,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:49,401 INFO L225 Difference]: With dead ends: 1271 [2019-09-08 12:31:49,401 INFO L226 Difference]: Without dead ends: 1133 [2019-09-08 12:31:49,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:31:49,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-09-08 12:31:49,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 639. [2019-09-08 12:31:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 835 transitions. [2019-09-08 12:31:49,462 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 835 transitions. Word has length 99 [2019-09-08 12:31:49,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:49,463 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 835 transitions. [2019-09-08 12:31:49,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 835 transitions. [2019-09-08 12:31:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:31:49,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:49,465 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 12:31:49,465 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:49,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:49,465 INFO L82 PathProgramCache]: Analyzing trace with hash 412844447, now seen corresponding path program 1 times [2019-09-08 12:31:49,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:49,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:49,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:49,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:49,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:49,643 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 12:31:49,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:49,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:49,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:49,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:49,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:49,645 INFO L87 Difference]: Start difference. First operand 639 states and 835 transitions. Second operand 9 states. [2019-09-08 12:31:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:51,626 INFO L93 Difference]: Finished difference Result 1153 states and 1531 transitions. [2019-09-08 12:31:51,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:51,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:31:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:51,631 INFO L225 Difference]: With dead ends: 1153 [2019-09-08 12:31:51,631 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:31:51,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:31:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:31:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:31:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 834 transitions. [2019-09-08 12:31:51,681 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 834 transitions. Word has length 99 [2019-09-08 12:31:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:51,681 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 834 transitions. [2019-09-08 12:31:51,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 834 transitions. [2019-09-08 12:31:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:31:51,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31: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, 1, 1, 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:31:51,682 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:51,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:51,683 INFO L82 PathProgramCache]: Analyzing trace with hash -860630256, now seen corresponding path program 1 times [2019-09-08 12:31:51,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:51,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:51,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:51,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:51,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:51,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:51,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:51,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:51,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:51,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:51,856 INFO L87 Difference]: Start difference. First operand 639 states and 834 transitions. Second operand 9 states. [2019-09-08 12:31:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:53,823 INFO L93 Difference]: Finished difference Result 1082 states and 1422 transitions. [2019-09-08 12:31:53,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:53,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:31:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:53,828 INFO L225 Difference]: With dead ends: 1082 [2019-09-08 12:31:53,828 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:31:53,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:31:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:31:53,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:31:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 833 transitions. [2019-09-08 12:31:53,880 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 833 transitions. Word has length 99 [2019-09-08 12:31:53,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:53,880 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 833 transitions. [2019-09-08 12:31:53,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:53,881 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 833 transitions. [2019-09-08 12:31:53,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:31:53,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:53,882 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 12:31:53,882 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:53,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:53,883 INFO L82 PathProgramCache]: Analyzing trace with hash 155343894, now seen corresponding path program 1 times [2019-09-08 12:31:53,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:53,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:53,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:53,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:53,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:54,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:54,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:54,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:54,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:54,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:54,049 INFO L87 Difference]: Start difference. First operand 639 states and 833 transitions. Second operand 9 states. [2019-09-08 12:31:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:55,903 INFO L93 Difference]: Finished difference Result 1153 states and 1528 transitions. [2019-09-08 12:31:55,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:55,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:31:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:55,908 INFO L225 Difference]: With dead ends: 1153 [2019-09-08 12:31:55,908 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:31:55,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:31:55,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:31:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:31:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 832 transitions. [2019-09-08 12:31:55,962 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 832 transitions. Word has length 99 [2019-09-08 12:31:55,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:55,962 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 832 transitions. [2019-09-08 12:31:55,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 832 transitions. [2019-09-08 12:31:55,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:31:55,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:55,964 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 12:31:55,964 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:55,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:55,965 INFO L82 PathProgramCache]: Analyzing trace with hash 396427883, now seen corresponding path program 1 times [2019-09-08 12:31:55,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:55,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:55,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:55,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:55,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:56,196 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 12:31:56,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:56,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:56,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:56,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:56,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:56,197 INFO L87 Difference]: Start difference. First operand 639 states and 832 transitions. Second operand 9 states. [2019-09-08 12:31:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:58,277 INFO L93 Difference]: Finished difference Result 1224 states and 1637 transitions. [2019-09-08 12:31:58,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:58,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:31:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:58,281 INFO L225 Difference]: With dead ends: 1224 [2019-09-08 12:31:58,281 INFO L226 Difference]: Without dead ends: 1125 [2019-09-08 12:31:58,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:31:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-08 12:31:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-08 12:31:58,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:31:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 831 transitions. [2019-09-08 12:31:58,337 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 831 transitions. Word has length 99 [2019-09-08 12:31:58,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:58,337 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 831 transitions. [2019-09-08 12:31:58,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 831 transitions. [2019-09-08 12:31:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:31:58,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:58,339 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 12:31:58,339 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:58,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:58,339 INFO L82 PathProgramCache]: Analyzing trace with hash 944309900, now seen corresponding path program 1 times [2019-09-08 12:31:58,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:58,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:58,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:58,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:58,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:58,511 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 12:31:58,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:58,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:58,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:58,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:58,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:58,513 INFO L87 Difference]: Start difference. First operand 639 states and 831 transitions. Second operand 9 states. [2019-09-08 12:32:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:00,501 INFO L93 Difference]: Finished difference Result 1191 states and 1587 transitions. [2019-09-08 12:32:00,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:00,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:32:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:00,505 INFO L225 Difference]: With dead ends: 1191 [2019-09-08 12:32:00,506 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 12:32:00,507 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 12:32:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 12:32:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-08 12:32:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 830 transitions. [2019-09-08 12:32:00,565 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 830 transitions. Word has length 99 [2019-09-08 12:32:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:00,566 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 830 transitions. [2019-09-08 12:32:00,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 830 transitions. [2019-09-08 12:32:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:32:00,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:00,567 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 12:32:00,567 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash -724838198, now seen corresponding path program 1 times [2019-09-08 12:32:00,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:00,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:00,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:00,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:00,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:00,725 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 12:32:00,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:00,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:00,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:00,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:00,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:00,727 INFO L87 Difference]: Start difference. First operand 639 states and 830 transitions. Second operand 9 states. [2019-09-08 12:32:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:03,005 INFO L93 Difference]: Finished difference Result 1189 states and 1584 transitions. [2019-09-08 12:32:03,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:03,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:32:03,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:03,009 INFO L225 Difference]: With dead ends: 1189 [2019-09-08 12:32:03,009 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 12:32:03,010 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 12:32:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 12:32:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-08 12:32:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 829 transitions. [2019-09-08 12:32:03,063 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 829 transitions. Word has length 99 [2019-09-08 12:32:03,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:03,063 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 829 transitions. [2019-09-08 12:32:03,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:03,063 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 829 transitions. [2019-09-08 12:32:03,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:32:03,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:03,064 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 12:32:03,064 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:03,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:03,065 INFO L82 PathProgramCache]: Analyzing trace with hash -695001007, now seen corresponding path program 1 times [2019-09-08 12:32:03,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:03,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:03,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:03,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:03,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:03,228 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 12:32:03,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:03,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:03,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:03,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:03,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:03,230 INFO L87 Difference]: Start difference. First operand 639 states and 829 transitions. Second operand 9 states. [2019-09-08 12:32:05,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:05,407 INFO L93 Difference]: Finished difference Result 1153 states and 1523 transitions. [2019-09-08 12:32:05,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:05,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:32:05,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:05,409 INFO L225 Difference]: With dead ends: 1153 [2019-09-08 12:32:05,409 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:32:05,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:32:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:32:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 828 transitions. [2019-09-08 12:32:05,467 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 828 transitions. Word has length 99 [2019-09-08 12:32:05,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:05,467 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 828 transitions. [2019-09-08 12:32:05,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 828 transitions. [2019-09-08 12:32:05,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:32:05,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:05,468 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 12:32:05,469 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:05,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:05,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1931265789, now seen corresponding path program 1 times [2019-09-08 12:32:05,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:05,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:05,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:05,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:05,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:05,648 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 12:32:05,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:05,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:05,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:05,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:05,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:05,650 INFO L87 Difference]: Start difference. First operand 639 states and 828 transitions. Second operand 9 states. [2019-09-08 12:32:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:08,168 INFO L93 Difference]: Finished difference Result 1218 states and 1625 transitions. [2019-09-08 12:32:08,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:08,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:32:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:08,171 INFO L225 Difference]: With dead ends: 1218 [2019-09-08 12:32:08,171 INFO L226 Difference]: Without dead ends: 1125 [2019-09-08 12:32:08,172 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 12:32:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-08 12:32:08,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-08 12:32:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 827 transitions. [2019-09-08 12:32:08,230 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 827 transitions. Word has length 99 [2019-09-08 12:32:08,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:08,230 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 827 transitions. [2019-09-08 12:32:08,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 827 transitions. [2019-09-08 12:32:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:32:08,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:08,232 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 12:32:08,232 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:08,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1879307074, now seen corresponding path program 1 times [2019-09-08 12:32:08,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:08,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:08,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:08,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:08,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:08,398 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 12:32:08,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:08,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:08,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:08,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:08,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:08,400 INFO L87 Difference]: Start difference. First operand 639 states and 827 transitions. Second operand 9 states. [2019-09-08 12:32:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:10,706 INFO L93 Difference]: Finished difference Result 1195 states and 1586 transitions. [2019-09-08 12:32:10,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:10,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:32:10,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:10,709 INFO L225 Difference]: With dead ends: 1195 [2019-09-08 12:32:10,710 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 12:32:10,711 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 12:32:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 12:32:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-08 12:32:10,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 826 transitions. [2019-09-08 12:32:10,801 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 826 transitions. Word has length 99 [2019-09-08 12:32:10,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:10,802 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 826 transitions. [2019-09-08 12:32:10,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 826 transitions. [2019-09-08 12:32:10,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:32:10,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:10,804 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 12:32:10,804 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:10,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:10,804 INFO L82 PathProgramCache]: Analyzing trace with hash 747056842, now seen corresponding path program 1 times [2019-09-08 12:32:10,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:10,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:10,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:10,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:10,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:10,967 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 12:32:10,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:10,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:10,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:10,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:10,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:10,969 INFO L87 Difference]: Start difference. First operand 639 states and 826 transitions. Second operand 9 states. [2019-09-08 12:32:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:13,078 INFO L93 Difference]: Finished difference Result 1195 states and 1585 transitions. [2019-09-08 12:32:13,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:13,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:32:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:13,081 INFO L225 Difference]: With dead ends: 1195 [2019-09-08 12:32:13,081 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 12:32:13,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:13,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 12:32:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-08 12:32:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 825 transitions. [2019-09-08 12:32:13,150 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 825 transitions. Word has length 99 [2019-09-08 12:32:13,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:13,150 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 825 transitions. [2019-09-08 12:32:13,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 825 transitions. [2019-09-08 12:32:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:32:13,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:13,151 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 12:32:13,151 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:13,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:13,152 INFO L82 PathProgramCache]: Analyzing trace with hash 358054313, now seen corresponding path program 1 times [2019-09-08 12:32:13,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:13,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:13,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:13,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:13,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:13,304 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 12:32:13,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:13,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:13,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:13,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:13,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:13,305 INFO L87 Difference]: Start difference. First operand 639 states and 825 transitions. Second operand 9 states. [2019-09-08 12:32:15,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:15,386 INFO L93 Difference]: Finished difference Result 1191 states and 1579 transitions. [2019-09-08 12:32:15,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:15,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:32:15,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:15,391 INFO L225 Difference]: With dead ends: 1191 [2019-09-08 12:32:15,391 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 12:32:15,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:15,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 12:32:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-08 12:32:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 824 transitions. [2019-09-08 12:32:15,477 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 824 transitions. Word has length 99 [2019-09-08 12:32:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:15,477 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 824 transitions. [2019-09-08 12:32:15,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 824 transitions. [2019-09-08 12:32:15,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:15,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:15,478 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 12:32:15,479 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:15,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:15,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1803814491, now seen corresponding path program 1 times [2019-09-08 12:32:15,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:15,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:15,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:15,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:15,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:15,621 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 12:32:15,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:15,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:15,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:15,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:15,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:15,622 INFO L87 Difference]: Start difference. First operand 639 states and 824 transitions. Second operand 9 states. [2019-09-08 12:32:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:17,323 INFO L93 Difference]: Finished difference Result 1156 states and 1520 transitions. [2019-09-08 12:32:17,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:17,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:17,325 INFO L225 Difference]: With dead ends: 1156 [2019-09-08 12:32:17,325 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:32:17,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:32:17,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:32:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 823 transitions. [2019-09-08 12:32:17,386 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 823 transitions. Word has length 101 [2019-09-08 12:32:17,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:17,386 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 823 transitions. [2019-09-08 12:32:17,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:17,386 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 823 transitions. [2019-09-08 12:32:17,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:17,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:17,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, 1] [2019-09-08 12:32:17,387 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:17,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:17,388 INFO L82 PathProgramCache]: Analyzing trace with hash 125342021, now seen corresponding path program 1 times [2019-09-08 12:32:17,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:17,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:17,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:17,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:17,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:17,534 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 12:32:17,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:17,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:17,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:17,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:17,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:17,536 INFO L87 Difference]: Start difference. First operand 639 states and 823 transitions. Second operand 9 states. [2019-09-08 12:32:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:19,705 INFO L93 Difference]: Finished difference Result 1200 states and 1585 transitions. [2019-09-08 12:32:19,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:19,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:19,709 INFO L225 Difference]: With dead ends: 1200 [2019-09-08 12:32:19,709 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 12:32:19,710 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 12:32:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 12:32:19,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-08 12:32:19,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 822 transitions. [2019-09-08 12:32:19,817 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 822 transitions. Word has length 101 [2019-09-08 12:32:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:19,818 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 822 transitions. [2019-09-08 12:32:19,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 822 transitions. [2019-09-08 12:32:19,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:19,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:19,820 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 12:32:19,820 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:19,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:19,820 INFO L82 PathProgramCache]: Analyzing trace with hash -537970647, now seen corresponding path program 1 times [2019-09-08 12:32:19,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:19,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:19,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:19,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:19,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:19,966 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 12:32:19,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:19,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:19,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:19,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:19,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:19,968 INFO L87 Difference]: Start difference. First operand 639 states and 822 transitions. Second operand 9 states. [2019-09-08 12:32:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:22,241 INFO L93 Difference]: Finished difference Result 1200 states and 1584 transitions. [2019-09-08 12:32:22,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:22,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:22,244 INFO L225 Difference]: With dead ends: 1200 [2019-09-08 12:32:22,244 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 12:32:22,246 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 12:32:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 12:32:22,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-08 12:32:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 821 transitions. [2019-09-08 12:32:22,347 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 821 transitions. Word has length 101 [2019-09-08 12:32:22,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:22,348 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 821 transitions. [2019-09-08 12:32:22,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:22,348 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 821 transitions. [2019-09-08 12:32:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:22,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:22,349 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 12:32:22,350 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:22,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:22,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1827840137, now seen corresponding path program 1 times [2019-09-08 12:32:22,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:22,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:22,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:22,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:22,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:22,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 12:32:22,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:22,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:22,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:22,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:22,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:22,596 INFO L87 Difference]: Start difference. First operand 639 states and 821 transitions. Second operand 9 states. [2019-09-08 12:32:24,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:24,636 INFO L93 Difference]: Finished difference Result 1156 states and 1517 transitions. [2019-09-08 12:32:24,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:24,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:24,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:24,639 INFO L225 Difference]: With dead ends: 1156 [2019-09-08 12:32:24,639 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:32:24,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:32:24,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:32:24,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 820 transitions. [2019-09-08 12:32:24,733 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 820 transitions. Word has length 101 [2019-09-08 12:32:24,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:24,734 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 820 transitions. [2019-09-08 12:32:24,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:24,734 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 820 transitions. [2019-09-08 12:32:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:24,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:24,735 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 12:32:24,736 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:24,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:24,736 INFO L82 PathProgramCache]: Analyzing trace with hash 666625533, now seen corresponding path program 1 times [2019-09-08 12:32:24,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:24,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:24,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:24,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:24,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:24,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 12:32:24,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:24,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:24,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:24,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:24,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:24,897 INFO L87 Difference]: Start difference. First operand 639 states and 820 transitions. Second operand 9 states. [2019-09-08 12:32:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:27,103 INFO L93 Difference]: Finished difference Result 1156 states and 1516 transitions. [2019-09-08 12:32:27,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:27,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:27,105 INFO L225 Difference]: With dead ends: 1156 [2019-09-08 12:32:27,105 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:32:27,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:32:27,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:32:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 819 transitions. [2019-09-08 12:32:27,188 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 819 transitions. Word has length 101 [2019-09-08 12:32:27,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:27,188 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 819 transitions. [2019-09-08 12:32:27,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:27,189 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 819 transitions. [2019-09-08 12:32:27,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:27,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:27,190 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 12:32:27,190 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:27,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:27,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1503001015, now seen corresponding path program 1 times [2019-09-08 12:32:27,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:27,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:27,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:27,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:27,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:27,336 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 12:32:27,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:27,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:27,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:27,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:27,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:27,338 INFO L87 Difference]: Start difference. First operand 639 states and 819 transitions. Second operand 9 states. [2019-09-08 12:32:29,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:29,261 INFO L93 Difference]: Finished difference Result 1153 states and 1511 transitions. [2019-09-08 12:32:29,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:29,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:29,264 INFO L225 Difference]: With dead ends: 1153 [2019-09-08 12:32:29,264 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:32:29,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:32:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:32:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 818 transitions. [2019-09-08 12:32:29,366 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 818 transitions. Word has length 101 [2019-09-08 12:32:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:29,367 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 818 transitions. [2019-09-08 12:32:29,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 818 transitions. [2019-09-08 12:32:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:29,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:29,369 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 12:32:29,369 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:29,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:29,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1720349999, now seen corresponding path program 1 times [2019-09-08 12:32:29,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:29,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:29,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:29,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:29,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:29,518 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 12:32:29,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:29,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:29,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:29,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:29,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:29,519 INFO L87 Difference]: Start difference. First operand 639 states and 818 transitions. Second operand 9 states. [2019-09-08 12:32:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:31,669 INFO L93 Difference]: Finished difference Result 1224 states and 1616 transitions. [2019-09-08 12:32:31,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:31,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:31,673 INFO L225 Difference]: With dead ends: 1224 [2019-09-08 12:32:31,673 INFO L226 Difference]: Without dead ends: 1125 [2019-09-08 12:32:31,675 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 12:32:31,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-08 12:32:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 639. [2019-09-08 12:32:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 817 transitions. [2019-09-08 12:32:31,800 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 817 transitions. Word has length 101 [2019-09-08 12:32:31,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:31,801 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 817 transitions. [2019-09-08 12:32:31,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:31,801 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 817 transitions. [2019-09-08 12:32:31,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:31,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:31,803 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 12:32:31,804 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:31,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:31,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1464481640, now seen corresponding path program 1 times [2019-09-08 12:32:31,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:31,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:31,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:31,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:31,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:31,972 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 12:32:31,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:31,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:31,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:31,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:31,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:31,974 INFO L87 Difference]: Start difference. First operand 639 states and 817 transitions. Second operand 9 states. [2019-09-08 12:32:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:34,208 INFO L93 Difference]: Finished difference Result 1151 states and 1507 transitions. [2019-09-08 12:32:34,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:34,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:34,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:34,211 INFO L225 Difference]: With dead ends: 1151 [2019-09-08 12:32:34,211 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:32:34,212 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 12:32:34,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:32:34,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:32:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 816 transitions. [2019-09-08 12:32:34,278 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 816 transitions. Word has length 101 [2019-09-08 12:32:34,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:34,279 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 816 transitions. [2019-09-08 12:32:34,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:34,279 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 816 transitions. [2019-09-08 12:32:34,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:34,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:34,280 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 12:32:34,280 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:34,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:34,281 INFO L82 PathProgramCache]: Analyzing trace with hash -22612664, now seen corresponding path program 1 times [2019-09-08 12:32:34,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:34,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:34,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:34,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:34,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:34,437 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 12:32:34,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:34,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:34,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:34,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:34,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:34,438 INFO L87 Difference]: Start difference. First operand 639 states and 816 transitions. Second operand 9 states. [2019-09-08 12:32:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:36,631 INFO L93 Difference]: Finished difference Result 1191 states and 1567 transitions. [2019-09-08 12:32:36,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:36,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:36,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:36,633 INFO L225 Difference]: With dead ends: 1191 [2019-09-08 12:32:36,633 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 12:32:36,634 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 12:32:36,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 12:32:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-08 12:32:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 815 transitions. [2019-09-08 12:32:36,698 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 815 transitions. Word has length 101 [2019-09-08 12:32:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:36,698 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 815 transitions. [2019-09-08 12:32:36,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:36,698 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 815 transitions. [2019-09-08 12:32:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:36,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:36,699 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 12:32:36,699 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:36,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:36,700 INFO L82 PathProgramCache]: Analyzing trace with hash -982377980, now seen corresponding path program 1 times [2019-09-08 12:32:36,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:36,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:36,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:36,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:36,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:36,852 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 12:32:36,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:36,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:36,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:36,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:36,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:36,853 INFO L87 Difference]: Start difference. First operand 639 states and 815 transitions. Second operand 9 states. [2019-09-08 12:32:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:38,797 INFO L93 Difference]: Finished difference Result 1082 states and 1399 transitions. [2019-09-08 12:32:38,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:38,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:38,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:38,799 INFO L225 Difference]: With dead ends: 1082 [2019-09-08 12:32:38,800 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:32:38,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:38,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:32:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:32:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 814 transitions. [2019-09-08 12:32:38,868 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 814 transitions. Word has length 101 [2019-09-08 12:32:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:38,868 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 814 transitions. [2019-09-08 12:32:38,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 814 transitions. [2019-09-08 12:32:38,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:38,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:38,869 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 12:32:38,870 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:38,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:38,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1167978122, now seen corresponding path program 1 times [2019-09-08 12:32:38,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:38,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:38,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:38,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:38,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:39,039 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 12:32:39,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:39,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:39,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:39,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:39,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:39,041 INFO L87 Difference]: Start difference. First operand 639 states and 814 transitions. Second operand 9 states. [2019-09-08 12:32:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:41,061 INFO L93 Difference]: Finished difference Result 1082 states and 1398 transitions. [2019-09-08 12:32:41,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:41,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:41,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:41,063 INFO L225 Difference]: With dead ends: 1082 [2019-09-08 12:32:41,063 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:32:41,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:32:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:32:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 813 transitions. [2019-09-08 12:32:41,130 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 813 transitions. Word has length 101 [2019-09-08 12:32:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:41,130 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 813 transitions. [2019-09-08 12:32:41,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 813 transitions. [2019-09-08 12:32:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:41,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:41,131 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 12:32:41,132 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:41,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:41,132 INFO L82 PathProgramCache]: Analyzing trace with hash 105604818, now seen corresponding path program 1 times [2019-09-08 12:32:41,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:41,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:41,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:41,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:41,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:41,262 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 12:32:41,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:41,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:41,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:41,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:41,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:41,263 INFO L87 Difference]: Start difference. First operand 639 states and 813 transitions. Second operand 9 states. [2019-09-08 12:32:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:43,575 INFO L93 Difference]: Finished difference Result 1153 states and 1504 transitions. [2019-09-08 12:32:43,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:43,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:43,578 INFO L225 Difference]: With dead ends: 1153 [2019-09-08 12:32:43,578 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:32:43,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:32:43,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:32:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 812 transitions. [2019-09-08 12:32:43,654 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 812 transitions. Word has length 101 [2019-09-08 12:32:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:43,655 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 812 transitions. [2019-09-08 12:32:43,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 812 transitions. [2019-09-08 12:32:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:43,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:43,656 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 12:32:43,656 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:43,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:43,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1810364723, now seen corresponding path program 1 times [2019-09-08 12:32:43,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:43,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:43,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:43,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:43,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:43,797 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 12:32:43,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:43,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:43,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:43,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:43,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:43,798 INFO L87 Difference]: Start difference. First operand 639 states and 812 transitions. Second operand 9 states. [2019-09-08 12:32:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:45,966 INFO L93 Difference]: Finished difference Result 1153 states and 1503 transitions. [2019-09-08 12:32:45,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:45,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:45,968 INFO L225 Difference]: With dead ends: 1153 [2019-09-08 12:32:45,968 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:32:45,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:45,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:32:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:32:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:46,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 811 transitions. [2019-09-08 12:32:46,041 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 811 transitions. Word has length 101 [2019-09-08 12:32:46,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:46,041 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 811 transitions. [2019-09-08 12:32:46,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:46,041 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 811 transitions. [2019-09-08 12:32:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:46,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:46,042 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 12:32:46,042 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:46,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:46,042 INFO L82 PathProgramCache]: Analyzing trace with hash -668731238, now seen corresponding path program 1 times [2019-09-08 12:32:46,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:46,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:46,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:46,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:46,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:46,169 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 12:32:46,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:46,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:46,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:46,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:46,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:46,170 INFO L87 Difference]: Start difference. First operand 639 states and 811 transitions. Second operand 9 states. [2019-09-08 12:32:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:48,387 INFO L93 Difference]: Finished difference Result 1151 states and 1499 transitions. [2019-09-08 12:32:48,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:48,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:48,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:48,389 INFO L225 Difference]: With dead ends: 1151 [2019-09-08 12:32:48,389 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:32:48,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:48,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:32:48,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:32:48,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 810 transitions. [2019-09-08 12:32:48,461 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 810 transitions. Word has length 101 [2019-09-08 12:32:48,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:48,461 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 810 transitions. [2019-09-08 12:32:48,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 810 transitions. [2019-09-08 12:32:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:48,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:48,463 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:48,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:48,463 INFO L82 PathProgramCache]: Analyzing trace with hash -539029057, now seen corresponding path program 1 times [2019-09-08 12:32:48,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:48,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:48,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:48,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:48,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:48,611 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 12:32:48,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:48,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:48,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:48,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:48,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:48,613 INFO L87 Difference]: Start difference. First operand 639 states and 810 transitions. Second operand 9 states. [2019-09-08 12:32:51,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:51,263 INFO L93 Difference]: Finished difference Result 1195 states and 1563 transitions. [2019-09-08 12:32:51,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:51,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:51,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:51,265 INFO L225 Difference]: With dead ends: 1195 [2019-09-08 12:32:51,266 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 12:32:51,267 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 12:32:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 12:32:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-08 12:32:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 809 transitions. [2019-09-08 12:32:51,345 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 809 transitions. Word has length 101 [2019-09-08 12:32:51,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:51,345 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 809 transitions. [2019-09-08 12:32:51,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 809 transitions. [2019-09-08 12:32:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:51,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:51,346 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 12:32:51,347 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:51,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:51,347 INFO L82 PathProgramCache]: Analyzing trace with hash 266353513, now seen corresponding path program 1 times [2019-09-08 12:32:51,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:51,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:51,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:51,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:51,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:51,494 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 12:32:51,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:51,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:51,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:51,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:51,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:51,495 INFO L87 Difference]: Start difference. First operand 639 states and 809 transitions. Second operand 9 states. [2019-09-08 12:32:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:53,635 INFO L93 Difference]: Finished difference Result 1153 states and 1499 transitions. [2019-09-08 12:32:53,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:53,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:53,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:53,638 INFO L225 Difference]: With dead ends: 1153 [2019-09-08 12:32:53,638 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:32:53,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:53,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:32:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:32:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 808 transitions. [2019-09-08 12:32:53,747 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 808 transitions. Word has length 101 [2019-09-08 12:32:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:53,748 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 808 transitions. [2019-09-08 12:32:53,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 808 transitions. [2019-09-08 12:32:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:53,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:53,749 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 12:32:53,749 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:53,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:53,750 INFO L82 PathProgramCache]: Analyzing trace with hash 411987299, now seen corresponding path program 1 times [2019-09-08 12:32:53,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:53,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:53,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:53,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:53,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:53,942 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 12:32:53,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:53,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:53,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:53,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:53,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:53,944 INFO L87 Difference]: Start difference. First operand 639 states and 808 transitions. Second operand 9 states. [2019-09-08 12:32:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:56,339 INFO L93 Difference]: Finished difference Result 1151 states and 1496 transitions. [2019-09-08 12:32:56,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:56,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:56,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:56,342 INFO L225 Difference]: With dead ends: 1151 [2019-09-08 12:32:56,342 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:32:56,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:32:56,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:32:56,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:56,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 807 transitions. [2019-09-08 12:32:56,416 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 807 transitions. Word has length 101 [2019-09-08 12:32:56,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:56,417 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 807 transitions. [2019-09-08 12:32:56,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 807 transitions. [2019-09-08 12:32:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:56,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:56,418 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 12:32:56,418 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:56,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:56,419 INFO L82 PathProgramCache]: Analyzing trace with hash 135143125, now seen corresponding path program 1 times [2019-09-08 12:32:56,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:56,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:56,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:56,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:56,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:56,608 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 12:32:56,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:56,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:56,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:56,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:56,625 INFO L87 Difference]: Start difference. First operand 639 states and 807 transitions. Second operand 9 states. [2019-09-08 12:32:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:59,284 INFO L93 Difference]: Finished difference Result 1151 states and 1494 transitions. [2019-09-08 12:32:59,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:59,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:32:59,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:59,286 INFO L225 Difference]: With dead ends: 1151 [2019-09-08 12:32:59,286 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:32:59,287 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 12:32:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:32:59,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:32:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:32:59,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 806 transitions. [2019-09-08 12:32:59,365 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 806 transitions. Word has length 101 [2019-09-08 12:32:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:59,365 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 806 transitions. [2019-09-08 12:32:59,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 806 transitions. [2019-09-08 12:32:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:32:59,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:59,366 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 12:32:59,366 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:59,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash 160216056, now seen corresponding path program 1 times [2019-09-08 12:32:59,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:59,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:59,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:59,541 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 12:32:59,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:59,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:59,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:59,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:59,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:59,542 INFO L87 Difference]: Start difference. First operand 639 states and 806 transitions. Second operand 9 states. [2019-09-08 12:33:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:01,536 INFO L93 Difference]: Finished difference Result 1200 states and 1562 transitions. [2019-09-08 12:33:01,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:01,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:33:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:01,538 INFO L225 Difference]: With dead ends: 1200 [2019-09-08 12:33:01,538 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 12:33:01,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:01,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 12:33:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 639. [2019-09-08 12:33:01,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:33:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 805 transitions. [2019-09-08 12:33:01,679 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 805 transitions. Word has length 101 [2019-09-08 12:33:01,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:01,679 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 805 transitions. [2019-09-08 12:33:01,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:01,680 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 805 transitions. [2019-09-08 12:33:01,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:33:01,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:01,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, 1, 1, 1, 1, 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:33:01,683 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:01,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:01,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1768940456, now seen corresponding path program 1 times [2019-09-08 12:33:01,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:01,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:01,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:01,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:01,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:01,874 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 12:33:01,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:01,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:01,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:01,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:01,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:01,876 INFO L87 Difference]: Start difference. First operand 639 states and 805 transitions. Second operand 9 states. [2019-09-08 12:33:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:03,921 INFO L93 Difference]: Finished difference Result 1156 states and 1497 transitions. [2019-09-08 12:33:03,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:03,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:33:03,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:03,923 INFO L225 Difference]: With dead ends: 1156 [2019-09-08 12:33:03,923 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:33:03,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:03,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:33:03,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:33:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:33:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 804 transitions. [2019-09-08 12:33:04,000 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 804 transitions. Word has length 101 [2019-09-08 12:33:04,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:04,000 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 804 transitions. [2019-09-08 12:33:04,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:04,001 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 804 transitions. [2019-09-08 12:33:04,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:33:04,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:04,002 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 12:33:04,002 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:04,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:04,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1364812236, now seen corresponding path program 1 times [2019-09-08 12:33:04,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:04,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:04,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:04,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:04,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:04,162 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 12:33:04,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:04,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:04,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:04,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:04,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:04,164 INFO L87 Difference]: Start difference. First operand 639 states and 804 transitions. Second operand 9 states. [2019-09-08 12:33:06,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:06,385 INFO L93 Difference]: Finished difference Result 1156 states and 1496 transitions. [2019-09-08 12:33:06,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:06,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:33:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:06,390 INFO L225 Difference]: With dead ends: 1156 [2019-09-08 12:33:06,390 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:33:06,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:06,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:33:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:33:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:33:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 803 transitions. [2019-09-08 12:33:06,472 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 803 transitions. Word has length 101 [2019-09-08 12:33:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:06,472 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 803 transitions. [2019-09-08 12:33:06,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 803 transitions. [2019-09-08 12:33:06,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:33:06,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:06,474 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 12:33:06,474 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:06,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:06,475 INFO L82 PathProgramCache]: Analyzing trace with hash -805496503, now seen corresponding path program 1 times [2019-09-08 12:33:06,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:06,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:06,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:06,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:06,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:06,591 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 12:33:06,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:06,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:06,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:06,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:06,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:06,592 INFO L87 Difference]: Start difference. First operand 639 states and 803 transitions. Second operand 9 states. [2019-09-08 12:33:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:08,492 INFO L93 Difference]: Finished difference Result 1153 states and 1491 transitions. [2019-09-08 12:33:08,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:08,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:33:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:08,494 INFO L225 Difference]: With dead ends: 1153 [2019-09-08 12:33:08,494 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:33:08,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:33:08,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:33:08,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:33:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 802 transitions. [2019-09-08 12:33:08,619 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 802 transitions. Word has length 101 [2019-09-08 12:33:08,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:08,619 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 802 transitions. [2019-09-08 12:33:08,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:08,620 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 802 transitions. [2019-09-08 12:33:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:33:08,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:08,621 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 12:33:08,621 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:08,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:08,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1984318311, now seen corresponding path program 1 times [2019-09-08 12:33:08,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:08,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:08,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:08,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:08,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:08,768 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 12:33:08,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:08,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:08,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:08,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:08,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:08,770 INFO L87 Difference]: Start difference. First operand 639 states and 802 transitions. Second operand 9 states. [2019-09-08 12:33:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:10,836 INFO L93 Difference]: Finished difference Result 1153 states and 1490 transitions. [2019-09-08 12:33:10,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:10,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:33:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:10,838 INFO L225 Difference]: With dead ends: 1153 [2019-09-08 12:33:10,838 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:33:10,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:33:10,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:33:10,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:33:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 801 transitions. [2019-09-08 12:33:10,918 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 801 transitions. Word has length 101 [2019-09-08 12:33:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:10,918 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 801 transitions. [2019-09-08 12:33:10,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 801 transitions. [2019-09-08 12:33:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:33:10,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:10,920 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 12:33:10,920 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:10,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:10,920 INFO L82 PathProgramCache]: Analyzing trace with hash -140231016, now seen corresponding path program 1 times [2019-09-08 12:33:10,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:10,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:10,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:10,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:10,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:11,045 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 12:33:11,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:11,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:11,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:11,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:11,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:11,047 INFO L87 Difference]: Start difference. First operand 639 states and 801 transitions. Second operand 9 states. [2019-09-08 12:33:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:13,468 INFO L93 Difference]: Finished difference Result 1156 states and 1492 transitions. [2019-09-08 12:33:13,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:13,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:33:13,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:13,469 INFO L225 Difference]: With dead ends: 1156 [2019-09-08 12:33:13,470 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:33:13,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:13,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:33:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:33:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:33:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 800 transitions. [2019-09-08 12:33:13,550 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 800 transitions. Word has length 101 [2019-09-08 12:33:13,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:13,551 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 800 transitions. [2019-09-08 12:33:13,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 800 transitions. [2019-09-08 12:33:13,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:33:13,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:13,552 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 12:33:13,552 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:13,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:13,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1539223594, now seen corresponding path program 1 times [2019-09-08 12:33:13,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:13,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:13,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:13,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:13,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:13,669 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 12:33:13,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:13,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:13,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:13,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:13,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:13,670 INFO L87 Difference]: Start difference. First operand 639 states and 800 transitions. Second operand 9 states. [2019-09-08 12:33:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:15,602 INFO L93 Difference]: Finished difference Result 1153 states and 1487 transitions. [2019-09-08 12:33:15,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:15,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:33:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:15,605 INFO L225 Difference]: With dead ends: 1153 [2019-09-08 12:33:15,605 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:33:15,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:15,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:33:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:33:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:33:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 799 transitions. [2019-09-08 12:33:15,708 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 799 transitions. Word has length 101 [2019-09-08 12:33:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:15,708 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 799 transitions. [2019-09-08 12:33:15,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 799 transitions. [2019-09-08 12:33:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:33:15,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:15,709 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 12:33:15,710 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:15,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:15,710 INFO L82 PathProgramCache]: Analyzing trace with hash 156727661, now seen corresponding path program 1 times [2019-09-08 12:33:15,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:15,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:15,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:15,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:15,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:15,848 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 12:33:15,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:15,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:15,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:15,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:15,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:15,849 INFO L87 Difference]: Start difference. First operand 639 states and 799 transitions. Second operand 9 states. [2019-09-08 12:33:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:18,106 INFO L93 Difference]: Finished difference Result 1152 states and 1484 transitions. [2019-09-08 12:33:18,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:18,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:33:18,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:18,107 INFO L225 Difference]: With dead ends: 1152 [2019-09-08 12:33:18,108 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:33:18,108 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 12:33:18,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:33:18,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:33:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:33:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 798 transitions. [2019-09-08 12:33:18,241 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 798 transitions. Word has length 102 [2019-09-08 12:33:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:18,242 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 798 transitions. [2019-09-08 12:33:18,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 798 transitions. [2019-09-08 12:33:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:33:18,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:18,243 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 12:33:18,243 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:18,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:18,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1086833095, now seen corresponding path program 1 times [2019-09-08 12:33:18,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:18,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:18,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:18,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:18,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:18,358 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 12:33:18,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:18,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:18,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:18,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:18,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:18,359 INFO L87 Difference]: Start difference. First operand 639 states and 798 transitions. Second operand 9 states. [2019-09-08 12:33:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:20,596 INFO L93 Difference]: Finished difference Result 1151 states and 1482 transitions. [2019-09-08 12:33:20,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:20,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:33:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:20,598 INFO L225 Difference]: With dead ends: 1151 [2019-09-08 12:33:20,598 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:33:20,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:33:20,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:33:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:33:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 797 transitions. [2019-09-08 12:33:20,684 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 797 transitions. Word has length 102 [2019-09-08 12:33:20,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:20,685 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 797 transitions. [2019-09-08 12:33:20,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:20,685 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 797 transitions. [2019-09-08 12:33:20,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:33:20,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:20,686 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, 1] [2019-09-08 12:33:20,686 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:20,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:20,686 INFO L82 PathProgramCache]: Analyzing trace with hash 725509289, now seen corresponding path program 1 times [2019-09-08 12:33:20,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:20,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:20,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:20,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:20,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:21,784 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:33:21,938 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 12:33:22,098 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:33:23,250 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 12:33:23,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:23,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:33:23,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:33:23,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:33:23,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:33:23,252 INFO L87 Difference]: Start difference. First operand 639 states and 797 transitions. Second operand 31 states. [2019-09-08 12:33:23,431 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-08 12:33:24,382 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-08 12:33:24,550 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:33:24,958 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-08 12:33:25,325 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-08 12:33:25,763 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2019-09-08 12:33:26,372 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 125 [2019-09-08 12:33:27,617 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 169 DAG size of output: 148 [2019-09-08 12:33:27,922 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-08 12:33:28,196 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-08 12:33:28,560 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 12:33:35,849 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-08 12:33:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:48,020 INFO L93 Difference]: Finished difference Result 2241 states and 2834 transitions. [2019-09-08 12:33:48,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 12:33:48,020 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 103 [2019-09-08 12:33:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:48,022 INFO L225 Difference]: With dead ends: 2241 [2019-09-08 12:33:48,023 INFO L226 Difference]: Without dead ends: 2160 [2019-09-08 12:33:48,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=581, Invalid=2959, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 12:33:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2019-09-08 12:33:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 663. [2019-09-08 12:33:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-08 12:33:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 827 transitions. [2019-09-08 12:33:48,133 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 827 transitions. Word has length 103 [2019-09-08 12:33:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:48,133 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 827 transitions. [2019-09-08 12:33:48,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:33:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 827 transitions. [2019-09-08 12:33:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:33:48,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:48,135 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, 1] [2019-09-08 12:33:48,135 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:48,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:48,135 INFO L82 PathProgramCache]: Analyzing trace with hash -841243648, now seen corresponding path program 1 times [2019-09-08 12:33:48,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:48,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:48,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:48,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:48,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:49,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:49,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:33:49,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:33:49,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:33:49,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:33:49,059 INFO L87 Difference]: Start difference. First operand 663 states and 827 transitions. Second operand 17 states. [2019-09-08 12:33:49,638 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:33:49,783 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:33:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:53,299 INFO L93 Difference]: Finished difference Result 1336 states and 1720 transitions. [2019-09-08 12:33:53,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:33:53,299 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:33:53,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:53,301 INFO L225 Difference]: With dead ends: 1336 [2019-09-08 12:33:53,301 INFO L226 Difference]: Without dead ends: 1229 [2019-09-08 12:33:53,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:33:53,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2019-09-08 12:33:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 628. [2019-09-08 12:33:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-08 12:33:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 782 transitions. [2019-09-08 12:33:53,439 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 782 transitions. Word has length 103 [2019-09-08 12:33:53,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:53,440 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 782 transitions. [2019-09-08 12:33:53,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:33:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 782 transitions. [2019-09-08 12:33:53,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:33:53,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:53,441 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, 1] [2019-09-08 12:33:53,442 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:53,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:53,442 INFO L82 PathProgramCache]: Analyzing trace with hash 75685686, now seen corresponding path program 1 times [2019-09-08 12:33:53,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:53,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:53,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:53,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:53,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:54,540 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 12:33:54,697 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:33:54,872 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-08 12:33:55,044 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-08 12:33:55,205 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:33:56,553 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 12:33:56,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:56,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:33:56,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:33:56,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:33:56,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:33:56,554 INFO L87 Difference]: Start difference. First operand 628 states and 782 transitions. Second operand 31 states. [2019-09-08 12:33:56,769 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-09-08 12:33:57,937 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-08 12:33:58,129 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-09-08 12:33:58,670 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-09-08 12:33:58,990 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-09-08 12:33:59,356 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 64 [2019-09-08 12:33:59,771 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 73 [2019-09-08 12:34:00,288 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2019-09-08 12:34:00,657 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2019-09-08 12:34:01,012 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2019-09-08 12:34:01,210 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 12:34:15,390 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-09-08 12:34:17,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:17,539 INFO L93 Difference]: Finished difference Result 1299 states and 1637 transitions. [2019-09-08 12:34:17,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:34:17,539 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 103 [2019-09-08 12:34:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:17,541 INFO L225 Difference]: With dead ends: 1299 [2019-09-08 12:34:17,541 INFO L226 Difference]: Without dead ends: 1221 [2019-09-08 12:34:17,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=473, Invalid=2497, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 12:34:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-09-08 12:34:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 653. [2019-09-08 12:34:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-09-08 12:34:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 815 transitions. [2019-09-08 12:34:17,704 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 815 transitions. Word has length 103 [2019-09-08 12:34:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:17,705 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 815 transitions. [2019-09-08 12:34:17,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:34:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 815 transitions. [2019-09-08 12:34:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:34:17,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:17,706 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, 1] [2019-09-08 12:34:17,706 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:17,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1062800595, now seen corresponding path program 1 times [2019-09-08 12:34:17,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:17,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:17,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:17,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:17,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:18,446 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 12:34:18,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:18,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:34:18,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:34:18,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:34:18,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:34:18,448 INFO L87 Difference]: Start difference. First operand 653 states and 815 transitions. Second operand 17 states. [2019-09-08 12:34:19,094 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:34:21,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:21,417 INFO L93 Difference]: Finished difference Result 1335 states and 1722 transitions. [2019-09-08 12:34:21,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:34:21,417 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:34:21,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:21,419 INFO L225 Difference]: With dead ends: 1335 [2019-09-08 12:34:21,419 INFO L226 Difference]: Without dead ends: 1202 [2019-09-08 12:34:21,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:34:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-08 12:34:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 629. [2019-09-08 12:34:21,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-08 12:34:21,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 783 transitions. [2019-09-08 12:34:21,548 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 783 transitions. Word has length 103 [2019-09-08 12:34:21,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:21,548 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 783 transitions. [2019-09-08 12:34:21,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:34:21,548 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 783 transitions. [2019-09-08 12:34:21,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:34:21,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:21,550 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, 1] [2019-09-08 12:34:21,550 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:21,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:21,550 INFO L82 PathProgramCache]: Analyzing trace with hash 559668261, now seen corresponding path program 1 times [2019-09-08 12:34:21,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:21,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:21,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:21,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:21,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:22,225 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 12:34:22,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:22,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:34:22,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:34:22,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:34:22,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:34:22,226 INFO L87 Difference]: Start difference. First operand 629 states and 783 transitions. Second operand 17 states. [2019-09-08 12:34:22,863 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:34:25,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:25,180 INFO L93 Difference]: Finished difference Result 1299 states and 1675 transitions. [2019-09-08 12:34:25,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:34:25,181 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:34:25,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:25,183 INFO L225 Difference]: With dead ends: 1299 [2019-09-08 12:34:25,183 INFO L226 Difference]: Without dead ends: 1181 [2019-09-08 12:34:25,184 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 12:34:25,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-09-08 12:34:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 611. [2019-09-08 12:34:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 12:34:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 757 transitions. [2019-09-08 12:34:25,310 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 757 transitions. Word has length 103 [2019-09-08 12:34:25,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:25,310 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 757 transitions. [2019-09-08 12:34:25,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:34:25,310 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 757 transitions. [2019-09-08 12:34:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:34:25,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:25,311 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, 1] [2019-09-08 12:34:25,312 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:25,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:25,312 INFO L82 PathProgramCache]: Analyzing trace with hash -171293856, now seen corresponding path program 1 times [2019-09-08 12:34:25,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:25,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:25,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:25,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:25,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:26,045 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 12:34:26,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:26,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:34:26,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:34:26,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:34:26,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:34:26,047 INFO L87 Difference]: Start difference. First operand 611 states and 757 transitions. Second operand 16 states. [2019-09-08 12:34:26,728 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:34:26,980 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:34:30,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:30,226 INFO L93 Difference]: Finished difference Result 1051 states and 1273 transitions. [2019-09-08 12:34:30,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:34:30,226 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-09-08 12:34:30,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:30,228 INFO L225 Difference]: With dead ends: 1051 [2019-09-08 12:34:30,228 INFO L226 Difference]: Without dead ends: 1047 [2019-09-08 12:34:30,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:34:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-09-08 12:34:30,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 634. [2019-09-08 12:34:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-08 12:34:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 789 transitions. [2019-09-08 12:34:30,414 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 789 transitions. Word has length 103 [2019-09-08 12:34:30,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:30,415 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 789 transitions. [2019-09-08 12:34:30,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:34:30,415 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 789 transitions. [2019-09-08 12:34:30,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:34:30,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:30,416 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, 1] [2019-09-08 12:34:30,417 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:30,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:30,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1183554526, now seen corresponding path program 1 times [2019-09-08 12:34:30,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:30,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:30,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:30,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:30,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:31,219 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 12:34:31,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:31,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:34:31,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:34:31,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:34:31,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:34:31,221 INFO L87 Difference]: Start difference. First operand 634 states and 789 transitions. Second operand 16 states. [2019-09-08 12:34:31,884 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:34:32,032 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:34:32,179 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:34:32,350 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:34:32,518 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:34:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:35,697 INFO L93 Difference]: Finished difference Result 1101 states and 1363 transitions. [2019-09-08 12:34:35,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:34:35,698 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-09-08 12:34:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:35,699 INFO L225 Difference]: With dead ends: 1101 [2019-09-08 12:34:35,700 INFO L226 Difference]: Without dead ends: 1026 [2019-09-08 12:34:35,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:34:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-09-08 12:34:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 638. [2019-09-08 12:34:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-08 12:34:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 794 transitions. [2019-09-08 12:34:35,859 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 794 transitions. Word has length 103 [2019-09-08 12:34:35,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:35,860 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 794 transitions. [2019-09-08 12:34:35,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:34:35,860 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 794 transitions. [2019-09-08 12:34:35,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:34:35,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:35,861 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:35,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:35,861 INFO L82 PathProgramCache]: Analyzing trace with hash 739529577, now seen corresponding path program 1 times [2019-09-08 12:34:35,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:35,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:35,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:35,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:35,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:37,133 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 12:34:37,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:37,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:34:37,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:34:37,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:34:37,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:34:37,134 INFO L87 Difference]: Start difference. First operand 638 states and 794 transitions. Second operand 22 states. [2019-09-08 12:34:38,176 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-08 12:34:38,418 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-08 12:34:38,725 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-08 12:34:38,903 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-08 12:34:39,155 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-08 12:34:39,433 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-08 12:34:39,772 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-08 12:34:43,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:43,054 INFO L93 Difference]: Finished difference Result 1352 states and 1713 transitions. [2019-09-08 12:34:43,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:34:43,054 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 103 [2019-09-08 12:34:43,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:43,056 INFO L225 Difference]: With dead ends: 1352 [2019-09-08 12:34:43,056 INFO L226 Difference]: Without dead ends: 1203 [2019-09-08 12:34:43,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:34:43,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-09-08 12:34:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 650. [2019-09-08 12:34:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-09-08 12:34:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 806 transitions. [2019-09-08 12:34:43,223 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 806 transitions. Word has length 103 [2019-09-08 12:34:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:43,224 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 806 transitions. [2019-09-08 12:34:43,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:34:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 806 transitions. [2019-09-08 12:34:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:34:43,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:43,225 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, 1] [2019-09-08 12:34:43,225 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:43,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:43,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1338576063, now seen corresponding path program 1 times [2019-09-08 12:34:43,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:43,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:43,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:43,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:43,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:44,183 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 12:34:44,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:44,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:34:44,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:34:44,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:34:44,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:34:44,185 INFO L87 Difference]: Start difference. First operand 650 states and 806 transitions. Second operand 17 states. [2019-09-08 12:34:44,740 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:34:44,883 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 12:34:46,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:46,820 INFO L93 Difference]: Finished difference Result 1297 states and 1667 transitions. [2019-09-08 12:34:46,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:34:46,820 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:34:46,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:46,822 INFO L225 Difference]: With dead ends: 1297 [2019-09-08 12:34:46,822 INFO L226 Difference]: Without dead ends: 1133 [2019-09-08 12:34:46,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:34:46,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-09-08 12:34:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 610. [2019-09-08 12:34:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-08 12:34:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 750 transitions. [2019-09-08 12:34:46,997 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 750 transitions. Word has length 103 [2019-09-08 12:34:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:46,997 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 750 transitions. [2019-09-08 12:34:46,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:34:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 750 transitions. [2019-09-08 12:34:46,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:34:46,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:46,998 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, 1] [2019-09-08 12:34:46,999 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:46,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:46,999 INFO L82 PathProgramCache]: Analyzing trace with hash -120255204, now seen corresponding path program 1 times [2019-09-08 12:34:46,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:46,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:47,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:47,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:47,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:47,828 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 12:34:47,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:47,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:34:47,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:34:47,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:34:47,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:34:47,829 INFO L87 Difference]: Start difference. First operand 610 states and 750 transitions. Second operand 17 states. [2019-09-08 12:34:48,444 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 12:34:48,591 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-08 12:34:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:52,084 INFO L93 Difference]: Finished difference Result 1168 states and 1495 transitions. [2019-09-08 12:34:52,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:34:52,084 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:34:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:52,088 INFO L225 Difference]: With dead ends: 1168 [2019-09-08 12:34:52,088 INFO L226 Difference]: Without dead ends: 1087 [2019-09-08 12:34:52,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:34:52,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2019-09-08 12:34:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 609. [2019-09-08 12:34:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2019-09-08 12:34:52,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 747 transitions. [2019-09-08 12:34:52,291 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 747 transitions. Word has length 103 [2019-09-08 12:34:52,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:52,291 INFO L475 AbstractCegarLoop]: Abstraction has 609 states and 747 transitions. [2019-09-08 12:34:52,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:34:52,292 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 747 transitions. [2019-09-08 12:34:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:34:52,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:52,293 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, 1] [2019-09-08 12:34:52,293 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:52,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:52,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1687008141, now seen corresponding path program 1 times [2019-09-08 12:34:52,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:52,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:52,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:52,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:52,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:53,197 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:34:53,353 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-08 12:34:53,505 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:34:54,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 12:34:54,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:54,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-08 12:34:54,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 12:34:54,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 12:34:54,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:34:54,501 INFO L87 Difference]: Start difference. First operand 609 states and 747 transitions. Second operand 30 states. [2019-09-08 12:34:54,695 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-08 12:34:55,788 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-08 12:34:56,062 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-08 12:34:56,514 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 69 [2019-09-08 12:34:56,901 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-09-08 12:34:57,372 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 92 [2019-09-08 12:34:57,924 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 104 [2019-09-08 12:34:58,306 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-08 12:34:58,590 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-08 12:34:58,886 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-08 12:34:59,152 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-08 12:34:59,406 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-08 12:34:59,813 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-08 12:35:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:10,811 INFO L93 Difference]: Finished difference Result 1429 states and 1776 transitions. [2019-09-08 12:35:10,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:35:10,812 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 103 [2019-09-08 12:35:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:10,813 INFO L225 Difference]: With dead ends: 1429 [2019-09-08 12:35:10,813 INFO L226 Difference]: Without dead ends: 1327 [2019-09-08 12:35:10,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=544, Invalid=2108, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 12:35:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2019-09-08 12:35:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 625. [2019-09-08 12:35:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-09-08 12:35:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 765 transitions. [2019-09-08 12:35:10,992 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 765 transitions. Word has length 103 [2019-09-08 12:35:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:10,993 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 765 transitions. [2019-09-08 12:35:10,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 12:35:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 765 transitions. [2019-09-08 12:35:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:35:10,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:10,994 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, 1] [2019-09-08 12:35:10,994 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:10,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:10,994 INFO L82 PathProgramCache]: Analyzing trace with hash 644009232, now seen corresponding path program 1 times [2019-09-08 12:35:10,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:10,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:10,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:10,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:10,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:11,944 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 12:35:11,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:11,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 12:35:11,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:35:11,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:35:11,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:35:11,945 INFO L87 Difference]: Start difference. First operand 625 states and 765 transitions. Second operand 20 states. [2019-09-08 12:35:12,904 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-08 12:35:13,133 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-08 12:35:13,303 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 12:35:13,468 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 12:35:13,635 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-08 12:35:13,774 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-08 12:35:13,908 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-08 12:35:14,126 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-08 12:35:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:17,982 INFO L93 Difference]: Finished difference Result 1387 states and 1727 transitions. [2019-09-08 12:35:17,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:35:17,983 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2019-09-08 12:35:17,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:17,985 INFO L225 Difference]: With dead ends: 1387 [2019-09-08 12:35:17,985 INFO L226 Difference]: Without dead ends: 1195 [2019-09-08 12:35:17,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=297, Invalid=893, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:35:17,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-09-08 12:35:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 615. [2019-09-08 12:35:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-09-08 12:35:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 753 transitions. [2019-09-08 12:35:18,182 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 753 transitions. Word has length 103 [2019-09-08 12:35:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:18,182 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 753 transitions. [2019-09-08 12:35:18,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:35:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 753 transitions. [2019-09-08 12:35:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:35:18,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:18,184 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, 1, 1] [2019-09-08 12:35:18,184 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:18,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:18,185 INFO L82 PathProgramCache]: Analyzing trace with hash -272553273, now seen corresponding path program 1 times [2019-09-08 12:35:18,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:18,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:18,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:18,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:18,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:18,663 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 12:35:18,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:18,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:35:18,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:35:18,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:35:18,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:35:18,664 INFO L87 Difference]: Start difference. First operand 615 states and 753 transitions. Second operand 12 states. [2019-09-08 12:35:19,135 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-08 12:35:19,274 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-08 12:35:19,564 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-09-08 12:35:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:21,069 INFO L93 Difference]: Finished difference Result 1588 states and 2082 transitions. [2019-09-08 12:35:21,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:35:21,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-09-08 12:35:21,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:21,072 INFO L225 Difference]: With dead ends: 1588 [2019-09-08 12:35:21,072 INFO L226 Difference]: Without dead ends: 1492 [2019-09-08 12:35:21,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:35:21,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2019-09-08 12:35:21,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 593. [2019-09-08 12:35:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-09-08 12:35:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 728 transitions. [2019-09-08 12:35:21,257 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 728 transitions. Word has length 104 [2019-09-08 12:35:21,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:21,257 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 728 transitions. [2019-09-08 12:35:21,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:35:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 728 transitions. [2019-09-08 12:35:21,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:35:21,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:21,258 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, 1, 1] [2019-09-08 12:35:21,258 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:21,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:21,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1720315989, now seen corresponding path program 1 times [2019-09-08 12:35:21,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:21,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:21,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:21,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:21,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:21,719 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 12:35:21,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:21,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:35:21,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:35:21,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:35:21,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:35:21,721 INFO L87 Difference]: Start difference. First operand 593 states and 728 transitions. Second operand 11 states. [2019-09-08 12:35:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:23,620 INFO L93 Difference]: Finished difference Result 1459 states and 1951 transitions. [2019-09-08 12:35:23,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:23,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-08 12:35:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:23,621 INFO L225 Difference]: With dead ends: 1459 [2019-09-08 12:35:23,622 INFO L226 Difference]: Without dead ends: 1365 [2019-09-08 12:35:23,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:35:23,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-09-08 12:35:23,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 557. [2019-09-08 12:35:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-09-08 12:35:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 682 transitions. [2019-09-08 12:35:23,785 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 682 transitions. Word has length 104 [2019-09-08 12:35:23,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:23,786 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 682 transitions. [2019-09-08 12:35:23,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:35:23,786 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 682 transitions. [2019-09-08 12:35:23,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:35:23,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:23,787 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, 1, 1] [2019-09-08 12:35:23,787 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:23,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:23,787 INFO L82 PathProgramCache]: Analyzing trace with hash 267466075, now seen corresponding path program 1 times [2019-09-08 12:35:23,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:23,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:23,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:23,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:23,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:23,950 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 12:35:23,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:23,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:23,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:23,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:23,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:23,952 INFO L87 Difference]: Start difference. First operand 557 states and 682 transitions. Second operand 9 states. [2019-09-08 12:35:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:25,803 INFO L93 Difference]: Finished difference Result 1037 states and 1336 transitions. [2019-09-08 12:35:25,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:25,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:35:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:25,805 INFO L225 Difference]: With dead ends: 1037 [2019-09-08 12:35:25,805 INFO L226 Difference]: Without dead ends: 945 [2019-09-08 12:35:25,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:35:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-09-08 12:35:25,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 557. [2019-09-08 12:35:25,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-09-08 12:35:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 681 transitions. [2019-09-08 12:35:25,976 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 681 transitions. Word has length 104 [2019-09-08 12:35:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:25,976 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 681 transitions. [2019-09-08 12:35:25,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:35:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 681 transitions. [2019-09-08 12:35:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:35:25,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:25,977 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, 1, 1] [2019-09-08 12:35:25,978 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:25,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:25,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1850286100, now seen corresponding path program 1 times [2019-09-08 12:35:25,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:25,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:25,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:25,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:25,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:26,359 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 12:35:26,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:26,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:35:26,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:35:26,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:35:26,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:35:26,360 INFO L87 Difference]: Start difference. First operand 557 states and 681 transitions. Second operand 11 states. [2019-09-08 12:35:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:28,367 INFO L93 Difference]: Finished difference Result 1427 states and 1886 transitions. [2019-09-08 12:35:28,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:35:28,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-08 12:35:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:28,369 INFO L225 Difference]: With dead ends: 1427 [2019-09-08 12:35:28,369 INFO L226 Difference]: Without dead ends: 1314 [2019-09-08 12:35:28,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:35:28,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-09-08 12:35:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 518. [2019-09-08 12:35:28,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-09-08 12:35:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 635 transitions. [2019-09-08 12:35:28,529 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 635 transitions. Word has length 104 [2019-09-08 12:35:28,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:28,529 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 635 transitions. [2019-09-08 12:35:28,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:35:28,530 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 635 transitions. [2019-09-08 12:35:28,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:35:28,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:28,530 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, 1, 1] [2019-09-08 12:35:28,531 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:28,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:28,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1999000552, now seen corresponding path program 1 times [2019-09-08 12:35:28,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:28,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:28,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:28,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:28,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:29,781 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 12:35:29,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:29,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:35:29,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:35:29,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:35:29,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:35:29,782 INFO L87 Difference]: Start difference. First operand 518 states and 635 transitions. Second operand 21 states. [2019-09-08 12:35:30,823 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-08 12:35:31,258 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-09-08 12:35:31,474 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-08 12:35:31,664 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-08 12:35:31,897 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-08 12:35:32,143 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-08 12:35:32,905 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-08 12:35:33,513 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-08 12:35:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:37,267 INFO L93 Difference]: Finished difference Result 1014 states and 1231 transitions. [2019-09-08 12:35:37,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:35:37,268 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 104 [2019-09-08 12:35:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:37,269 INFO L225 Difference]: With dead ends: 1014 [2019-09-08 12:35:37,270 INFO L226 Difference]: Without dead ends: 1008 [2019-09-08 12:35:37,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=377, Invalid=1263, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 12:35:37,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-09-08 12:35:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 518. [2019-09-08 12:35:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-09-08 12:35:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 634 transitions. [2019-09-08 12:35:37,452 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 634 transitions. Word has length 104 [2019-09-08 12:35:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:37,452 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 634 transitions. [2019-09-08 12:35:37,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:35:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 634 transitions. [2019-09-08 12:35:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:35:37,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:37,453 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, 1, 1] [2019-09-08 12:35:37,453 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:37,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:37,453 INFO L82 PathProgramCache]: Analyzing trace with hash 471857668, now seen corresponding path program 1 times [2019-09-08 12:35:37,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:37,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:37,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:37,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:37,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:37,819 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 12:35:37,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:37,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:35:37,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:35:37,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:35:37,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:35:37,820 INFO L87 Difference]: Start difference. First operand 518 states and 634 transitions. Second operand 11 states. [2019-09-08 12:35:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:39,584 INFO L93 Difference]: Finished difference Result 1381 states and 1853 transitions. [2019-09-08 12:35:39,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:39,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-08 12:35:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:39,586 INFO L225 Difference]: With dead ends: 1381 [2019-09-08 12:35:39,586 INFO L226 Difference]: Without dead ends: 1283 [2019-09-08 12:35:39,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:35:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-09-08 12:35:39,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 492. [2019-09-08 12:35:39,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-09-08 12:35:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 601 transitions. [2019-09-08 12:35:39,761 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 601 transitions. Word has length 104 [2019-09-08 12:35:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:39,761 INFO L475 AbstractCegarLoop]: Abstraction has 492 states and 601 transitions. [2019-09-08 12:35:39,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:35:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 601 transitions. [2019-09-08 12:35:39,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:35:39,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:39,762 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, 1, 1] [2019-09-08 12:35:39,762 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:39,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:39,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1300176800, now seen corresponding path program 1 times [2019-09-08 12:35:39,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:39,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:39,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:39,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:39,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:40,350 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 12:35:40,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:40,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:35:40,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:35:40,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:35:40,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:35:40,351 INFO L87 Difference]: Start difference. First operand 492 states and 601 transitions. Second operand 13 states. [2019-09-08 12:35:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:43,171 INFO L93 Difference]: Finished difference Result 1612 states and 2134 transitions. [2019-09-08 12:35:43,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:35:43,171 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2019-09-08 12:35:43,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:43,174 INFO L225 Difference]: With dead ends: 1612 [2019-09-08 12:35:43,174 INFO L226 Difference]: Without dead ends: 1531 [2019-09-08 12:35:43,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:35:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2019-09-08 12:35:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 485. [2019-09-08 12:35:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-08 12:35:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 591 transitions. [2019-09-08 12:35:43,347 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 591 transitions. Word has length 104 [2019-09-08 12:35:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:43,347 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 591 transitions. [2019-09-08 12:35:43,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:35:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 591 transitions. [2019-09-08 12:35:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:35:43,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:43,348 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, 1, 1] [2019-09-08 12:35:43,348 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:43,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:43,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1655955247, now seen corresponding path program 1 times [2019-09-08 12:35:43,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:43,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:43,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:43,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:43,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:44,067 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 12:35:44,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:44,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:35:44,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:35:44,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:35:44,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:35:44,068 INFO L87 Difference]: Start difference. First operand 485 states and 591 transitions. Second operand 16 states. [2019-09-08 12:35:44,741 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:35:44,896 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:35:45,041 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:35:45,226 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:35:45,401 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:35:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:47,992 INFO L93 Difference]: Finished difference Result 840 states and 1040 transitions. [2019-09-08 12:35:47,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:35:47,992 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2019-09-08 12:35:47,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:47,994 INFO L225 Difference]: With dead ends: 840 [2019-09-08 12:35:47,994 INFO L226 Difference]: Without dead ends: 765 [2019-09-08 12:35:47,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:35:47,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-09-08 12:35:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 501. [2019-09-08 12:35:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-08 12:35:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 609 transitions. [2019-09-08 12:35:48,162 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 609 transitions. Word has length 104 [2019-09-08 12:35:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:48,162 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 609 transitions. [2019-09-08 12:35:48,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:35:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 609 transitions. [2019-09-08 12:35:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:35:48,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:48,163 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, 1, 1] [2019-09-08 12:35:48,163 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:48,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2099813372, now seen corresponding path program 1 times [2019-09-08 12:35:48,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:48,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:48,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:48,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:48,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:48,602 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 12:35:48,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:48,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:35:48,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:35:48,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:35:48,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:35:48,604 INFO L87 Difference]: Start difference. First operand 501 states and 609 transitions. Second operand 12 states. [2019-09-08 12:35:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:50,054 INFO L93 Difference]: Finished difference Result 1056 states and 1395 transitions. [2019-09-08 12:35:50,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:35:50,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-09-08 12:35:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:50,055 INFO L225 Difference]: With dead ends: 1056 [2019-09-08 12:35:50,056 INFO L226 Difference]: Without dead ends: 862 [2019-09-08 12:35:50,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:35:50,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-09-08 12:35:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 375. [2019-09-08 12:35:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-08 12:35:50,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 462 transitions. [2019-09-08 12:35:50,208 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 462 transitions. Word has length 104 [2019-09-08 12:35:50,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:50,209 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 462 transitions. [2019-09-08 12:35:50,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:35:50,209 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 462 transitions. [2019-09-08 12:35:50,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:35:50,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:50,210 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, 1, 1] [2019-09-08 12:35:50,210 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:50,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:50,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1992993633, now seen corresponding path program 1 times [2019-09-08 12:35:50,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:50,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:50,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:50,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:50,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:50,572 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 12:35:50,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:50,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:35:50,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:35:50,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:35:50,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:35:50,573 INFO L87 Difference]: Start difference. First operand 375 states and 462 transitions. Second operand 10 states. [2019-09-08 12:35:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:51,570 INFO L93 Difference]: Finished difference Result 728 states and 965 transitions. [2019-09-08 12:35:51,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:35:51,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-08 12:35:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:51,571 INFO L225 Difference]: With dead ends: 728 [2019-09-08 12:35:51,572 INFO L226 Difference]: Without dead ends: 472 [2019-09-08 12:35:51,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:35:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-08 12:35:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 193. [2019-09-08 12:35:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-08 12:35:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 236 transitions. [2019-09-08 12:35:51,674 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 236 transitions. Word has length 104 [2019-09-08 12:35:51,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:51,674 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 236 transitions. [2019-09-08 12:35:51,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:35:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 236 transitions. [2019-09-08 12:35:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:35:51,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:51,675 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, 1, 1, 1, 1] [2019-09-08 12:35:51,675 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:51,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash -424160789, now seen corresponding path program 1 times [2019-09-08 12:35:51,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:51,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:51,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:51,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:51,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:53,010 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 12:35:53,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:53,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-08 12:35:53,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 12:35:53,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 12:35:53,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:35:53,012 INFO L87 Difference]: Start difference. First operand 193 states and 236 transitions. Second operand 33 states. [2019-09-08 12:35:53,446 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 114 [2019-09-08 12:35:54,351 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:35:54,802 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 12:35:55,057 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-08 12:35:55,376 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-09-08 12:35:55,743 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2019-09-08 12:35:56,170 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2019-09-08 12:35:56,406 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-08 12:35:56,622 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-08 12:36:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:04,590 INFO L93 Difference]: Finished difference Result 1154 states and 1582 transitions. [2019-09-08 12:36:04,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 12:36:04,590 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 106 [2019-09-08 12:36:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:04,592 INFO L225 Difference]: With dead ends: 1154 [2019-09-08 12:36:04,592 INFO L226 Difference]: Without dead ends: 1148 [2019-09-08 12:36:04,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=581, Invalid=3079, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 12:36:04,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-09-08 12:36:04,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 219. [2019-09-08 12:36:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-08 12:36:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 268 transitions. [2019-09-08 12:36:04,703 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 268 transitions. Word has length 106 [2019-09-08 12:36:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:04,703 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 268 transitions. [2019-09-08 12:36:04,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 12:36:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 268 transitions. [2019-09-08 12:36:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:36:04,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:04,704 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, 1, 1, 1, 1, 1] [2019-09-08 12:36:04,705 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:04,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:04,705 INFO L82 PathProgramCache]: Analyzing trace with hash 2065250412, now seen corresponding path program 1 times [2019-09-08 12:36:04,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:04,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:04,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:04,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:04,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:06,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 12:36:06,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:06,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:36:06,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:36:06,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:36:06,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:36:06,454 INFO L87 Difference]: Start difference. First operand 219 states and 268 transitions. Second operand 26 states. [2019-09-08 12:36:06,613 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-08 12:36:07,815 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-08 12:36:08,071 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-08 12:36:08,366 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-09-08 12:36:08,760 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-08 12:36:08,987 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-08 12:36:09,219 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-08 12:36:10,251 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-08 12:36:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:12,629 INFO L93 Difference]: Finished difference Result 610 states and 813 transitions. [2019-09-08 12:36:12,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:36:12,630 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 107 [2019-09-08 12:36:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:12,631 INFO L225 Difference]: With dead ends: 610 [2019-09-08 12:36:12,631 INFO L226 Difference]: Without dead ends: 604 [2019-09-08 12:36:12,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=345, Invalid=1377, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 12:36:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-09-08 12:36:12,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 221. [2019-09-08 12:36:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-08 12:36:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 270 transitions. [2019-09-08 12:36:12,741 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 270 transitions. Word has length 107 [2019-09-08 12:36:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:12,741 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 270 transitions. [2019-09-08 12:36:12,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:36:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 270 transitions. [2019-09-08 12:36:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:36:12,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:12,743 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, 1, 1, 1, 1, 1] [2019-09-08 12:36:12,743 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:12,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:12,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1125051483, now seen corresponding path program 1 times [2019-09-08 12:36:12,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:12,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:12,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:12,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:12,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:13,954 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 12:36:13,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:13,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:36:13,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:36:13,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:36:13,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:36:13,955 INFO L87 Difference]: Start difference. First operand 221 states and 270 transitions. Second operand 21 states. [2019-09-08 12:36:15,020 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-08 12:36:15,278 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-08 12:36:15,465 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:36:15,642 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:36:16,300 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-08 12:36:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:17,873 INFO L93 Difference]: Finished difference Result 602 states and 804 transitions. [2019-09-08 12:36:17,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:36:17,874 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 107 [2019-09-08 12:36:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:17,874 INFO L225 Difference]: With dead ends: 602 [2019-09-08 12:36:17,875 INFO L226 Difference]: Without dead ends: 596 [2019-09-08 12:36:17,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 12:36:17,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-08 12:36:17,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 222. [2019-09-08 12:36:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-08 12:36:17,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 271 transitions. [2019-09-08 12:36:17,986 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 271 transitions. Word has length 107 [2019-09-08 12:36:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:17,987 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 271 transitions. [2019-09-08 12:36:17,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:36:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 271 transitions. [2019-09-08 12:36:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:36:17,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:17,987 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, 1, 1, 1, 1, 1] [2019-09-08 12:36:17,988 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:17,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:17,988 INFO L82 PathProgramCache]: Analyzing trace with hash -103440381, now seen corresponding path program 1 times [2019-09-08 12:36:17,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:17,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:17,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:17,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:17,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:18,729 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 12:36:18,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:18,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:36:18,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:36:18,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:36:18,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:36:18,730 INFO L87 Difference]: Start difference. First operand 222 states and 271 transitions. Second operand 16 states. [2019-09-08 12:36:19,428 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:36:19,583 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:36:19,736 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:36:19,919 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:36:21,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:21,553 INFO L93 Difference]: Finished difference Result 680 states and 921 transitions. [2019-09-08 12:36:21,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:36:21,553 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 107 [2019-09-08 12:36:21,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:21,554 INFO L225 Difference]: With dead ends: 680 [2019-09-08 12:36:21,554 INFO L226 Difference]: Without dead ends: 674 [2019-09-08 12:36:21,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:36:21,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-09-08 12:36:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 223. [2019-09-08 12:36:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-08 12:36:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2019-09-08 12:36:21,666 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 107 [2019-09-08 12:36:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:21,666 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2019-09-08 12:36:21,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:36:21,666 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2019-09-08 12:36:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:36:21,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:21,667 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, 1, 1, 1, 1, 1] [2019-09-08 12:36:21,667 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:21,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:21,667 INFO L82 PathProgramCache]: Analyzing trace with hash 564956522, now seen corresponding path program 1 times [2019-09-08 12:36:21,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:21,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:21,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:21,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:21,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:23,941 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 12:36:23,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:23,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-08 12:36:23,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 12:36:23,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 12:36:23,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:36:23,943 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand 33 states. [2019-09-08 12:36:24,232 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-08 12:36:25,046 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-08 12:36:25,228 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-08 12:36:25,472 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-08 12:36:25,700 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-08 12:36:26,160 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-08 12:36:26,427 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 12:36:26,726 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 12:36:27,063 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-08 12:36:27,454 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-08 12:36:27,906 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2019-09-08 12:36:28,193 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-09-08 12:36:28,472 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-09-08 12:36:28,749 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-09-08 12:36:28,988 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 12:36:29,204 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 12:36:29,460 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 12:36:31,675 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-08 12:36:33,308 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 12:36:33,749 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 12:36:34,058 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 12:36:34,340 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-08 12:36:35,885 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-08 12:36:37,965 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-08 12:36:39,313 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 12:36:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:52,354 INFO L93 Difference]: Finished difference Result 2514 states and 3559 transitions. [2019-09-08 12:36:52,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 12:36:52,354 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 107 [2019-09-08 12:36:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:52,357 INFO L225 Difference]: With dead ends: 2514 [2019-09-08 12:36:52,358 INFO L226 Difference]: Without dead ends: 2508 [2019-09-08 12:36:52,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1051, Invalid=5269, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 12:36:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-09-08 12:36:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 238. [2019-09-08 12:36:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-08 12:36:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 290 transitions. [2019-09-08 12:36:52,510 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 290 transitions. Word has length 107 [2019-09-08 12:36:52,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:52,510 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 290 transitions. [2019-09-08 12:36:52,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 12:36:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 290 transitions. [2019-09-08 12:36:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:36:52,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:52,511 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, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:52,511 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:52,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:52,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1631851315, now seen corresponding path program 1 times [2019-09-08 12:36:52,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:52,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:52,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:52,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:52,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:53,092 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 12:36:53,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:53,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:36:53,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:36:53,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:36:53,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:36:53,094 INFO L87 Difference]: Start difference. First operand 238 states and 290 transitions. Second operand 14 states. [2019-09-08 12:36:55,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:55,386 INFO L93 Difference]: Finished difference Result 614 states and 834 transitions. [2019-09-08 12:36:55,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:36:55,386 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 108 [2019-09-08 12:36:55,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:55,387 INFO L225 Difference]: With dead ends: 614 [2019-09-08 12:36:55,387 INFO L226 Difference]: Without dead ends: 608 [2019-09-08 12:36:55,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:36:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-08 12:36:55,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 223. [2019-09-08 12:36:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-08 12:36:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2019-09-08 12:36:55,514 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 108 [2019-09-08 12:36:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:55,514 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2019-09-08 12:36:55,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:36:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2019-09-08 12:36:55,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:36:55,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:55,515 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, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:55,515 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:55,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1799686662, now seen corresponding path program 1 times [2019-09-08 12:36:55,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:55,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:55,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:56,175 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 12:36:56,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:56,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:36:56,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:36:56,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:36:56,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:36:56,176 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand 16 states. [2019-09-08 12:36:57,197 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-08 12:36:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:58,979 INFO L93 Difference]: Finished difference Result 576 states and 778 transitions. [2019-09-08 12:36:58,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:36:58,980 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2019-09-08 12:36:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:58,981 INFO L225 Difference]: With dead ends: 576 [2019-09-08 12:36:58,981 INFO L226 Difference]: Without dead ends: 570 [2019-09-08 12:36:58,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:36:58,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-08 12:36:59,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 187. [2019-09-08 12:36:59,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-08 12:36:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 230 transitions. [2019-09-08 12:36:59,090 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 230 transitions. Word has length 108 [2019-09-08 12:36:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:59,090 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 230 transitions. [2019-09-08 12:36:59,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:36:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 230 transitions. [2019-09-08 12:36:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:36:59,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:59,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:59,091 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:59,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:59,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1478936557, now seen corresponding path program 1 times [2019-09-08 12:36:59,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:59,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:59,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:59,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:59,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:59,198 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 12:36:59,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:59,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:36:59,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:36:59,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:36:59,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:36:59,199 INFO L87 Difference]: Start difference. First operand 187 states and 230 transitions. Second operand 3 states. [2019-09-08 12:36:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:59,474 INFO L93 Difference]: Finished difference Result 331 states and 442 transitions. [2019-09-08 12:36:59,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:36:59,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-09-08 12:36:59,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:59,475 INFO L225 Difference]: With dead ends: 331 [2019-09-08 12:36:59,475 INFO L226 Difference]: Without dead ends: 257 [2019-09-08 12:36:59,475 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 12:36:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-08 12:36:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2019-09-08 12:36:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 12:36:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 330 transitions. [2019-09-08 12:36:59,665 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 330 transitions. Word has length 137 [2019-09-08 12:36:59,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:59,665 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 330 transitions. [2019-09-08 12:36:59,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:36:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 330 transitions. [2019-09-08 12:36:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:36:59,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:59,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:59,667 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:59,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:59,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1788757677, now seen corresponding path program 1 times [2019-09-08 12:36:59,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:59,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:59,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:59,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:59,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:59,783 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 12:36:59,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:59,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:36:59,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:36:59,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:36:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:36:59,785 INFO L87 Difference]: Start difference. First operand 255 states and 330 transitions. Second operand 7 states. [2019-09-08 12:37:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:01,116 INFO L93 Difference]: Finished difference Result 955 states and 1362 transitions. [2019-09-08 12:37:01,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:37:01,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-08 12:37:01,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:01,118 INFO L225 Difference]: With dead ends: 955 [2019-09-08 12:37:01,118 INFO L226 Difference]: Without dead ends: 813 [2019-09-08 12:37:01,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:37:01,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2019-09-08 12:37:01,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 415. [2019-09-08 12:37:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-08 12:37:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 567 transitions. [2019-09-08 12:37:01,489 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 567 transitions. Word has length 139 [2019-09-08 12:37:01,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:01,490 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 567 transitions. [2019-09-08 12:37:01,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:37:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 567 transitions. [2019-09-08 12:37:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:37:01,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:01,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:01,491 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:01,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:01,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1194284749, now seen corresponding path program 1 times [2019-09-08 12:37:01,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:01,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:01,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:01,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:01,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:01,605 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 12:37:01,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:01,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:37:01,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:37:01,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:37:01,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:37:01,606 INFO L87 Difference]: Start difference. First operand 415 states and 567 transitions. Second operand 7 states. [2019-09-08 12:37:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:03,714 INFO L93 Difference]: Finished difference Result 1807 states and 2619 transitions. [2019-09-08 12:37:03,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:37:03,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-08 12:37:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:03,716 INFO L225 Difference]: With dead ends: 1807 [2019-09-08 12:37:03,716 INFO L226 Difference]: Without dead ends: 1505 [2019-09-08 12:37:03,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:37:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2019-09-08 12:37:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 755. [2019-09-08 12:37:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-09-08 12:37:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1069 transitions. [2019-09-08 12:37:04,451 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1069 transitions. Word has length 139 [2019-09-08 12:37:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:04,451 INFO L475 AbstractCegarLoop]: Abstraction has 755 states and 1069 transitions. [2019-09-08 12:37:04,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:37:04,451 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1069 transitions. [2019-09-08 12:37:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:37:04,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:04,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:04,453 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:04,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:04,453 INFO L82 PathProgramCache]: Analyzing trace with hash 800368438, now seen corresponding path program 1 times [2019-09-08 12:37:04,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:04,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:04,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:04,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:04,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:04,522 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 12:37:04,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:04,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:04,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:04,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:04,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:04,523 INFO L87 Difference]: Start difference. First operand 755 states and 1069 transitions. Second operand 3 states. [2019-09-08 12:37:05,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:05,676 INFO L93 Difference]: Finished difference Result 1727 states and 2507 transitions. [2019-09-08 12:37:05,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:05,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-08 12:37:05,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:05,677 INFO L225 Difference]: With dead ends: 1727 [2019-09-08 12:37:05,677 INFO L226 Difference]: Without dead ends: 1085 [2019-09-08 12:37:05,678 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 12:37:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-09-08 12:37:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1083. [2019-09-08 12:37:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-09-08 12:37:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1549 transitions. [2019-09-08 12:37:06,783 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1549 transitions. Word has length 139 [2019-09-08 12:37:06,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:06,783 INFO L475 AbstractCegarLoop]: Abstraction has 1083 states and 1549 transitions. [2019-09-08 12:37:06,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:06,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1549 transitions. [2019-09-08 12:37:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:37:06,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:06,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:06,785 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:06,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:06,785 INFO L82 PathProgramCache]: Analyzing trace with hash 90180789, now seen corresponding path program 1 times [2019-09-08 12:37:06,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:06,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:06,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:06,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:06,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:06,853 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 12:37:06,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:06,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:06,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:06,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:06,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:06,854 INFO L87 Difference]: Start difference. First operand 1083 states and 1549 transitions. Second operand 3 states. [2019-09-08 12:37:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:09,021 INFO L93 Difference]: Finished difference Result 2955 states and 4291 transitions. [2019-09-08 12:37:09,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:09,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-08 12:37:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:09,044 INFO L225 Difference]: With dead ends: 2955 [2019-09-08 12:37:09,045 INFO L226 Difference]: Without dead ends: 1985 [2019-09-08 12:37:09,046 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 12:37:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-09-08 12:37:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1971. [2019-09-08 12:37:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-09-08 12:37:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2825 transitions. [2019-09-08 12:37:11,201 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2825 transitions. Word has length 139 [2019-09-08 12:37:11,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:11,201 INFO L475 AbstractCegarLoop]: Abstraction has 1971 states and 2825 transitions. [2019-09-08 12:37:11,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:11,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2825 transitions. [2019-09-08 12:37:11,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:37:11,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:11,203 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:11,203 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:11,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:11,203 INFO L82 PathProgramCache]: Analyzing trace with hash -611171137, now seen corresponding path program 1 times [2019-09-08 12:37:11,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:11,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:11,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:11,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:11,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:11,307 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 12:37:11,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:11,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:37:11,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:37:11,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:37:11,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:37:11,309 INFO L87 Difference]: Start difference. First operand 1971 states and 2825 transitions. Second operand 7 states. [2019-09-08 12:37:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:20,732 INFO L93 Difference]: Finished difference Result 9547 states and 13789 transitions. [2019-09-08 12:37:20,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:37:20,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-08 12:37:20,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:20,739 INFO L225 Difference]: With dead ends: 9547 [2019-09-08 12:37:20,739 INFO L226 Difference]: Without dead ends: 7689 [2019-09-08 12:37:20,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:37:20,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7689 states. [2019-09-08 12:37:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7689 to 4067. [2019-09-08 12:37:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4067 states. [2019-09-08 12:37:25,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4067 states to 4067 states and 5865 transitions. [2019-09-08 12:37:25,223 INFO L78 Accepts]: Start accepts. Automaton has 4067 states and 5865 transitions. Word has length 139 [2019-09-08 12:37:25,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:25,223 INFO L475 AbstractCegarLoop]: Abstraction has 4067 states and 5865 transitions. [2019-09-08 12:37:25,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:37:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 4067 states and 5865 transitions. [2019-09-08 12:37:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:37:25,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:25,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:25,225 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:25,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:25,226 INFO L82 PathProgramCache]: Analyzing trace with hash 379409209, now seen corresponding path program 1 times [2019-09-08 12:37:25,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:25,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:25,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:25,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:25,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:25,328 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 12:37:25,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:25,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:37:25,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:37:25,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:37:25,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:37:25,329 INFO L87 Difference]: Start difference. First operand 4067 states and 5865 transitions. Second operand 7 states. [2019-09-08 12:37:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:40,767 INFO L93 Difference]: Finished difference Result 17275 states and 25021 transitions. [2019-09-08 12:37:40,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:37:40,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-08 12:37:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:40,781 INFO L225 Difference]: With dead ends: 17275 [2019-09-08 12:37:40,781 INFO L226 Difference]: Without dead ends: 13321 [2019-09-08 12:37:40,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:37:40,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13321 states. [2019-09-08 12:37:50,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13321 to 8499. [2019-09-08 12:37:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8499 states. [2019-09-08 12:37:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8499 states to 8499 states and 12281 transitions. [2019-09-08 12:37:50,108 INFO L78 Accepts]: Start accepts. Automaton has 8499 states and 12281 transitions. Word has length 139 [2019-09-08 12:37:50,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:50,109 INFO L475 AbstractCegarLoop]: Abstraction has 8499 states and 12281 transitions. [2019-09-08 12:37:50,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:37:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand 8499 states and 12281 transitions. [2019-09-08 12:37:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:37:50,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:50,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:50,112 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:50,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:50,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2070402137, now seen corresponding path program 1 times [2019-09-08 12:37:50,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:50,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:50,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:50,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:50,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:50,248 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 12:37:50,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:50,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:37:50,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:37:50,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:37:50,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:37:50,249 INFO L87 Difference]: Start difference. First operand 8499 states and 12281 transitions. Second operand 7 states. [2019-09-08 12:38:17,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:17,925 INFO L93 Difference]: Finished difference Result 33009 states and 47834 transitions. [2019-09-08 12:38:17,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:38:17,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-08 12:38:17,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:17,950 INFO L225 Difference]: With dead ends: 33009 [2019-09-08 12:38:17,950 INFO L226 Difference]: Without dead ends: 24623 [2019-09-08 12:38:17,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:38:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24623 states. [2019-09-08 12:38:33,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24623 to 13827. [2019-09-08 12:38:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13827 states. [2019-09-08 12:38:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13827 states to 13827 states and 19993 transitions. [2019-09-08 12:38:33,124 INFO L78 Accepts]: Start accepts. Automaton has 13827 states and 19993 transitions. Word has length 139 [2019-09-08 12:38:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:33,124 INFO L475 AbstractCegarLoop]: Abstraction has 13827 states and 19993 transitions. [2019-09-08 12:38:33,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:38:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 13827 states and 19993 transitions. [2019-09-08 12:38:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 12:38:33,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:33,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:33,127 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:33,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:33,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1298539344, now seen corresponding path program 1 times [2019-09-08 12:38:33,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:33,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:33,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:33,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:33,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:33,234 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 12:38:33,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:33,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:38:33,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:38:33,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:38:33,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:38:33,235 INFO L87 Difference]: Start difference. First operand 13827 states and 19993 transitions. Second operand 7 states. [2019-09-08 12:39:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:07,534 INFO L93 Difference]: Finished difference Result 42667 states and 61533 transitions. [2019-09-08 12:39:07,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:39:07,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-09-08 12:39:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:07,563 INFO L225 Difference]: With dead ends: 42667 [2019-09-08 12:39:07,563 INFO L226 Difference]: Without dead ends: 28953 [2019-09-08 12:39:07,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:39:07,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28953 states. [2019-09-08 12:39:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28953 to 16019. [2019-09-08 12:39:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16019 states. [2019-09-08 12:39:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16019 states to 16019 states and 22969 transitions. [2019-09-08 12:39:25,335 INFO L78 Accepts]: Start accepts. Automaton has 16019 states and 22969 transitions. Word has length 140 [2019-09-08 12:39:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:25,335 INFO L475 AbstractCegarLoop]: Abstraction has 16019 states and 22969 transitions. [2019-09-08 12:39:25,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:39:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 16019 states and 22969 transitions. [2019-09-08 12:39:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 12:39:25,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:25,338 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:25,338 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:25,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:25,339 INFO L82 PathProgramCache]: Analyzing trace with hash -480913436, now seen corresponding path program 1 times [2019-09-08 12:39:25,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:25,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:25,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:25,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:25,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:25,396 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 12:39:25,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:25,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:39:25,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:39:25,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:39:25,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:39:25,398 INFO L87 Difference]: Start difference. First operand 16019 states and 22969 transitions. Second operand 3 states. [2019-09-08 12:39:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:45,326 INFO L93 Difference]: Finished difference Result 33591 states and 48187 transitions. [2019-09-08 12:39:45,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:39:45,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-08 12:39:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:45,345 INFO L225 Difference]: With dead ends: 33591 [2019-09-08 12:39:45,345 INFO L226 Difference]: Without dead ends: 17685 [2019-09-08 12:39:45,362 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 12:39:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17685 states. [2019-09-08 12:40:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17685 to 17491. [2019-09-08 12:40:05,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17491 states. [2019-09-08 12:40:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17491 states to 17491 states and 24921 transitions. [2019-09-08 12:40:05,541 INFO L78 Accepts]: Start accepts. Automaton has 17491 states and 24921 transitions. Word has length 140 [2019-09-08 12:40:05,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:05,542 INFO L475 AbstractCegarLoop]: Abstraction has 17491 states and 24921 transitions. [2019-09-08 12:40:05,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:40:05,542 INFO L276 IsEmpty]: Start isEmpty. Operand 17491 states and 24921 transitions. [2019-09-08 12:40:05,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 12:40:05,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:05,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:05,544 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:05,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:05,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1017549632, now seen corresponding path program 1 times [2019-09-08 12:40:05,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:05,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:05,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:05,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:05,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:05,639 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 12:40:05,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:05,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:40:05,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:40:05,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:40:05,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:40:05,641 INFO L87 Difference]: Start difference. First operand 17491 states and 24921 transitions. Second operand 6 states. [2019-09-08 12:40:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:38,316 INFO L93 Difference]: Finished difference Result 27931 states and 39272 transitions. [2019-09-08 12:40:38,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:40:38,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-08 12:40:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:38,343 INFO L225 Difference]: With dead ends: 27931 [2019-09-08 12:40:38,343 INFO L226 Difference]: Without dead ends: 27929 [2019-09-08 12:40:38,349 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 12:40:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27929 states. [2019-09-08 12:40:58,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27929 to 17683. [2019-09-08 12:40:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17683 states. [2019-09-08 12:40:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17683 states to 17683 states and 25049 transitions. [2019-09-08 12:40:58,454 INFO L78 Accepts]: Start accepts. Automaton has 17683 states and 25049 transitions. Word has length 140 [2019-09-08 12:40:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:58,454 INFO L475 AbstractCegarLoop]: Abstraction has 17683 states and 25049 transitions. [2019-09-08 12:40:58,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:40:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 17683 states and 25049 transitions. [2019-09-08 12:40:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:40:58,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:58,456 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:58,456 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:58,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:58,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1636521419, now seen corresponding path program 1 times [2019-09-08 12:40:58,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:58,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:58,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:58,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:58,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:58,520 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 12:40:58,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:58,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:40:58,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:40:58,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:40:58,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:40:58,521 INFO L87 Difference]: Start difference. First operand 17683 states and 25049 transitions. Second operand 3 states. [2019-09-08 12:41:18,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:18,893 INFO L93 Difference]: Finished difference Result 34295 states and 48539 transitions. [2019-09-08 12:41:18,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:18,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-08 12:41:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:18,909 INFO L225 Difference]: With dead ends: 34295 [2019-09-08 12:41:18,909 INFO L226 Difference]: Without dead ends: 16725 [2019-09-08 12:41:18,924 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 12:41:18,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16725 states. [2019-09-08 12:41:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16725 to 12691. [2019-09-08 12:41:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12691 states. [2019-09-08 12:41:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12691 states to 12691 states and 17777 transitions. [2019-09-08 12:41:33,870 INFO L78 Accepts]: Start accepts. Automaton has 12691 states and 17777 transitions. Word has length 141 [2019-09-08 12:41:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:33,870 INFO L475 AbstractCegarLoop]: Abstraction has 12691 states and 17777 transitions. [2019-09-08 12:41:33,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:41:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 12691 states and 17777 transitions. [2019-09-08 12:41:33,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:41:33,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:33,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:33,872 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:33,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:33,872 INFO L82 PathProgramCache]: Analyzing trace with hash -192422023, now seen corresponding path program 1 times [2019-09-08 12:41:33,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:33,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:33,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:33,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:33,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:33,942 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 12:41:33,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:33,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:41:33,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:41:33,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:41:33,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:33,943 INFO L87 Difference]: Start difference. First operand 12691 states and 17777 transitions. Second operand 3 states. [2019-09-08 12:41:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:59,664 INFO L93 Difference]: Finished difference Result 33359 states and 46899 transitions. [2019-09-08 12:41:59,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:59,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-08 12:41:59,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:59,685 INFO L225 Difference]: With dead ends: 33359 [2019-09-08 12:41:59,685 INFO L226 Difference]: Without dead ends: 20781 [2019-09-08 12:41:59,697 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 12:41:59,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20781 states. [2019-09-08 12:42:18,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20781 to 15163. [2019-09-08 12:42:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15163 states. [2019-09-08 12:42:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 21247 transitions. [2019-09-08 12:42:18,530 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 21247 transitions. Word has length 142 [2019-09-08 12:42:18,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:18,531 INFO L475 AbstractCegarLoop]: Abstraction has 15163 states and 21247 transitions. [2019-09-08 12:42:18,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:42:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 21247 transitions. [2019-09-08 12:42:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 12:42:18,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:18,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:18,532 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:18,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:18,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1192824300, now seen corresponding path program 1 times [2019-09-08 12:42:18,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:18,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:18,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:18,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:18,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:18,602 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 12:42:18,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:18,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:42:18,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:42:18,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:42:18,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:42:18,603 INFO L87 Difference]: Start difference. First operand 15163 states and 21247 transitions. Second operand 3 states. [2019-09-08 12:42:36,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:36,484 INFO L93 Difference]: Finished difference Result 29225 states and 40875 transitions. [2019-09-08 12:42:36,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:42:36,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-08 12:42:36,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:36,498 INFO L225 Difference]: With dead ends: 29225 [2019-09-08 12:42:36,498 INFO L226 Difference]: Without dead ends: 14175 [2019-09-08 12:42:36,511 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 12:42:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14175 states. [2019-09-08 12:42:54,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14175 to 13813. [2019-09-08 12:42:54,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13813 states. [2019-09-08 12:42:54,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13813 states to 13813 states and 19177 transitions. [2019-09-08 12:42:54,353 INFO L78 Accepts]: Start accepts. Automaton has 13813 states and 19177 transitions. Word has length 143 [2019-09-08 12:42:54,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:54,353 INFO L475 AbstractCegarLoop]: Abstraction has 13813 states and 19177 transitions. [2019-09-08 12:42:54,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:42:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 13813 states and 19177 transitions. [2019-09-08 12:42:54,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:42:54,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:54,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:54,354 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:54,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:54,354 INFO L82 PathProgramCache]: Analyzing trace with hash 195583495, now seen corresponding path program 1 times [2019-09-08 12:42:54,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:54,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:54,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:54,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:54,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:54,423 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 12:42:54,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:54,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:42:54,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:42:54,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:42:54,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:42:54,424 INFO L87 Difference]: Start difference. First operand 13813 states and 19177 transitions. Second operand 3 states. [2019-09-08 12:43:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:11,331 INFO L93 Difference]: Finished difference Result 26885 states and 37317 transitions. [2019-09-08 12:43:11,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:43:11,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-08 12:43:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:11,342 INFO L225 Difference]: With dead ends: 26885 [2019-09-08 12:43:11,342 INFO L226 Difference]: Without dead ends: 13185 [2019-09-08 12:43:11,350 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 12:43:11,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13185 states. [2019-09-08 12:43:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13185 to 13183. [2019-09-08 12:43:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13183 states. [2019-09-08 12:43:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13183 states to 13183 states and 18169 transitions. [2019-09-08 12:43:28,121 INFO L78 Accepts]: Start accepts. Automaton has 13183 states and 18169 transitions. Word has length 144 [2019-09-08 12:43:28,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:28,121 INFO L475 AbstractCegarLoop]: Abstraction has 13183 states and 18169 transitions. [2019-09-08 12:43:28,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:43:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 13183 states and 18169 transitions. [2019-09-08 12:43:28,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 12:43:28,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:28,124 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:28,124 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:28,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:28,125 INFO L82 PathProgramCache]: Analyzing trace with hash 523647650, now seen corresponding path program 1 times [2019-09-08 12:43:28,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:28,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:28,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:28,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:28,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:28,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:28,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:43:28,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:43:28,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:43:28,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:43:28,222 INFO L87 Difference]: Start difference. First operand 13183 states and 18169 transitions. Second operand 3 states. [2019-09-08 12:43:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:49,470 INFO L93 Difference]: Finished difference Result 29351 states and 40415 transitions. [2019-09-08 12:43:49,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:43:49,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 12:43:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:49,486 INFO L225 Difference]: With dead ends: 29351 [2019-09-08 12:43:49,486 INFO L226 Difference]: Without dead ends: 16281 [2019-09-08 12:43:49,496 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 12:43:49,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16281 states.