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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:54:48,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:54:48,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:54:48,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:54:48,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:54:48,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:54:48,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:54:48,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:54:48,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:54:48,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:54:48,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:54:48,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:54:48,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:54:48,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:54:48,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:54:48,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:54:48,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:54:48,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:54:48,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:54:48,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:54:48,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:54:48,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:54:48,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:54:48,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:54:48,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:54:48,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:54:48,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:54:48,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:54:48,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:54:48,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:54:48,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:54:48,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:54:48,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:54:48,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:54:48,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:54:48,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:54:48,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:54:48,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:54:48,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:54:48,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:54:48,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:54:48,748 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 10:54:48,785 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:54:48,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:54:48,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:54:48,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:54:48,787 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:54:48,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:54:48,787 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:54:48,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:54:48,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:54:48,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:54:48,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:54:48,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:54:48,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:54:48,789 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:54:48,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:54:48,789 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:54:48,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:54:48,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:54:48,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:54:48,790 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:54:48,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:54:48,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:54:48,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:54:48,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:54:48,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:54:48,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:54:48,791 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:54:48,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:54:48,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:54:48,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:54:48,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:54:48,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:54:48,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:54:48,861 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:54:48,861 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-08 10:54:48,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66bf9c351/b6f735da631146d6b59a9f1090599aec/FLAG10bf7d6e7 [2019-09-08 10:54:49,770 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:54:49,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-08 10:54:49,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66bf9c351/b6f735da631146d6b59a9f1090599aec/FLAG10bf7d6e7 [2019-09-08 10:54:50,239 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66bf9c351/b6f735da631146d6b59a9f1090599aec [2019-09-08 10:54:50,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:54:50,251 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:54:50,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:54:50,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:54:50,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:54:50,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:54:50" (1/1) ... [2019-09-08 10:54:50,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528fe240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:54:50, skipping insertion in model container [2019-09-08 10:54:50,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:54:50" (1/1) ... [2019-09-08 10:54:50,267 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:54:50,566 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:54:52,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:54:52,743 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:54:53,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:54:53,868 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:54:53,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:54:53 WrapperNode [2019-09-08 10:54:53,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:54:53,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:54:53,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:54:53,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:54:53,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:54:53" (1/1) ... [2019-09-08 10:54:53,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:54:53" (1/1) ... [2019-09-08 10:54:54,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:54:53" (1/1) ... [2019-09-08 10:54:54,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:54:53" (1/1) ... [2019-09-08 10:54:54,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:54:53" (1/1) ... [2019-09-08 10:54:54,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:54:53" (1/1) ... [2019-09-08 10:54:54,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:54:53" (1/1) ... [2019-09-08 10:54:54,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:54:54,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:54:54,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:54:54,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:54:54,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:54:53" (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 10:54:54,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:54:54,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:54:54,469 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:54:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:54:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:54:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:54:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:54:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:54:54,472 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:54:54,472 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:54:54,473 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:54:54,473 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:54:54,473 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:54:54,474 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:54:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:54:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:54:54,477 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:54:54,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:54:54,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:55:03,877 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:55:03,878 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:55:03,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:55:03 BoogieIcfgContainer [2019-09-08 10:55:03,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:55:03,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:55:03,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:55:03,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:55:03,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:54:50" (1/3) ... [2019-09-08 10:55:03,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a261e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:55:03, skipping insertion in model container [2019-09-08 10:55:03,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:54:53" (2/3) ... [2019-09-08 10:55:03,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a261e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:55:03, skipping insertion in model container [2019-09-08 10:55:03,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:55:03" (3/3) ... [2019-09-08 10:55:03,896 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-08 10:55:03,907 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:55:03,939 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-09-08 10:55:03,959 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-09-08 10:55:04,022 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:55:04,023 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:55:04,024 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:55:04,024 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:55:04,024 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:55:04,024 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:55:04,024 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:55:04,024 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:55:04,025 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:55:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3737 states. [2019-09-08 10:55:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:55:04,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:04,142 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:04,144 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:04,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:04,151 INFO L82 PathProgramCache]: Analyzing trace with hash 659156996, now seen corresponding path program 1 times [2019-09-08 10:55:04,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:04,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:04,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:04,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:04,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:05,031 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 10:55:05,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:05,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:55:05,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:55:05,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:55:05,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:55:05,058 INFO L87 Difference]: Start difference. First operand 3737 states. Second operand 5 states. [2019-09-08 10:55:10,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:10,759 INFO L93 Difference]: Finished difference Result 7031 states and 12209 transitions. [2019-09-08 10:55:10,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:55:10,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-08 10:55:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:10,812 INFO L225 Difference]: With dead ends: 7031 [2019-09-08 10:55:10,812 INFO L226 Difference]: Without dead ends: 4506 [2019-09-08 10:55:10,825 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 10:55:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4506 states. [2019-09-08 10:55:11,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4506 to 4481. [2019-09-08 10:55:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4481 states. [2019-09-08 10:55:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4481 states to 4481 states and 5810 transitions. [2019-09-08 10:55:11,114 INFO L78 Accepts]: Start accepts. Automaton has 4481 states and 5810 transitions. Word has length 69 [2019-09-08 10:55:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:11,115 INFO L475 AbstractCegarLoop]: Abstraction has 4481 states and 5810 transitions. [2019-09-08 10:55:11,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:55:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 4481 states and 5810 transitions. [2019-09-08 10:55:11,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:55:11,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:11,132 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:11,133 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:11,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:11,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1884466580, now seen corresponding path program 1 times [2019-09-08 10:55:11,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:11,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:11,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:11,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:11,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:11,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 10:55:11,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:11,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:55:11,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:55:11,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:55:11,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:55:11,558 INFO L87 Difference]: Start difference. First operand 4481 states and 5810 transitions. Second operand 6 states. [2019-09-08 10:55:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:14,916 INFO L93 Difference]: Finished difference Result 9128 states and 11844 transitions. [2019-09-08 10:55:14,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:55:14,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:55:14,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:14,963 INFO L225 Difference]: With dead ends: 9128 [2019-09-08 10:55:14,964 INFO L226 Difference]: Without dead ends: 5950 [2019-09-08 10:55:14,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:55:14,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2019-09-08 10:55:15,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 5918. [2019-09-08 10:55:15,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5918 states. [2019-09-08 10:55:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5918 states to 5918 states and 7728 transitions. [2019-09-08 10:55:15,288 INFO L78 Accepts]: Start accepts. Automaton has 5918 states and 7728 transitions. Word has length 70 [2019-09-08 10:55:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:15,289 INFO L475 AbstractCegarLoop]: Abstraction has 5918 states and 7728 transitions. [2019-09-08 10:55:15,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:55:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 5918 states and 7728 transitions. [2019-09-08 10:55:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:55:15,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:15,300 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:15,301 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:15,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:15,302 INFO L82 PathProgramCache]: Analyzing trace with hash 353186205, now seen corresponding path program 1 times [2019-09-08 10:55:15,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:15,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:15,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:15,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:15,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:15,630 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 10:55:15,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:15,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:55:15,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:55:15,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:55:15,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:55:15,632 INFO L87 Difference]: Start difference. First operand 5918 states and 7728 transitions. Second operand 6 states. [2019-09-08 10:55:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:18,722 INFO L93 Difference]: Finished difference Result 13667 states and 17880 transitions. [2019-09-08 10:55:18,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:55:18,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:55:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:18,771 INFO L225 Difference]: With dead ends: 13667 [2019-09-08 10:55:18,771 INFO L226 Difference]: Without dead ends: 9756 [2019-09-08 10:55:18,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:55:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9756 states. [2019-09-08 10:55:19,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9756 to 9711. [2019-09-08 10:55:19,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9711 states. [2019-09-08 10:55:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9711 states to 9711 states and 12741 transitions. [2019-09-08 10:55:19,205 INFO L78 Accepts]: Start accepts. Automaton has 9711 states and 12741 transitions. Word has length 70 [2019-09-08 10:55:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:19,206 INFO L475 AbstractCegarLoop]: Abstraction has 9711 states and 12741 transitions. [2019-09-08 10:55:19,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:55:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 9711 states and 12741 transitions. [2019-09-08 10:55:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:55:19,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:19,221 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:19,222 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:19,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:19,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1292285136, now seen corresponding path program 1 times [2019-09-08 10:55:19,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:19,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:19,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:19,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:19,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:19,577 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 10:55:19,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:19,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:55:19,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:55:19,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:55:19,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:55:19,581 INFO L87 Difference]: Start difference. First operand 9711 states and 12741 transitions. Second operand 6 states. [2019-09-08 10:55:22,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:22,177 INFO L93 Difference]: Finished difference Result 22490 states and 30021 transitions. [2019-09-08 10:55:22,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:55:22,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-08 10:55:22,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:22,249 INFO L225 Difference]: With dead ends: 22490 [2019-09-08 10:55:22,249 INFO L226 Difference]: Without dead ends: 16110 [2019-09-08 10:55:22,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:55:22,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16110 states. [2019-09-08 10:55:22,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16110 to 16060. [2019-09-08 10:55:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16060 states. [2019-09-08 10:55:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16060 states to 16060 states and 21465 transitions. [2019-09-08 10:55:22,970 INFO L78 Accepts]: Start accepts. Automaton has 16060 states and 21465 transitions. Word has length 71 [2019-09-08 10:55:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:22,971 INFO L475 AbstractCegarLoop]: Abstraction has 16060 states and 21465 transitions. [2019-09-08 10:55:22,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:55:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 16060 states and 21465 transitions. [2019-09-08 10:55:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:55:22,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:22,984 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:22,985 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:22,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:22,985 INFO L82 PathProgramCache]: Analyzing trace with hash 77939992, now seen corresponding path program 1 times [2019-09-08 10:55:22,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:22,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:22,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:22,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:22,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:23,288 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 10:55:23,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:23,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:55:23,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:55:23,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:55:23,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:55:23,290 INFO L87 Difference]: Start difference. First operand 16060 states and 21465 transitions. Second operand 9 states. [2019-09-08 10:55:32,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:32,900 INFO L93 Difference]: Finished difference Result 48148 states and 67965 transitions. [2019-09-08 10:55:32,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:55:32,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-08 10:55:32,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:33,008 INFO L225 Difference]: With dead ends: 48148 [2019-09-08 10:55:33,009 INFO L226 Difference]: Without dead ends: 43895 [2019-09-08 10:55:33,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:55:33,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43895 states. [2019-09-08 10:55:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43895 to 15971. [2019-09-08 10:55:33,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15971 states. [2019-09-08 10:55:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15971 states to 15971 states and 21344 transitions. [2019-09-08 10:55:33,867 INFO L78 Accepts]: Start accepts. Automaton has 15971 states and 21344 transitions. Word has length 72 [2019-09-08 10:55:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:33,867 INFO L475 AbstractCegarLoop]: Abstraction has 15971 states and 21344 transitions. [2019-09-08 10:55:33,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:55:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 15971 states and 21344 transitions. [2019-09-08 10:55:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:55:33,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:33,879 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:33,880 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:33,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:33,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1490375194, now seen corresponding path program 1 times [2019-09-08 10:55:33,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:33,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:33,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:33,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:33,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:34,341 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 10:55:34,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:34,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:55:34,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:55:34,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:55:34,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:55:34,343 INFO L87 Difference]: Start difference. First operand 15971 states and 21344 transitions. Second operand 8 states. [2019-09-08 10:55:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:40,516 INFO L93 Difference]: Finished difference Result 40755 states and 59035 transitions. [2019-09-08 10:55:40,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:55:40,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-09-08 10:55:40,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:40,601 INFO L225 Difference]: With dead ends: 40755 [2019-09-08 10:55:40,601 INFO L226 Difference]: Without dead ends: 36279 [2019-09-08 10:55:40,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:55:40,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36279 states. [2019-09-08 10:55:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36279 to 15698. [2019-09-08 10:55:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15698 states. [2019-09-08 10:55:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 20987 transitions. [2019-09-08 10:55:41,535 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 20987 transitions. Word has length 72 [2019-09-08 10:55:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:41,536 INFO L475 AbstractCegarLoop]: Abstraction has 15698 states and 20987 transitions. [2019-09-08 10:55:41,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:55:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 20987 transitions. [2019-09-08 10:55:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:55:41,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:41,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:41,547 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:41,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2027444782, now seen corresponding path program 1 times [2019-09-08 10:55:41,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:41,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:41,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:41,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:41,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:41,861 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 10:55:41,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:41,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:55:41,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:55:41,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:55:41,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:55:41,864 INFO L87 Difference]: Start difference. First operand 15698 states and 20987 transitions. Second operand 9 states. [2019-09-08 10:55:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:47,319 INFO L93 Difference]: Finished difference Result 21306 states and 29430 transitions. [2019-09-08 10:55:47,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:55:47,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 10:55:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:47,352 INFO L225 Difference]: With dead ends: 21306 [2019-09-08 10:55:47,353 INFO L226 Difference]: Without dead ends: 21300 [2019-09-08 10:55:47,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-09-08 10:55:47,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21300 states. [2019-09-08 10:55:48,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21300 to 15698. [2019-09-08 10:55:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15698 states. [2019-09-08 10:55:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 20986 transitions. [2019-09-08 10:55:48,038 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 20986 transitions. Word has length 73 [2019-09-08 10:55:48,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:48,039 INFO L475 AbstractCegarLoop]: Abstraction has 15698 states and 20986 transitions. [2019-09-08 10:55:48,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:55:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 20986 transitions. [2019-09-08 10:55:48,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:55:48,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:48,050 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:48,050 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:48,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:48,051 INFO L82 PathProgramCache]: Analyzing trace with hash 233124012, now seen corresponding path program 1 times [2019-09-08 10:55:48,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:48,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:48,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:48,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:48,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:48,316 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 10:55:48,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:48,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:55:48,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:55:48,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:55:48,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:55:48,319 INFO L87 Difference]: Start difference. First operand 15698 states and 20986 transitions. Second operand 9 states. [2019-09-08 10:55:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:54,910 INFO L93 Difference]: Finished difference Result 24314 states and 33923 transitions. [2019-09-08 10:55:54,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:55:54,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 10:55:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:54,944 INFO L225 Difference]: With dead ends: 24314 [2019-09-08 10:55:54,944 INFO L226 Difference]: Without dead ends: 24305 [2019-09-08 10:55:54,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:55:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24305 states. [2019-09-08 10:55:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24305 to 15698. [2019-09-08 10:55:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15698 states. [2019-09-08 10:55:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 20985 transitions. [2019-09-08 10:55:56,391 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 20985 transitions. Word has length 73 [2019-09-08 10:55:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:56,391 INFO L475 AbstractCegarLoop]: Abstraction has 15698 states and 20985 transitions. [2019-09-08 10:55:56,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:55:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 20985 transitions. [2019-09-08 10:55:56,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:55:56,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:56,401 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:56,402 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:56,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:56,402 INFO L82 PathProgramCache]: Analyzing trace with hash -2061206434, now seen corresponding path program 1 times [2019-09-08 10:55:56,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:56,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:56,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:56,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:56,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:56,947 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 10:55:56,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:56,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:55:56,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:55:56,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:55:56,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:55:56,949 INFO L87 Difference]: Start difference. First operand 15698 states and 20985 transitions. Second operand 13 states. [2019-09-08 10:55:57,079 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-09-08 10:55:57,629 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 10:55:57,856 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 10:55:58,103 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 10:55:59,661 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 10:56:00,553 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 10:56:01,053 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-08 10:56:07,142 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-08 10:56:07,942 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-08 10:56:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:14,179 INFO L93 Difference]: Finished difference Result 89814 states and 132877 transitions. [2019-09-08 10:56:14,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 10:56:14,179 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2019-09-08 10:56:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:14,281 INFO L225 Difference]: With dead ends: 89814 [2019-09-08 10:56:14,281 INFO L226 Difference]: Without dead ends: 89810 [2019-09-08 10:56:14,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 10:56:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89810 states. [2019-09-08 10:56:15,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89810 to 15694. [2019-09-08 10:56:15,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15694 states. [2019-09-08 10:56:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15694 states to 15694 states and 20981 transitions. [2019-09-08 10:56:15,749 INFO L78 Accepts]: Start accepts. Automaton has 15694 states and 20981 transitions. Word has length 73 [2019-09-08 10:56:15,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:15,749 INFO L475 AbstractCegarLoop]: Abstraction has 15694 states and 20981 transitions. [2019-09-08 10:56:15,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:56:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 15694 states and 20981 transitions. [2019-09-08 10:56:15,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:56:15,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:15,756 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:56:15,757 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:15,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash -993343041, now seen corresponding path program 1 times [2019-09-08 10:56:15,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:15,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:15,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:15,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:15,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:16,311 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 10:56:16,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:16,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:56:16,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:56:16,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:56:16,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:56:16,315 INFO L87 Difference]: Start difference. First operand 15694 states and 20981 transitions. Second operand 12 states. [2019-09-08 10:56:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:27,796 INFO L93 Difference]: Finished difference Result 61464 states and 90415 transitions. [2019-09-08 10:56:27,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:56:27,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-08 10:56:27,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:27,877 INFO L225 Difference]: With dead ends: 61464 [2019-09-08 10:56:27,877 INFO L226 Difference]: Without dead ends: 57212 [2019-09-08 10:56:27,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:56:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57212 states. [2019-09-08 10:56:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57212 to 15602. [2019-09-08 10:56:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15602 states. [2019-09-08 10:56:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15602 states to 15602 states and 20852 transitions. [2019-09-08 10:56:29,407 INFO L78 Accepts]: Start accepts. Automaton has 15602 states and 20852 transitions. Word has length 73 [2019-09-08 10:56:29,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:29,407 INFO L475 AbstractCegarLoop]: Abstraction has 15602 states and 20852 transitions. [2019-09-08 10:56:29,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:56:29,407 INFO L276 IsEmpty]: Start isEmpty. Operand 15602 states and 20852 transitions. [2019-09-08 10:56:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:56:29,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:29,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:56:29,415 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:29,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:29,415 INFO L82 PathProgramCache]: Analyzing trace with hash -20725892, now seen corresponding path program 1 times [2019-09-08 10:56:29,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:29,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:29,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:29,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:29,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:30,122 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 10:56:30,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:30,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:56:30,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:56:30,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:56:30,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:56:30,124 INFO L87 Difference]: Start difference. First operand 15602 states and 20852 transitions. Second operand 12 states. [2019-09-08 10:56:42,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:42,821 INFO L93 Difference]: Finished difference Result 61634 states and 90642 transitions. [2019-09-08 10:56:42,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:56:42,822 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-08 10:56:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:42,890 INFO L225 Difference]: With dead ends: 61634 [2019-09-08 10:56:42,890 INFO L226 Difference]: Without dead ends: 61625 [2019-09-08 10:56:42,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:56:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61625 states. [2019-09-08 10:56:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61625 to 15593. [2019-09-08 10:56:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15593 states. [2019-09-08 10:56:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15593 states to 15593 states and 20842 transitions. [2019-09-08 10:56:44,628 INFO L78 Accepts]: Start accepts. Automaton has 15593 states and 20842 transitions. Word has length 74 [2019-09-08 10:56:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:44,629 INFO L475 AbstractCegarLoop]: Abstraction has 15593 states and 20842 transitions. [2019-09-08 10:56:44,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:56:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 15593 states and 20842 transitions. [2019-09-08 10:56:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:56:44,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:44,637 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:56:44,637 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:44,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:44,638 INFO L82 PathProgramCache]: Analyzing trace with hash 538122635, now seen corresponding path program 1 times [2019-09-08 10:56:44,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:44,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:44,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:44,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:44,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:45,135 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 10:56:45,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:45,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:56:45,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:56:45,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:56:45,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:56:45,139 INFO L87 Difference]: Start difference. First operand 15593 states and 20842 transitions. Second operand 10 states. [2019-09-08 10:56:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:58,736 INFO L93 Difference]: Finished difference Result 61741 states and 90762 transitions. [2019-09-08 10:56:58,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:56:58,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-09-08 10:56:58,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:58,799 INFO L225 Difference]: With dead ends: 61741 [2019-09-08 10:56:58,799 INFO L226 Difference]: Without dead ends: 57373 [2019-09-08 10:56:58,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2019-09-08 10:56:58,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57373 states. [2019-09-08 10:57:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57373 to 15540. [2019-09-08 10:57:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15540 states. [2019-09-08 10:57:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15540 states to 15540 states and 20781 transitions. [2019-09-08 10:57:00,719 INFO L78 Accepts]: Start accepts. Automaton has 15540 states and 20781 transitions. Word has length 74 [2019-09-08 10:57:00,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:00,719 INFO L475 AbstractCegarLoop]: Abstraction has 15540 states and 20781 transitions. [2019-09-08 10:57:00,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:57:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 15540 states and 20781 transitions. [2019-09-08 10:57:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:57:00,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:00,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:57:00,728 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:00,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:00,728 INFO L82 PathProgramCache]: Analyzing trace with hash -150966617, now seen corresponding path program 1 times [2019-09-08 10:57:00,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:00,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:00,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:00,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:00,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:00,882 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 10:57:00,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:00,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:57:00,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:57:00,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:57:00,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:57:00,884 INFO L87 Difference]: Start difference. First operand 15540 states and 20781 transitions. Second operand 3 states. [2019-09-08 10:57:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:03,664 INFO L93 Difference]: Finished difference Result 23749 states and 32922 transitions. [2019-09-08 10:57:03,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:57:03,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:57:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:03,688 INFO L225 Difference]: With dead ends: 23749 [2019-09-08 10:57:03,688 INFO L226 Difference]: Without dead ends: 14583 [2019-09-08 10:57:03,705 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 10:57:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14583 states. [2019-09-08 10:57:05,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14583 to 14564. [2019-09-08 10:57:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14564 states. [2019-09-08 10:57:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14564 states to 14564 states and 20144 transitions. [2019-09-08 10:57:05,935 INFO L78 Accepts]: Start accepts. Automaton has 14564 states and 20144 transitions. Word has length 74 [2019-09-08 10:57:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:05,935 INFO L475 AbstractCegarLoop]: Abstraction has 14564 states and 20144 transitions. [2019-09-08 10:57:05,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:57:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 14564 states and 20144 transitions. [2019-09-08 10:57:05,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:57:05,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:05,942 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] [2019-09-08 10:57:05,942 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:05,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2076823766, now seen corresponding path program 1 times [2019-09-08 10:57:05,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:05,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:05,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:05,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:05,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:06,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 10:57:06,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:06,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:57:06,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:57:06,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:57:06,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:57:06,201 INFO L87 Difference]: Start difference. First operand 14564 states and 20144 transitions. Second operand 9 states. [2019-09-08 10:57:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:23,788 INFO L93 Difference]: Finished difference Result 62665 states and 90778 transitions. [2019-09-08 10:57:23,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:57:23,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 10:57:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:23,853 INFO L225 Difference]: With dead ends: 62665 [2019-09-08 10:57:23,853 INFO L226 Difference]: Without dead ends: 55347 [2019-09-08 10:57:23,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:57:23,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55347 states. [2019-09-08 10:57:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55347 to 14564. [2019-09-08 10:57:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14564 states. [2019-09-08 10:57:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14564 states to 14564 states and 20142 transitions. [2019-09-08 10:57:26,487 INFO L78 Accepts]: Start accepts. Automaton has 14564 states and 20142 transitions. Word has length 75 [2019-09-08 10:57:26,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:26,487 INFO L475 AbstractCegarLoop]: Abstraction has 14564 states and 20142 transitions. [2019-09-08 10:57:26,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:57:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 14564 states and 20142 transitions. [2019-09-08 10:57:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:57:26,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:26,494 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] [2019-09-08 10:57:26,494 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:26,495 INFO L82 PathProgramCache]: Analyzing trace with hash -68973770, now seen corresponding path program 1 times [2019-09-08 10:57:26,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:26,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:26,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:26,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:26,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:26,748 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 10:57:26,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:26,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:57:26,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:57:26,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:57:26,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:57:26,750 INFO L87 Difference]: Start difference. First operand 14564 states and 20142 transitions. Second operand 8 states. [2019-09-08 10:57:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:41,188 INFO L93 Difference]: Finished difference Result 56098 states and 83043 transitions. [2019-09-08 10:57:41,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:57:41,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2019-09-08 10:57:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:41,243 INFO L225 Difference]: With dead ends: 56098 [2019-09-08 10:57:41,243 INFO L226 Difference]: Without dead ends: 48428 [2019-09-08 10:57:41,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:57:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48428 states. [2019-09-08 10:57:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48428 to 14564. [2019-09-08 10:57:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14564 states. [2019-09-08 10:57:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14564 states to 14564 states and 20141 transitions. [2019-09-08 10:57:43,886 INFO L78 Accepts]: Start accepts. Automaton has 14564 states and 20141 transitions. Word has length 75 [2019-09-08 10:57:43,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:43,887 INFO L475 AbstractCegarLoop]: Abstraction has 14564 states and 20141 transitions. [2019-09-08 10:57:43,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:57:43,887 INFO L276 IsEmpty]: Start isEmpty. Operand 14564 states and 20141 transitions. [2019-09-08 10:57:43,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:57:43,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:43,892 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] [2019-09-08 10:57:43,893 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:43,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:43,893 INFO L82 PathProgramCache]: Analyzing trace with hash 537217189, now seen corresponding path program 1 times [2019-09-08 10:57:43,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:43,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:43,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:43,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:43,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:44,128 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 10:57:44,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:44,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:57:44,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:57:44,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:57:44,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:57:44,132 INFO L87 Difference]: Start difference. First operand 14564 states and 20141 transitions. Second operand 9 states. [2019-09-08 10:58:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:02,272 INFO L93 Difference]: Finished difference Result 62315 states and 90320 transitions. [2019-09-08 10:58:02,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:58:02,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 10:58:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:02,337 INFO L225 Difference]: With dead ends: 62315 [2019-09-08 10:58:02,337 INFO L226 Difference]: Without dead ends: 55347 [2019-09-08 10:58:02,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:58:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55347 states. [2019-09-08 10:58:05,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55347 to 14564. [2019-09-08 10:58:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14564 states. [2019-09-08 10:58:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14564 states to 14564 states and 20140 transitions. [2019-09-08 10:58:05,136 INFO L78 Accepts]: Start accepts. Automaton has 14564 states and 20140 transitions. Word has length 75 [2019-09-08 10:58:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:05,137 INFO L475 AbstractCegarLoop]: Abstraction has 14564 states and 20140 transitions. [2019-09-08 10:58:05,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:58:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 14564 states and 20140 transitions. [2019-09-08 10:58:05,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:58:05,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:05,141 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] [2019-09-08 10:58:05,142 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:05,142 INFO L82 PathProgramCache]: Analyzing trace with hash 886824694, now seen corresponding path program 1 times [2019-09-08 10:58:05,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:05,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:05,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:05,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:05,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:05,392 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 10:58:05,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:05,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:58:05,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:58:05,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:58:05,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:58:05,394 INFO L87 Difference]: Start difference. First operand 14564 states and 20140 transitions. Second operand 9 states. [2019-09-08 10:58:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:22,728 INFO L93 Difference]: Finished difference Result 55880 states and 82649 transitions. [2019-09-08 10:58:22,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:58:22,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 10:58:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:22,792 INFO L225 Difference]: With dead ends: 55880 [2019-09-08 10:58:22,792 INFO L226 Difference]: Without dead ends: 48999 [2019-09-08 10:58:22,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:58:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48999 states. [2019-09-08 10:58:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48999 to 14564. [2019-09-08 10:58:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14564 states. [2019-09-08 10:58:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14564 states to 14564 states and 20139 transitions. [2019-09-08 10:58:25,556 INFO L78 Accepts]: Start accepts. Automaton has 14564 states and 20139 transitions. Word has length 75 [2019-09-08 10:58:25,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:25,556 INFO L475 AbstractCegarLoop]: Abstraction has 14564 states and 20139 transitions. [2019-09-08 10:58:25,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:58:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand 14564 states and 20139 transitions. [2019-09-08 10:58:25,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:58:25,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:25,561 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] [2019-09-08 10:58:25,561 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:25,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:25,562 INFO L82 PathProgramCache]: Analyzing trace with hash -553258111, now seen corresponding path program 1 times [2019-09-08 10:58:25,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:25,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:25,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:25,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:25,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:25,695 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 10:58:25,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:25,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:58:25,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:58:25,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:58:25,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:58:25,697 INFO L87 Difference]: Start difference. First operand 14564 states and 20139 transitions. Second operand 3 states. [2019-09-08 10:58:29,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:29,644 INFO L93 Difference]: Finished difference Result 27357 states and 39125 transitions. [2019-09-08 10:58:29,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:58:29,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:58:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:29,662 INFO L225 Difference]: With dead ends: 27357 [2019-09-08 10:58:29,663 INFO L226 Difference]: Without dead ends: 16782 [2019-09-08 10:58:29,673 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 10:58:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16782 states. [2019-09-08 10:58:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16782 to 16774. [2019-09-08 10:58:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16774 states. [2019-09-08 10:58:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16774 states to 16774 states and 23966 transitions. [2019-09-08 10:58:33,410 INFO L78 Accepts]: Start accepts. Automaton has 16774 states and 23966 transitions. Word has length 75 [2019-09-08 10:58:33,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:33,411 INFO L475 AbstractCegarLoop]: Abstraction has 16774 states and 23966 transitions. [2019-09-08 10:58:33,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:58:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 16774 states and 23966 transitions. [2019-09-08 10:58:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:58:33,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:33,415 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] [2019-09-08 10:58:33,415 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:33,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:33,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2136318529, now seen corresponding path program 1 times [2019-09-08 10:58:33,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:33,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:33,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:33,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:33,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:33,565 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 10:58:33,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:33,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:58:33,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:58:33,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:58:33,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:58:33,566 INFO L87 Difference]: Start difference. First operand 16774 states and 23966 transitions. Second operand 3 states. [2019-09-08 10:58:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:40,965 INFO L93 Difference]: Finished difference Result 40684 states and 59253 transitions. [2019-09-08 10:58:40,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:58:40,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:58:40,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:40,993 INFO L225 Difference]: With dead ends: 40684 [2019-09-08 10:58:40,993 INFO L226 Difference]: Without dead ends: 27400 [2019-09-08 10:58:41,005 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 10:58:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27400 states. [2019-09-08 10:58:48,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27400 to 27392. [2019-09-08 10:58:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27392 states. [2019-09-08 10:58:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27392 states to 27392 states and 39192 transitions. [2019-09-08 10:58:48,651 INFO L78 Accepts]: Start accepts. Automaton has 27392 states and 39192 transitions. Word has length 76 [2019-09-08 10:58:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:48,652 INFO L475 AbstractCegarLoop]: Abstraction has 27392 states and 39192 transitions. [2019-09-08 10:58:48,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:58:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 27392 states and 39192 transitions. [2019-09-08 10:58:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:58:48,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:48,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] [2019-09-08 10:58:48,657 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:48,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:48,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1610299721, now seen corresponding path program 1 times [2019-09-08 10:58:48,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:48,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:48,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:48,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:48,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:48,796 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 10:58:48,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:48,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:58:48,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:58:48,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:58:48,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:58:48,798 INFO L87 Difference]: Start difference. First operand 27392 states and 39192 transitions. Second operand 3 states. [2019-09-08 10:59:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:01,276 INFO L93 Difference]: Finished difference Result 69077 states and 100750 transitions. [2019-09-08 10:59:01,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:59:01,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:59:01,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:01,330 INFO L225 Difference]: With dead ends: 69077 [2019-09-08 10:59:01,330 INFO L226 Difference]: Without dead ends: 46977 [2019-09-08 10:59:01,357 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 10:59:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46977 states. [2019-09-08 10:59:12,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46977 to 40251. [2019-09-08 10:59:12,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40251 states. [2019-09-08 10:59:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40251 states to 40251 states and 57455 transitions. [2019-09-08 10:59:12,824 INFO L78 Accepts]: Start accepts. Automaton has 40251 states and 57455 transitions. Word has length 76 [2019-09-08 10:59:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:12,825 INFO L475 AbstractCegarLoop]: Abstraction has 40251 states and 57455 transitions. [2019-09-08 10:59:12,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:59:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 40251 states and 57455 transitions. [2019-09-08 10:59:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:59:12,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:12,830 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] [2019-09-08 10:59:12,830 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:12,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:12,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1479085215, now seen corresponding path program 1 times [2019-09-08 10:59:12,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:12,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:12,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:12,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:12,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:12,981 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 10:59:12,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:12,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:59:12,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:59:12,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:59:12,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:59:12,983 INFO L87 Difference]: Start difference. First operand 40251 states and 57455 transitions. Second operand 3 states. [2019-09-08 10:59:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:35,564 INFO L93 Difference]: Finished difference Result 101361 states and 147760 transitions. [2019-09-08 10:59:35,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:59:35,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:59:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:35,648 INFO L225 Difference]: With dead ends: 101361 [2019-09-08 10:59:35,648 INFO L226 Difference]: Without dead ends: 67667 [2019-09-08 10:59:35,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 10:59:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67667 states. [2019-09-08 10:59:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67667 to 48575. [2019-09-08 10:59:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48575 states. [2019-09-08 10:59:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48575 states to 48575 states and 69353 transitions. [2019-09-08 10:59:52,985 INFO L78 Accepts]: Start accepts. Automaton has 48575 states and 69353 transitions. Word has length 76 [2019-09-08 10:59:52,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:52,986 INFO L475 AbstractCegarLoop]: Abstraction has 48575 states and 69353 transitions. [2019-09-08 10:59:52,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:59:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 48575 states and 69353 transitions. [2019-09-08 10:59:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:59:52,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:52,991 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] [2019-09-08 10:59:52,991 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:52,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:52,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1487016584, now seen corresponding path program 1 times [2019-09-08 10:59:52,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:52,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:52,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:52,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:52,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:53,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 10:59:53,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:53,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:59:53,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:59:53,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:59:53,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:59:53,235 INFO L87 Difference]: Start difference. First operand 48575 states and 69353 transitions. Second operand 9 states. [2019-09-08 11:00:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:41,046 INFO L93 Difference]: Finished difference Result 109006 states and 157144 transitions. [2019-09-08 11:00:41,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:00:41,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-09-08 11:00:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:41,192 INFO L225 Difference]: With dead ends: 109006 [2019-09-08 11:00:41,192 INFO L226 Difference]: Without dead ends: 107703 [2019-09-08 11:00:41,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:00:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107703 states. [2019-09-08 11:01:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107703 to 48570. [2019-09-08 11:01:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48570 states. [2019-09-08 11:01:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48570 states to 48570 states and 69344 transitions. [2019-09-08 11:01:00,739 INFO L78 Accepts]: Start accepts. Automaton has 48570 states and 69344 transitions. Word has length 77 [2019-09-08 11:01:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:00,740 INFO L475 AbstractCegarLoop]: Abstraction has 48570 states and 69344 transitions. [2019-09-08 11:01:00,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:01:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 48570 states and 69344 transitions. [2019-09-08 11:01:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:01:00,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:00,745 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] [2019-09-08 11:01:00,746 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:00,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:00,746 INFO L82 PathProgramCache]: Analyzing trace with hash -622390050, now seen corresponding path program 1 times [2019-09-08 11:01:00,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:00,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:00,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:00,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:00,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:00,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:00,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:01:00,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:01:00,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:01:00,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:00,883 INFO L87 Difference]: Start difference. First operand 48570 states and 69344 transitions. Second operand 3 states. [2019-09-08 11:01:32,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:32,845 INFO L93 Difference]: Finished difference Result 126135 states and 182332 transitions. [2019-09-08 11:01:32,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:01:32,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 11:01:32,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:32,942 INFO L225 Difference]: With dead ends: 126135 [2019-09-08 11:01:32,942 INFO L226 Difference]: Without dead ends: 79658 [2019-09-08 11:01:32,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:33,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79658 states. [2019-09-08 11:01:58,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79658 to 62138. [2019-09-08 11:01:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62138 states. [2019-09-08 11:01:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62138 states to 62138 states and 89664 transitions. [2019-09-08 11:01:58,156 INFO L78 Accepts]: Start accepts. Automaton has 62138 states and 89664 transitions. Word has length 77 [2019-09-08 11:01:58,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:58,156 INFO L475 AbstractCegarLoop]: Abstraction has 62138 states and 89664 transitions. [2019-09-08 11:01:58,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:01:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand 62138 states and 89664 transitions. [2019-09-08 11:01:58,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:01:58,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:58,161 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] [2019-09-08 11:01:58,162 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:58,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:58,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1208905319, now seen corresponding path program 1 times [2019-09-08 11:01:58,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:58,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:58,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:58,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:58,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:58,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:58,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:01:58,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:01:58,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:01:58,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:58,294 INFO L87 Difference]: Start difference. First operand 62138 states and 89664 transitions. Second operand 3 states. [2019-09-08 11:02:27,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:27,856 INFO L93 Difference]: Finished difference Result 135149 states and 195763 transitions. [2019-09-08 11:02:27,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:27,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 11:02:27,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:27,959 INFO L225 Difference]: With dead ends: 135149 [2019-09-08 11:02:27,959 INFO L226 Difference]: Without dead ends: 74399 [2019-09-08 11:02:28,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74399 states. [2019-09-08 11:02:52,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74399 to 59195. [2019-09-08 11:02:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59195 states. [2019-09-08 11:02:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59195 states to 59195 states and 85757 transitions. [2019-09-08 11:02:52,863 INFO L78 Accepts]: Start accepts. Automaton has 59195 states and 85757 transitions. Word has length 77 [2019-09-08 11:02:52,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:52,863 INFO L475 AbstractCegarLoop]: Abstraction has 59195 states and 85757 transitions. [2019-09-08 11:02:52,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 59195 states and 85757 transitions. [2019-09-08 11:02:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:02:52,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:52,866 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] [2019-09-08 11:02:52,866 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:52,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:52,867 INFO L82 PathProgramCache]: Analyzing trace with hash 623453508, now seen corresponding path program 1 times [2019-09-08 11:02:52,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:52,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:52,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:52,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:52,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:02:53,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:53,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:02:53,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:02:53,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:02:53,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:02:53,108 INFO L87 Difference]: Start difference. First operand 59195 states and 85757 transitions. Second operand 9 states. [2019-09-08 11:03:53,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:53,485 INFO L93 Difference]: Finished difference Result 139164 states and 201865 transitions. [2019-09-08 11:03:53,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:03:53,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-08 11:03:53,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:53,716 INFO L225 Difference]: With dead ends: 139164 [2019-09-08 11:03:53,716 INFO L226 Difference]: Without dead ends: 137812 [2019-09-08 11:03:53,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:03:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137812 states. [2019-09-08 11:04:19,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137812 to 59195. [2019-09-08 11:04:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59195 states. [2019-09-08 11:04:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59195 states to 59195 states and 85755 transitions. [2019-09-08 11:04:19,627 INFO L78 Accepts]: Start accepts. Automaton has 59195 states and 85755 transitions. Word has length 78 [2019-09-08 11:04:19,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:19,627 INFO L475 AbstractCegarLoop]: Abstraction has 59195 states and 85755 transitions. [2019-09-08 11:04:19,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:04:19,628 INFO L276 IsEmpty]: Start isEmpty. Operand 59195 states and 85755 transitions. [2019-09-08 11:04:19,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:04:19,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:19,630 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] [2019-09-08 11:04:19,631 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:19,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:19,631 INFO L82 PathProgramCache]: Analyzing trace with hash 858175544, now seen corresponding path program 1 times [2019-09-08 11:04:19,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:19,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:19,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:19,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:19,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:19,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:19,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:04:19,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:04:19,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:04:19,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:04:19,872 INFO L87 Difference]: Start difference. First operand 59195 states and 85755 transitions. Second operand 9 states. [2019-09-08 11:05:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:21,724 INFO L93 Difference]: Finished difference Result 139104 states and 201795 transitions. [2019-09-08 11:05:21,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:05:21,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-08 11:05:21,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:21,896 INFO L225 Difference]: With dead ends: 139104 [2019-09-08 11:05:21,896 INFO L226 Difference]: Without dead ends: 137796 [2019-09-08 11:05:21,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:05:22,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137796 states. [2019-09-08 11:05:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137796 to 59195. [2019-09-08 11:05:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59195 states. [2019-09-08 11:05:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59195 states to 59195 states and 85753 transitions. [2019-09-08 11:05:47,973 INFO L78 Accepts]: Start accepts. Automaton has 59195 states and 85753 transitions. Word has length 78 [2019-09-08 11:05:47,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:47,973 INFO L475 AbstractCegarLoop]: Abstraction has 59195 states and 85753 transitions. [2019-09-08 11:05:47,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:05:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 59195 states and 85753 transitions. [2019-09-08 11:05:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:05:47,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:47,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] [2019-09-08 11:05:47,977 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:47,977 INFO L82 PathProgramCache]: Analyzing trace with hash 138734116, now seen corresponding path program 1 times [2019-09-08 11:05:47,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:47,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:47,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:47,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:47,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:05:48,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:48,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:05:48,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:05:48,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:05:48,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:05:48,204 INFO L87 Difference]: Start difference. First operand 59195 states and 85753 transitions. Second operand 9 states. [2019-09-08 11:06:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:51,238 INFO L93 Difference]: Finished difference Result 139104 states and 201793 transitions. [2019-09-08 11:06:51,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:06:51,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-08 11:06:51,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:51,419 INFO L225 Difference]: With dead ends: 139104 [2019-09-08 11:06:51,419 INFO L226 Difference]: Without dead ends: 137796 [2019-09-08 11:06:51,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:06:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137796 states. [2019-09-08 11:07:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137796 to 59195. [2019-09-08 11:07:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59195 states. [2019-09-08 11:07:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59195 states to 59195 states and 85751 transitions. [2019-09-08 11:07:15,453 INFO L78 Accepts]: Start accepts. Automaton has 59195 states and 85751 transitions. Word has length 78 [2019-09-08 11:07:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:15,453 INFO L475 AbstractCegarLoop]: Abstraction has 59195 states and 85751 transitions. [2019-09-08 11:07:15,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:07:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 59195 states and 85751 transitions. [2019-09-08 11:07:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:07:15,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:15,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] [2019-09-08 11:07:15,457 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:15,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:15,457 INFO L82 PathProgramCache]: Analyzing trace with hash 960156932, now seen corresponding path program 1 times [2019-09-08 11:07:15,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:15,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:15,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:15,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:15,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:07:15,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:15,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:07:15,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:07:15,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:07:15,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:07:15,670 INFO L87 Difference]: Start difference. First operand 59195 states and 85751 transitions. Second operand 9 states.