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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:45:23,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:45:23,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:45:23,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:45:23,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:45:23,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:45:23,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:45:23,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:45:23,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:45:23,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:45:23,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:45:23,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:45:23,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:45:23,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:45:23,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:45:23,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:45:23,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:45:23,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:45:23,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:45:23,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:45:23,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:45:23,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:45:23,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:45:23,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:45:23,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:45:23,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:45:23,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:45:23,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:45:23,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:45:23,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:45:23,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:45:23,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:45:23,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:45:23,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:45:23,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:45:23,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:45:23,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:45:23,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:45:23,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:45:23,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:45:23,709 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:45:23,710 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:45:23,724 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:45:23,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:45:23,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:45:23,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:45:23,726 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:45:23,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:45:23,726 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:45:23,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:45:23,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:45:23,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:45:23,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:45:23,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:45:23,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:45:23,728 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:45:23,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:45:23,728 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:45:23,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:45:23,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:45:23,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:45:23,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:45:23,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:45:23,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:45:23,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:45:23,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:45:23,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:45:23,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:45:23,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:45:23,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:45:23,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:45:23,759 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:45:23,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:45:23,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:45:23,776 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:45:23,776 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:45:23,777 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c [2019-09-08 12:45:23,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd302e1a/1ec3d2646ad44a599b3332d067447abc/FLAGbc1ef7a99 [2019-09-08 12:45:24,813 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:45:24,816 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c [2019-09-08 12:45:24,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd302e1a/1ec3d2646ad44a599b3332d067447abc/FLAGbc1ef7a99 [2019-09-08 12:45:25,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd302e1a/1ec3d2646ad44a599b3332d067447abc [2019-09-08 12:45:25,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:45:25,224 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:45:25,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:45:25,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:45:25,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:45:25,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:45:25" (1/1) ... [2019-09-08 12:45:25,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ecc103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:25, skipping insertion in model container [2019-09-08 12:45:25,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:45:25" (1/1) ... [2019-09-08 12:45:25,241 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:45:25,696 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:45:29,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:45:29,753 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:45:32,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:45:32,436 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:45:32,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:32 WrapperNode [2019-09-08 12:45:32,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:45:32,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:45:32,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:45:32,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:45:32,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:32" (1/1) ... [2019-09-08 12:45:32,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:32" (1/1) ... [2019-09-08 12:45:32,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:32" (1/1) ... [2019-09-08 12:45:32,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:32" (1/1) ... [2019-09-08 12:45:32,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:32" (1/1) ... [2019-09-08 12:45:32,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:32" (1/1) ... [2019-09-08 12:45:32,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:32" (1/1) ... [2019-09-08 12:45:32,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:45:32,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:45:32,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:45:32,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:45:32,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:45:33,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:45:33,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:45:33,054 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:45:33,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:45:33,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:45:33,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:45:33,056 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:45:33,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:45:33,056 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:45:33,056 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:45:33,057 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:45:33,057 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:45:33,057 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:45:33,058 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:45:33,058 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:45:33,059 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:45:33,060 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:45:33,061 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-08 12:45:33,061 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:45:33,061 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:45:33,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:45:33,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:45:33,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:45:43,761 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:45:43,762 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:45:43,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:45:43 BoogieIcfgContainer [2019-09-08 12:45:43,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:45:43,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:45:43,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:45:43,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:45:43,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:45:25" (1/3) ... [2019-09-08 12:45:43,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6b10e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:45:43, skipping insertion in model container [2019-09-08 12:45:43,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:32" (2/3) ... [2019-09-08 12:45:43,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6b10e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:45:43, skipping insertion in model container [2019-09-08 12:45:43,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:45:43" (3/3) ... [2019-09-08 12:45:43,775 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c [2019-09-08 12:45:43,786 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:45:43,798 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-09-08 12:45:43,825 INFO L252 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-09-08 12:45:43,894 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:45:43,895 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:45:43,895 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:45:43,895 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:45:43,895 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:45:43,896 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:45:43,896 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:45:43,896 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:45:43,896 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:45:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states. [2019-09-08 12:45:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:45:44,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:44,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:44,039 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:44,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:44,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2089593706, now seen corresponding path program 1 times [2019-09-08 12:45:44,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:44,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:44,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:44,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:44,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:45,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:45,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:45,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:45,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:45,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:45,280 INFO L87 Difference]: Start difference. First operand 3898 states. Second operand 5 states. [2019-09-08 12:45:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:49,213 INFO L93 Difference]: Finished difference Result 6704 states and 11863 transitions. [2019-09-08 12:45:49,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:49,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-08 12:45:49,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:49,269 INFO L225 Difference]: With dead ends: 6704 [2019-09-08 12:45:49,271 INFO L226 Difference]: Without dead ends: 3887 [2019-09-08 12:45:49,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states. [2019-09-08 12:45:49,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 3761. [2019-09-08 12:45:49,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3761 states. [2019-09-08 12:45:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3761 states and 5110 transitions. [2019-09-08 12:45:49,558 INFO L78 Accepts]: Start accepts. Automaton has 3761 states and 5110 transitions. Word has length 121 [2019-09-08 12:45:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:49,559 INFO L475 AbstractCegarLoop]: Abstraction has 3761 states and 5110 transitions. [2019-09-08 12:45:49,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3761 states and 5110 transitions. [2019-09-08 12:45:49,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:45:49,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:49,572 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:49,573 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:49,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:49,574 INFO L82 PathProgramCache]: Analyzing trace with hash -477701280, now seen corresponding path program 1 times [2019-09-08 12:45:49,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:49,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:49,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:49,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:49,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:50,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:50,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:50,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:50,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:50,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:50,139 INFO L87 Difference]: Start difference. First operand 3761 states and 5110 transitions. Second operand 5 states. [2019-09-08 12:45:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:54,024 INFO L93 Difference]: Finished difference Result 6429 states and 9000 transitions. [2019-09-08 12:45:54,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:54,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-08 12:45:54,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:54,045 INFO L225 Difference]: With dead ends: 6429 [2019-09-08 12:45:54,046 INFO L226 Difference]: Without dead ends: 3441 [2019-09-08 12:45:54,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:54,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2019-09-08 12:45:54,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3441. [2019-09-08 12:45:54,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3441 states. [2019-09-08 12:45:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 4724 transitions. [2019-09-08 12:45:54,217 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 4724 transitions. Word has length 122 [2019-09-08 12:45:54,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:54,221 INFO L475 AbstractCegarLoop]: Abstraction has 3441 states and 4724 transitions. [2019-09-08 12:45:54,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:54,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 4724 transitions. [2019-09-08 12:45:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:45:54,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:54,240 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:54,241 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:54,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:54,241 INFO L82 PathProgramCache]: Analyzing trace with hash 201129342, now seen corresponding path program 1 times [2019-09-08 12:45:54,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:54,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:54,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:54,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:54,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:54,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:54,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:54,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:54,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:54,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:54,535 INFO L87 Difference]: Start difference. First operand 3441 states and 4724 transitions. Second operand 5 states. [2019-09-08 12:45:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:56,363 INFO L93 Difference]: Finished difference Result 6109 states and 8612 transitions. [2019-09-08 12:45:56,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:56,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-09-08 12:45:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:56,379 INFO L225 Difference]: With dead ends: 6109 [2019-09-08 12:45:56,380 INFO L226 Difference]: Without dead ends: 3092 [2019-09-08 12:45:56,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2019-09-08 12:45:56,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 3092. [2019-09-08 12:45:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-09-08 12:45:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4341 transitions. [2019-09-08 12:45:56,587 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4341 transitions. Word has length 123 [2019-09-08 12:45:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:56,587 INFO L475 AbstractCegarLoop]: Abstraction has 3092 states and 4341 transitions. [2019-09-08 12:45:56,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4341 transitions. [2019-09-08 12:45:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:45:56,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:56,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:56,596 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:56,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:56,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1223888620, now seen corresponding path program 1 times [2019-09-08 12:45:56,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:56,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:56,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:56,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:56,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:56,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:56,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:56,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:56,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:56,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:56,860 INFO L87 Difference]: Start difference. First operand 3092 states and 4341 transitions. Second operand 5 states. [2019-09-08 12:45:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:59,011 INFO L93 Difference]: Finished difference Result 5760 states and 8227 transitions. [2019-09-08 12:45:59,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:59,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-09-08 12:45:59,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:59,028 INFO L225 Difference]: With dead ends: 5760 [2019-09-08 12:45:59,028 INFO L226 Difference]: Without dead ends: 2964 [2019-09-08 12:45:59,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2019-09-08 12:45:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2964. [2019-09-08 12:45:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2964 states. [2019-09-08 12:45:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 4195 transitions. [2019-09-08 12:45:59,162 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 4195 transitions. Word has length 124 [2019-09-08 12:45:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:59,164 INFO L475 AbstractCegarLoop]: Abstraction has 2964 states and 4195 transitions. [2019-09-08 12:45:59,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 4195 transitions. [2019-09-08 12:45:59,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:45:59,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:59,173 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:59,175 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:59,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:59,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1175551034, now seen corresponding path program 1 times [2019-09-08 12:45:59,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:59,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:59,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:59,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:59,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:59,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:59,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:59,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:59,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:59,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:59,458 INFO L87 Difference]: Start difference. First operand 2964 states and 4195 transitions. Second operand 5 states. [2019-09-08 12:46:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:01,365 INFO L93 Difference]: Finished difference Result 5632 states and 8079 transitions. [2019-09-08 12:46:01,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:46:01,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-09-08 12:46:01,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:01,380 INFO L225 Difference]: With dead ends: 5632 [2019-09-08 12:46:01,380 INFO L226 Difference]: Without dead ends: 2858 [2019-09-08 12:46:01,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:46:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-09-08 12:46:01,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2858. [2019-09-08 12:46:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2858 states. [2019-09-08 12:46:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 4079 transitions. [2019-09-08 12:46:01,521 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 4079 transitions. Word has length 125 [2019-09-08 12:46:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:01,521 INFO L475 AbstractCegarLoop]: Abstraction has 2858 states and 4079 transitions. [2019-09-08 12:46:01,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:46:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 4079 transitions. [2019-09-08 12:46:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:46:01,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:01,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:01,530 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:01,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:01,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1417854168, now seen corresponding path program 1 times [2019-09-08 12:46:01,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:01,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:01,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:01,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:01,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:01,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:01,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:46:01,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:46:01,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:46:01,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:46:01,800 INFO L87 Difference]: Start difference. First operand 2858 states and 4079 transitions. Second operand 5 states. [2019-09-08 12:46:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:03,704 INFO L93 Difference]: Finished difference Result 5526 states and 7961 transitions. [2019-09-08 12:46:03,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:46:03,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-08 12:46:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:03,716 INFO L225 Difference]: With dead ends: 5526 [2019-09-08 12:46:03,717 INFO L226 Difference]: Without dead ends: 2808 [2019-09-08 12:46:03,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:46:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2019-09-08 12:46:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2808. [2019-09-08 12:46:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2019-09-08 12:46:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4023 transitions. [2019-09-08 12:46:03,841 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4023 transitions. Word has length 126 [2019-09-08 12:46:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:03,841 INFO L475 AbstractCegarLoop]: Abstraction has 2808 states and 4023 transitions. [2019-09-08 12:46:03,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:46:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4023 transitions. [2019-09-08 12:46:03,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:46:03,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:03,849 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:03,850 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:03,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1969050564, now seen corresponding path program 1 times [2019-09-08 12:46:03,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:03,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:03,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:03,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:03,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:04,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:04,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:46:04,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:46:04,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:46:04,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:46:04,079 INFO L87 Difference]: Start difference. First operand 2808 states and 4023 transitions. Second operand 5 states. [2019-09-08 12:46:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:05,795 INFO L93 Difference]: Finished difference Result 5476 states and 7903 transitions. [2019-09-08 12:46:05,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:46:05,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-09-08 12:46:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:05,811 INFO L225 Difference]: With dead ends: 5476 [2019-09-08 12:46:05,811 INFO L226 Difference]: Without dead ends: 2777 [2019-09-08 12:46:05,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:46:05,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2019-09-08 12:46:05,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2777. [2019-09-08 12:46:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2777 states. [2019-09-08 12:46:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3988 transitions. [2019-09-08 12:46:05,944 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3988 transitions. Word has length 127 [2019-09-08 12:46:05,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:05,944 INFO L475 AbstractCegarLoop]: Abstraction has 2777 states and 3988 transitions. [2019-09-08 12:46:05,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:46:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3988 transitions. [2019-09-08 12:46:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:46:05,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:05,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:05,954 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:05,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:05,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1363435270, now seen corresponding path program 1 times [2019-09-08 12:46:05,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:05,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:05,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:05,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:05,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:06,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:06,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:46:06,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:46:06,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:46:06,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:46:06,202 INFO L87 Difference]: Start difference. First operand 2777 states and 3988 transitions. Second operand 5 states. [2019-09-08 12:46:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:08,129 INFO L93 Difference]: Finished difference Result 5445 states and 7866 transitions. [2019-09-08 12:46:08,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:46:08,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-09-08 12:46:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:08,142 INFO L225 Difference]: With dead ends: 5445 [2019-09-08 12:46:08,142 INFO L226 Difference]: Without dead ends: 2766 [2019-09-08 12:46:08,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:46:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2019-09-08 12:46:08,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 2766. [2019-09-08 12:46:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:46:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3974 transitions. [2019-09-08 12:46:08,278 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3974 transitions. Word has length 128 [2019-09-08 12:46:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:08,279 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3974 transitions. [2019-09-08 12:46:08,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:46:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3974 transitions. [2019-09-08 12:46:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:46:08,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:08,288 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:08,289 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:08,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:08,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2089118786, now seen corresponding path program 1 times [2019-09-08 12:46:08,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:08,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:08,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:08,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:08,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:08,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:08,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:46:08,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:46:08,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:46:08,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:46:08,825 INFO L87 Difference]: Start difference. First operand 2766 states and 3974 transitions. Second operand 8 states. [2019-09-08 12:46:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:13,172 INFO L93 Difference]: Finished difference Result 4591 states and 6345 transitions. [2019-09-08 12:46:13,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:46:13,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2019-09-08 12:46:13,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:13,186 INFO L225 Difference]: With dead ends: 4591 [2019-09-08 12:46:13,186 INFO L226 Difference]: Without dead ends: 3484 [2019-09-08 12:46:13,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:46:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3484 states. [2019-09-08 12:46:13,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3484 to 2766. [2019-09-08 12:46:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:46:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3973 transitions. [2019-09-08 12:46:13,345 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3973 transitions. Word has length 129 [2019-09-08 12:46:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:13,345 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3973 transitions. [2019-09-08 12:46:13,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:46:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3973 transitions. [2019-09-08 12:46:13,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:46:13,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:13,353 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:13,356 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:13,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:13,356 INFO L82 PathProgramCache]: Analyzing trace with hash 344358934, now seen corresponding path program 1 times [2019-09-08 12:46:13,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:13,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:13,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:13,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:13,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:13,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:13,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:13,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:13,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:13,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:13,741 INFO L87 Difference]: Start difference. First operand 2766 states and 3973 transitions. Second operand 9 states. [2019-09-08 12:46:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:19,561 INFO L93 Difference]: Finished difference Result 3856 states and 5569 transitions. [2019-09-08 12:46:19,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:46:19,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2019-09-08 12:46:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:19,570 INFO L225 Difference]: With dead ends: 3856 [2019-09-08 12:46:19,571 INFO L226 Difference]: Without dead ends: 3253 [2019-09-08 12:46:19,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:46:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3253 states. [2019-09-08 12:46:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3253 to 2766. [2019-09-08 12:46:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:46:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3972 transitions. [2019-09-08 12:46:19,721 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3972 transitions. Word has length 129 [2019-09-08 12:46:19,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:19,722 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3972 transitions. [2019-09-08 12:46:19,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3972 transitions. [2019-09-08 12:46:19,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:46:19,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:19,728 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:19,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1880291468, now seen corresponding path program 1 times [2019-09-08 12:46:19,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:19,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:19,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:19,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:19,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:20,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:20,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:20,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:20,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:20,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:20,071 INFO L87 Difference]: Start difference. First operand 2766 states and 3972 transitions. Second operand 9 states. [2019-09-08 12:46:25,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:25,381 INFO L93 Difference]: Finished difference Result 4934 states and 7101 transitions. [2019-09-08 12:46:25,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:25,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2019-09-08 12:46:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:25,393 INFO L225 Difference]: With dead ends: 4934 [2019-09-08 12:46:25,393 INFO L226 Difference]: Without dead ends: 4646 [2019-09-08 12:46:25,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:46:25,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-08 12:46:25,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-08 12:46:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:46:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3971 transitions. [2019-09-08 12:46:25,627 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3971 transitions. Word has length 129 [2019-09-08 12:46:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:25,627 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3971 transitions. [2019-09-08 12:46:25,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:25,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3971 transitions. [2019-09-08 12:46:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 12:46:25,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:25,633 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:25,634 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:25,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1158692593, now seen corresponding path program 1 times [2019-09-08 12:46:25,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:25,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:25,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:25,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:25,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:25,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:25,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:25,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:25,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:25,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:25,989 INFO L87 Difference]: Start difference. First operand 2766 states and 3971 transitions. Second operand 9 states. [2019-09-08 12:46:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:32,321 INFO L93 Difference]: Finished difference Result 5026 states and 7236 transitions. [2019-09-08 12:46:32,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:32,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-08 12:46:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:32,333 INFO L225 Difference]: With dead ends: 5026 [2019-09-08 12:46:32,334 INFO L226 Difference]: Without dead ends: 4646 [2019-09-08 12:46:32,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:46:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-08 12:46:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-08 12:46:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:46:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3969 transitions. [2019-09-08 12:46:32,531 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3969 transitions. Word has length 131 [2019-09-08 12:46:32,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:32,532 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3969 transitions. [2019-09-08 12:46:32,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:32,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3969 transitions. [2019-09-08 12:46:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 12:46:32,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:32,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:32,539 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:32,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:32,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2110751080, now seen corresponding path program 1 times [2019-09-08 12:46:32,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:32,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:32,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:32,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:32,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:32,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:32,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:32,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:32,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:32,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:32,941 INFO L87 Difference]: Start difference. First operand 2766 states and 3969 transitions. Second operand 9 states. [2019-09-08 12:46:39,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:39,319 INFO L93 Difference]: Finished difference Result 5038 states and 7239 transitions. [2019-09-08 12:46:39,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:39,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-08 12:46:39,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:39,330 INFO L225 Difference]: With dead ends: 5038 [2019-09-08 12:46:39,331 INFO L226 Difference]: Without dead ends: 4646 [2019-09-08 12:46:39,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:46:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-08 12:46:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-08 12:46:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:46:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3967 transitions. [2019-09-08 12:46:39,521 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3967 transitions. Word has length 131 [2019-09-08 12:46:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:39,522 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3967 transitions. [2019-09-08 12:46:39,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3967 transitions. [2019-09-08 12:46:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 12:46:39,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:39,528 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:39,533 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:39,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:39,533 INFO L82 PathProgramCache]: Analyzing trace with hash -587953857, now seen corresponding path program 1 times [2019-09-08 12:46:39,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:39,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:39,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:39,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:39,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:39,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:39,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:39,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:39,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:39,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:39,916 INFO L87 Difference]: Start difference. First operand 2766 states and 3967 transitions. Second operand 9 states. [2019-09-08 12:46:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:46,667 INFO L93 Difference]: Finished difference Result 5274 states and 7590 transitions. [2019-09-08 12:46:46,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:46,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-08 12:46:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:46,674 INFO L225 Difference]: With dead ends: 5274 [2019-09-08 12:46:46,674 INFO L226 Difference]: Without dead ends: 4682 [2019-09-08 12:46:46,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:46:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-09-08 12:46:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 2766. [2019-09-08 12:46:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:46:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3965 transitions. [2019-09-08 12:46:46,859 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3965 transitions. Word has length 131 [2019-09-08 12:46:46,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:46,859 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3965 transitions. [2019-09-08 12:46:46,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3965 transitions. [2019-09-08 12:46:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 12:46:46,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:46,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:46,865 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:46,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:46,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1083108632, now seen corresponding path program 1 times [2019-09-08 12:46:46,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:46,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:46,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:46,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:46,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:47,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:47,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:47,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:47,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:47,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:47,199 INFO L87 Difference]: Start difference. First operand 2766 states and 3965 transitions. Second operand 9 states. [2019-09-08 12:46:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:52,889 INFO L93 Difference]: Finished difference Result 4365 states and 6272 transitions. [2019-09-08 12:46:52,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:46:52,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-08 12:46:52,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:52,893 INFO L225 Difference]: With dead ends: 4365 [2019-09-08 12:46:52,893 INFO L226 Difference]: Without dead ends: 3253 [2019-09-08 12:46:52,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:46:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3253 states. [2019-09-08 12:46:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3253 to 2766. [2019-09-08 12:46:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:46:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3963 transitions. [2019-09-08 12:46:53,110 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3963 transitions. Word has length 131 [2019-09-08 12:46:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:53,111 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3963 transitions. [2019-09-08 12:46:53,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3963 transitions. [2019-09-08 12:46:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 12:46:53,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:53,115 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:53,116 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:53,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:53,116 INFO L82 PathProgramCache]: Analyzing trace with hash -768055919, now seen corresponding path program 1 times [2019-09-08 12:46:53,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:53,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:53,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:53,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:53,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:53,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:53,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:53,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:53,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:53,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:53,444 INFO L87 Difference]: Start difference. First operand 2766 states and 3963 transitions. Second operand 9 states. [2019-09-08 12:47:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:00,158 INFO L93 Difference]: Finished difference Result 4919 states and 7072 transitions. [2019-09-08 12:47:00,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:00,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-08 12:47:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:00,163 INFO L225 Difference]: With dead ends: 4919 [2019-09-08 12:47:00,163 INFO L226 Difference]: Without dead ends: 4646 [2019-09-08 12:47:00,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:47:00,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-08 12:47:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-08 12:47:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:47:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3962 transitions. [2019-09-08 12:47:00,348 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3962 transitions. Word has length 131 [2019-09-08 12:47:00,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:00,348 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3962 transitions. [2019-09-08 12:47:00,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:00,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3962 transitions. [2019-09-08 12:47:00,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 12:47:00,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:00,354 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:00,354 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:00,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:00,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1342997610, now seen corresponding path program 1 times [2019-09-08 12:47:00,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:00,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:00,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:00,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:00,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:00,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:00,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:00,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:00,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:00,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:00,716 INFO L87 Difference]: Start difference. First operand 2766 states and 3962 transitions. Second operand 9 states. [2019-09-08 12:47:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:08,350 INFO L93 Difference]: Finished difference Result 5058 states and 7282 transitions. [2019-09-08 12:47:08,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:08,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-08 12:47:08,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:08,356 INFO L225 Difference]: With dead ends: 5058 [2019-09-08 12:47:08,356 INFO L226 Difference]: Without dead ends: 4682 [2019-09-08 12:47:08,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:47:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-09-08 12:47:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 2766. [2019-09-08 12:47:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:47:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3961 transitions. [2019-09-08 12:47:08,496 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3961 transitions. Word has length 131 [2019-09-08 12:47:08,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:08,496 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3961 transitions. [2019-09-08 12:47:08,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:08,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3961 transitions. [2019-09-08 12:47:08,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 12:47:08,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:08,500 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:08,500 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:08,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:08,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1531428767, now seen corresponding path program 1 times [2019-09-08 12:47:08,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:08,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:08,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:08,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:08,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:08,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:08,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:08,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:08,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:08,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:08,786 INFO L87 Difference]: Start difference. First operand 2766 states and 3961 transitions. Second operand 9 states. [2019-09-08 12:47:15,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:15,134 INFO L93 Difference]: Finished difference Result 4934 states and 7088 transitions. [2019-09-08 12:47:15,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:15,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-08 12:47:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:15,140 INFO L225 Difference]: With dead ends: 4934 [2019-09-08 12:47:15,141 INFO L226 Difference]: Without dead ends: 4646 [2019-09-08 12:47:15,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:47:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-08 12:47:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-08 12:47:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:47:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3960 transitions. [2019-09-08 12:47:15,295 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3960 transitions. Word has length 131 [2019-09-08 12:47:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:15,296 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3960 transitions. [2019-09-08 12:47:15,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3960 transitions. [2019-09-08 12:47:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 12:47:15,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:15,301 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:15,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:15,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1076586842, now seen corresponding path program 1 times [2019-09-08 12:47:15,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:15,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:15,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:15,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:15,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:15,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:15,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:15,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:15,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:15,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:15,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:15,618 INFO L87 Difference]: Start difference. First operand 2766 states and 3960 transitions. Second operand 9 states. [2019-09-08 12:47:22,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:22,969 INFO L93 Difference]: Finished difference Result 5094 states and 7319 transitions. [2019-09-08 12:47:22,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:22,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-08 12:47:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:22,976 INFO L225 Difference]: With dead ends: 5094 [2019-09-08 12:47:22,976 INFO L226 Difference]: Without dead ends: 4682 [2019-09-08 12:47:22,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:47:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-09-08 12:47:23,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 2766. [2019-09-08 12:47:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:47:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3959 transitions. [2019-09-08 12:47:23,163 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3959 transitions. Word has length 131 [2019-09-08 12:47:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:23,163 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3959 transitions. [2019-09-08 12:47:23,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3959 transitions. [2019-09-08 12:47:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:47:23,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:23,168 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:23,168 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:23,169 INFO L82 PathProgramCache]: Analyzing trace with hash 736307517, now seen corresponding path program 1 times [2019-09-08 12:47:23,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:23,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:23,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:23,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:23,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:23,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:23,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:23,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:23,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:23,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:23,450 INFO L87 Difference]: Start difference. First operand 2766 states and 3959 transitions. Second operand 9 states. [2019-09-08 12:47:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:30,431 INFO L93 Difference]: Finished difference Result 4906 states and 7039 transitions. [2019-09-08 12:47:30,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:30,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-08 12:47:30,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:30,439 INFO L225 Difference]: With dead ends: 4906 [2019-09-08 12:47:30,439 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:47:30,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:47:30,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:47:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:47:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:47:30,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3957 transitions. [2019-09-08 12:47:30,601 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3957 transitions. Word has length 133 [2019-09-08 12:47:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:30,602 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3957 transitions. [2019-09-08 12:47:30,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3957 transitions. [2019-09-08 12:47:30,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:47:30,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:30,605 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:30,605 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:30,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:30,606 INFO L82 PathProgramCache]: Analyzing trace with hash 623712689, now seen corresponding path program 1 times [2019-09-08 12:47:30,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:30,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:30,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:30,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:30,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:30,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:30,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:30,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:30,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:30,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:30,922 INFO L87 Difference]: Start difference. First operand 2766 states and 3957 transitions. Second operand 9 states. [2019-09-08 12:47:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:36,592 INFO L93 Difference]: Finished difference Result 4686 states and 6673 transitions. [2019-09-08 12:47:36,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:36,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-08 12:47:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:36,603 INFO L225 Difference]: With dead ends: 4686 [2019-09-08 12:47:36,603 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:47:36,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:47:36,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:47:36,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:47:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:47:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3955 transitions. [2019-09-08 12:47:36,781 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3955 transitions. Word has length 133 [2019-09-08 12:47:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:36,781 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3955 transitions. [2019-09-08 12:47:36,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3955 transitions. [2019-09-08 12:47:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:47:36,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:36,784 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:36,784 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:36,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:36,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1151280894, now seen corresponding path program 1 times [2019-09-08 12:47:36,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:36,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:36,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:36,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:36,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:37,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:37,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:37,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:37,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:37,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:37,058 INFO L87 Difference]: Start difference. First operand 2766 states and 3955 transitions. Second operand 9 states. [2019-09-08 12:47:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:44,099 INFO L93 Difference]: Finished difference Result 4898 states and 7026 transitions. [2019-09-08 12:47:44,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:44,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-08 12:47:44,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:44,109 INFO L225 Difference]: With dead ends: 4898 [2019-09-08 12:47:44,110 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:47:44,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:47:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:47:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:47:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:47:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3953 transitions. [2019-09-08 12:47:44,288 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3953 transitions. Word has length 133 [2019-09-08 12:47:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:44,289 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3953 transitions. [2019-09-08 12:47:44,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3953 transitions. [2019-09-08 12:47:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:47:44,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:44,292 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:44,293 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:44,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:44,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1881878602, now seen corresponding path program 1 times [2019-09-08 12:47:44,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:44,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:44,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:44,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:44,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:44,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:44,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:44,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:44,712 INFO L87 Difference]: Start difference. First operand 2766 states and 3953 transitions. Second operand 9 states. [2019-09-08 12:47:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:51,883 INFO L93 Difference]: Finished difference Result 5058 states and 7250 transitions. [2019-09-08 12:47:51,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:51,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-08 12:47:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:51,889 INFO L225 Difference]: With dead ends: 5058 [2019-09-08 12:47:51,890 INFO L226 Difference]: Without dead ends: 4646 [2019-09-08 12:47:51,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:47:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-08 12:47:52,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-08 12:47:52,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:47:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3951 transitions. [2019-09-08 12:47:52,116 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3951 transitions. Word has length 133 [2019-09-08 12:47:52,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:52,116 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3951 transitions. [2019-09-08 12:47:52,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3951 transitions. [2019-09-08 12:47:52,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:47:52,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:52,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:52,120 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:52,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:52,120 INFO L82 PathProgramCache]: Analyzing trace with hash 222932807, now seen corresponding path program 1 times [2019-09-08 12:47:52,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:52,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:52,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:52,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:52,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:52,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:52,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:52,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:52,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:52,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:52,469 INFO L87 Difference]: Start difference. First operand 2766 states and 3951 transitions. Second operand 9 states. [2019-09-08 12:47:58,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:58,156 INFO L93 Difference]: Finished difference Result 4690 states and 6671 transitions. [2019-09-08 12:47:58,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:58,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-08 12:47:58,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:58,161 INFO L225 Difference]: With dead ends: 4690 [2019-09-08 12:47:58,162 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:47:58,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:47:58,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:47:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:47:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:47:58,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3949 transitions. [2019-09-08 12:47:58,399 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3949 transitions. Word has length 133 [2019-09-08 12:47:58,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:58,399 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3949 transitions. [2019-09-08 12:47:58,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:58,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3949 transitions. [2019-09-08 12:47:58,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:47:58,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:58,403 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:58,404 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:58,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:58,404 INFO L82 PathProgramCache]: Analyzing trace with hash 845437785, now seen corresponding path program 1 times [2019-09-08 12:47:58,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:58,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:58,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:58,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:58,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:58,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:58,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:58,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:58,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:58,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:58,685 INFO L87 Difference]: Start difference. First operand 2766 states and 3949 transitions. Second operand 9 states. [2019-09-08 12:48:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:06,130 INFO L93 Difference]: Finished difference Result 5358 states and 7666 transitions. [2019-09-08 12:48:06,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:06,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-08 12:48:06,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:06,134 INFO L225 Difference]: With dead ends: 5358 [2019-09-08 12:48:06,135 INFO L226 Difference]: Without dead ends: 4682 [2019-09-08 12:48:06,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:48:06,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-09-08 12:48:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 2766. [2019-09-08 12:48:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:48:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3947 transitions. [2019-09-08 12:48:06,331 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3947 transitions. Word has length 133 [2019-09-08 12:48:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:06,331 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3947 transitions. [2019-09-08 12:48:06,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3947 transitions. [2019-09-08 12:48:06,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:48:06,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:06,335 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:06,335 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:06,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:06,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2083081898, now seen corresponding path program 1 times [2019-09-08 12:48:06,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:06,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:06,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:06,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:06,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:06,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:06,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:06,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:06,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:06,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:06,579 INFO L87 Difference]: Start difference. First operand 2766 states and 3947 transitions. Second operand 9 states. [2019-09-08 12:48:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:14,029 INFO L93 Difference]: Finished difference Result 4855 states and 6954 transitions. [2019-09-08 12:48:14,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:14,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-08 12:48:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:14,034 INFO L225 Difference]: With dead ends: 4855 [2019-09-08 12:48:14,034 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:48:14,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:48:14,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:48:14,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:48:14,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:48:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3946 transitions. [2019-09-08 12:48:14,229 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3946 transitions. Word has length 133 [2019-09-08 12:48:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:14,229 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3946 transitions. [2019-09-08 12:48:14,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3946 transitions. [2019-09-08 12:48:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:48:14,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:14,233 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:14,233 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:14,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:14,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1507321918, now seen corresponding path program 1 times [2019-09-08 12:48:14,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:14,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:14,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:14,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:14,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:14,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:14,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:14,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:14,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:14,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:14,514 INFO L87 Difference]: Start difference. First operand 2766 states and 3946 transitions. Second operand 9 states. [2019-09-08 12:48:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:21,916 INFO L93 Difference]: Finished difference Result 4847 states and 6941 transitions. [2019-09-08 12:48:21,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:21,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-08 12:48:21,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:21,923 INFO L225 Difference]: With dead ends: 4847 [2019-09-08 12:48:21,923 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:48:21,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:48:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:48:22,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:48:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:48:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3945 transitions. [2019-09-08 12:48:22,124 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3945 transitions. Word has length 133 [2019-09-08 12:48:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:22,124 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3945 transitions. [2019-09-08 12:48:22,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3945 transitions. [2019-09-08 12:48:22,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:48:22,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:22,127 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:22,127 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:22,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:22,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2120317287, now seen corresponding path program 1 times [2019-09-08 12:48:22,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:22,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:22,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:22,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:22,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:22,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:22,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:22,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:22,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:22,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:22,341 INFO L87 Difference]: Start difference. First operand 2766 states and 3945 transitions. Second operand 9 states. [2019-09-08 12:48:29,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:29,807 INFO L93 Difference]: Finished difference Result 4862 states and 6957 transitions. [2019-09-08 12:48:29,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:29,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-08 12:48:29,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:29,812 INFO L225 Difference]: With dead ends: 4862 [2019-09-08 12:48:29,812 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:48:29,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:48:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:48:30,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:48:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:48:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3944 transitions. [2019-09-08 12:48:30,026 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3944 transitions. Word has length 133 [2019-09-08 12:48:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:30,026 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3944 transitions. [2019-09-08 12:48:30,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3944 transitions. [2019-09-08 12:48:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:48:30,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:30,029 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:30,029 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:30,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1595042912, now seen corresponding path program 1 times [2019-09-08 12:48:30,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:30,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:30,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:30,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:30,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:30,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:30,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:30,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:30,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:30,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:30,267 INFO L87 Difference]: Start difference. First operand 2766 states and 3944 transitions. Second operand 9 states. [2019-09-08 12:48:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:37,073 INFO L93 Difference]: Finished difference Result 4855 states and 6949 transitions. [2019-09-08 12:48:37,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:37,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-08 12:48:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:37,078 INFO L225 Difference]: With dead ends: 4855 [2019-09-08 12:48:37,079 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:48:37,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:48:37,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:48:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:48:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:48:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3943 transitions. [2019-09-08 12:48:37,289 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3943 transitions. Word has length 133 [2019-09-08 12:48:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:37,289 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3943 transitions. [2019-09-08 12:48:37,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3943 transitions. [2019-09-08 12:48:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:48:37,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:37,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:37,292 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:37,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:37,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2083896402, now seen corresponding path program 1 times [2019-09-08 12:48:37,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:37,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:37,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:37,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:37,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:37,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:37,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:37,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:37,595 INFO L87 Difference]: Start difference. First operand 2766 states and 3943 transitions. Second operand 9 states. [2019-09-08 12:48:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:45,093 INFO L93 Difference]: Finished difference Result 4862 states and 6955 transitions. [2019-09-08 12:48:45,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:45,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-08 12:48:45,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:45,099 INFO L225 Difference]: With dead ends: 4862 [2019-09-08 12:48:45,099 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:48:45,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:48:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:48:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:48:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:48:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3942 transitions. [2019-09-08 12:48:45,319 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3942 transitions. Word has length 133 [2019-09-08 12:48:45,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:45,319 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3942 transitions. [2019-09-08 12:48:45,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:45,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3942 transitions. [2019-09-08 12:48:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:48:45,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:45,322 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:45,322 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:45,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:45,322 INFO L82 PathProgramCache]: Analyzing trace with hash -531295320, now seen corresponding path program 1 times [2019-09-08 12:48:45,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:45,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:45,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:45,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:45,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:45,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:45,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:45,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:45,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:45,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:45,601 INFO L87 Difference]: Start difference. First operand 2766 states and 3942 transitions. Second operand 9 states. [2019-09-08 12:48:52,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:52,370 INFO L93 Difference]: Finished difference Result 4955 states and 7084 transitions. [2019-09-08 12:48:52,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:52,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-08 12:48:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:52,375 INFO L225 Difference]: With dead ends: 4955 [2019-09-08 12:48:52,375 INFO L226 Difference]: Without dead ends: 4646 [2019-09-08 12:48:52,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:48:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-08 12:48:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-08 12:48:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:48:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3941 transitions. [2019-09-08 12:48:52,600 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3941 transitions. Word has length 133 [2019-09-08 12:48:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:52,600 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3941 transitions. [2019-09-08 12:48:52,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3941 transitions. [2019-09-08 12:48:52,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:48:52,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:52,604 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:52,604 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:52,604 INFO L82 PathProgramCache]: Analyzing trace with hash -67638233, now seen corresponding path program 1 times [2019-09-08 12:48:52,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:52,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:52,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:52,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:52,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:52,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:52,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:52,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:52,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:52,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:52,885 INFO L87 Difference]: Start difference. First operand 2766 states and 3941 transitions. Second operand 9 states. [2019-09-08 12:48:59,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:59,472 INFO L93 Difference]: Finished difference Result 4855 states and 6946 transitions. [2019-09-08 12:48:59,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:59,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-08 12:48:59,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:59,478 INFO L225 Difference]: With dead ends: 4855 [2019-09-08 12:48:59,478 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:48:59,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:48:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:48:59,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:48:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:48:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3940 transitions. [2019-09-08 12:48:59,704 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3940 transitions. Word has length 133 [2019-09-08 12:48:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:59,705 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3940 transitions. [2019-09-08 12:48:59,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3940 transitions. [2019-09-08 12:48:59,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 12:48:59,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:59,707 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:59,707 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:59,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:59,708 INFO L82 PathProgramCache]: Analyzing trace with hash -694771806, now seen corresponding path program 1 times [2019-09-08 12:48:59,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:59,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:59,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:59,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:59,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:59,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:59,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:59,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:59,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:59,969 INFO L87 Difference]: Start difference. First operand 2766 states and 3940 transitions. Second operand 9 states. [2019-09-08 12:49:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:07,608 INFO L93 Difference]: Finished difference Result 4862 states and 6952 transitions. [2019-09-08 12:49:07,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:07,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2019-09-08 12:49:07,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:07,613 INFO L225 Difference]: With dead ends: 4862 [2019-09-08 12:49:07,614 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:49:07,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:49:07,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:49:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:49:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:49:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3939 transitions. [2019-09-08 12:49:07,842 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3939 transitions. Word has length 133 [2019-09-08 12:49:07,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:07,843 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3939 transitions. [2019-09-08 12:49:07,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3939 transitions. [2019-09-08 12:49:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:49:07,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:07,847 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:49:07,847 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash -39049766, now seen corresponding path program 1 times [2019-09-08 12:49:07,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:07,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:07,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:07,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:07,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:49:08,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:08,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:08,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:08,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:08,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:08,110 INFO L87 Difference]: Start difference. First operand 2766 states and 3939 transitions. Second operand 9 states. [2019-09-08 12:49:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:15,710 INFO L93 Difference]: Finished difference Result 4910 states and 7012 transitions. [2019-09-08 12:49:15,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:15,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:49:15,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:15,715 INFO L225 Difference]: With dead ends: 4910 [2019-09-08 12:49:15,715 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:49:15,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:49:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:49:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:49:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:49:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3937 transitions. [2019-09-08 12:49:15,948 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3937 transitions. Word has length 135 [2019-09-08 12:49:15,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:15,948 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3937 transitions. [2019-09-08 12:49:15,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:15,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3937 transitions. [2019-09-08 12:49:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:49:15,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:15,951 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:49:15,951 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:15,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:15,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1435754152, now seen corresponding path program 1 times [2019-09-08 12:49:15,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:15,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:15,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:15,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:15,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:49:16,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:16,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:16,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:16,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:16,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:16,208 INFO L87 Difference]: Start difference. First operand 2766 states and 3937 transitions. Second operand 9 states. [2019-09-08 12:49:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:23,282 INFO L93 Difference]: Finished difference Result 4808 states and 6855 transitions. [2019-09-08 12:49:23,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:23,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:49:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:23,288 INFO L225 Difference]: With dead ends: 4808 [2019-09-08 12:49:23,288 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:49:23,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:49:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:49:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:49:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:49:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3935 transitions. [2019-09-08 12:49:23,531 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3935 transitions. Word has length 135 [2019-09-08 12:49:23,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:23,531 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3935 transitions. [2019-09-08 12:49:23,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3935 transitions. [2019-09-08 12:49:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:49:23,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:23,534 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:49:23,534 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:23,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:23,534 INFO L82 PathProgramCache]: Analyzing trace with hash -755352912, now seen corresponding path program 1 times [2019-09-08 12:49:23,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:23,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:23,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:23,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:49:23,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:23,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:23,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:23,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:23,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:23,822 INFO L87 Difference]: Start difference. First operand 2766 states and 3935 transitions. Second operand 9 states. [2019-09-08 12:49:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:31,176 INFO L93 Difference]: Finished difference Result 4804 states and 6850 transitions. [2019-09-08 12:49:31,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:31,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:49:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:31,181 INFO L225 Difference]: With dead ends: 4804 [2019-09-08 12:49:31,182 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:49:31,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:49:31,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:49:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:49:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:49:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3933 transitions. [2019-09-08 12:49:31,449 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3933 transitions. Word has length 135 [2019-09-08 12:49:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:31,449 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3933 transitions. [2019-09-08 12:49:31,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:31,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3933 transitions. [2019-09-08 12:49:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:49:31,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:31,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:49:31,452 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:31,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1389363612, now seen corresponding path program 1 times [2019-09-08 12:49:31,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:31,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:31,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:31,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:31,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:49:31,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:31,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:31,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:31,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:31,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:31,745 INFO L87 Difference]: Start difference. First operand 2766 states and 3933 transitions. Second operand 9 states. [2019-09-08 12:49:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:37,617 INFO L93 Difference]: Finished difference Result 4686 states and 6645 transitions. [2019-09-08 12:49:37,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:37,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:49:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:37,622 INFO L225 Difference]: With dead ends: 4686 [2019-09-08 12:49:37,622 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:49:37,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:49:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:49:37,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:49:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:49:37,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3931 transitions. [2019-09-08 12:49:37,875 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3931 transitions. Word has length 135 [2019-09-08 12:49:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:37,875 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3931 transitions. [2019-09-08 12:49:37,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:37,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3931 transitions. [2019-09-08 12:49:37,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:49:37,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:37,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:49:37,879 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:37,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:37,879 INFO L82 PathProgramCache]: Analyzing trace with hash -748174051, now seen corresponding path program 1 times [2019-09-08 12:49:37,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:37,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:37,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:37,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:37,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:49:38,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:38,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:38,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:38,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:38,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:38,164 INFO L87 Difference]: Start difference. First operand 2766 states and 3931 transitions. Second operand 9 states. [2019-09-08 12:49:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:46,106 INFO L93 Difference]: Finished difference Result 4906 states and 7000 transitions. [2019-09-08 12:49:46,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:46,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:49:46,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:46,111 INFO L225 Difference]: With dead ends: 4906 [2019-09-08 12:49:46,111 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:49:46,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:49:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:49:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:49:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:49:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3929 transitions. [2019-09-08 12:49:46,379 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3929 transitions. Word has length 135 [2019-09-08 12:49:46,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:46,380 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3929 transitions. [2019-09-08 12:49:46,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:46,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3929 transitions. [2019-09-08 12:49:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:49:46,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:46,382 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:49:46,382 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:46,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:46,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1585175971, now seen corresponding path program 1 times [2019-09-08 12:49:46,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:46,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:46,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:46,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:46,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:49:46,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:46,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:46,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:46,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:46,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:46,602 INFO L87 Difference]: Start difference. First operand 2766 states and 3929 transitions. Second operand 9 states. [2019-09-08 12:49:53,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:53,572 INFO L93 Difference]: Finished difference Result 4804 states and 6842 transitions. [2019-09-08 12:49:53,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:53,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:49:53,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:53,577 INFO L225 Difference]: With dead ends: 4804 [2019-09-08 12:49:53,578 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:49:53,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:49:53,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:49:53,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:49:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:49:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3927 transitions. [2019-09-08 12:49:53,860 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3927 transitions. Word has length 135 [2019-09-08 12:49:53,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:53,860 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3927 transitions. [2019-09-08 12:49:53,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:53,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3927 transitions. [2019-09-08 12:49:53,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:49:53,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:53,864 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:49:53,864 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:53,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:53,865 INFO L82 PathProgramCache]: Analyzing trace with hash 22016039, now seen corresponding path program 1 times [2019-09-08 12:49:53,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:53,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:53,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:53,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:53,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:49:54,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:54,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:54,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:54,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:54,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:54,128 INFO L87 Difference]: Start difference. First operand 2766 states and 3927 transitions. Second operand 9 states. [2019-09-08 12:50:01,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:01,076 INFO L93 Difference]: Finished difference Result 4804 states and 6840 transitions. [2019-09-08 12:50:01,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:01,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:50:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:01,082 INFO L225 Difference]: With dead ends: 4804 [2019-09-08 12:50:01,082 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:50:01,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:50:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:50:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:50:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:50:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3925 transitions. [2019-09-08 12:50:01,360 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3925 transitions. Word has length 135 [2019-09-08 12:50:01,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:01,360 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3925 transitions. [2019-09-08 12:50:01,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3925 transitions. [2019-09-08 12:50:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:50:01,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:01,363 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:01,363 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:01,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:01,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2071378897, now seen corresponding path program 1 times [2019-09-08 12:50:01,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:01,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:01,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:01,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:01,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:01,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:01,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:01,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:01,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:01,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:01,587 INFO L87 Difference]: Start difference. First operand 2766 states and 3925 transitions. Second operand 9 states. [2019-09-08 12:50:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:08,798 INFO L93 Difference]: Finished difference Result 4800 states and 6832 transitions. [2019-09-08 12:50:08,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:08,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:50:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:08,805 INFO L225 Difference]: With dead ends: 4800 [2019-09-08 12:50:08,805 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:50:08,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:50:08,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:50:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:50:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:50:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3923 transitions. [2019-09-08 12:50:09,077 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3923 transitions. Word has length 135 [2019-09-08 12:50:09,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:09,077 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3923 transitions. [2019-09-08 12:50:09,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:09,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3923 transitions. [2019-09-08 12:50:09,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:50:09,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:09,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:09,081 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:09,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:09,081 INFO L82 PathProgramCache]: Analyzing trace with hash -107791751, now seen corresponding path program 1 times [2019-09-08 12:50:09,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:09,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:09,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:09,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:09,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:09,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:09,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:09,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:09,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:09,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:09,306 INFO L87 Difference]: Start difference. First operand 2766 states and 3923 transitions. Second operand 9 states. [2019-09-08 12:50:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:16,670 INFO L93 Difference]: Finished difference Result 4812 states and 6843 transitions. [2019-09-08 12:50:16,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:16,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:50:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:16,675 INFO L225 Difference]: With dead ends: 4812 [2019-09-08 12:50:16,675 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:50:16,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:50:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:50:16,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:50:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:50:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3921 transitions. [2019-09-08 12:50:16,949 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3921 transitions. Word has length 135 [2019-09-08 12:50:16,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:16,949 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3921 transitions. [2019-09-08 12:50:16,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3921 transitions. [2019-09-08 12:50:16,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:50:16,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:16,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:16,952 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:16,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:16,952 INFO L82 PathProgramCache]: Analyzing trace with hash -747622809, now seen corresponding path program 1 times [2019-09-08 12:50:16,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:16,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:16,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:16,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:16,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:17,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:17,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:17,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:17,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:17,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:17,153 INFO L87 Difference]: Start difference. First operand 2766 states and 3921 transitions. Second operand 9 states. [2019-09-08 12:50:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:24,638 INFO L93 Difference]: Finished difference Result 4926 states and 7011 transitions. [2019-09-08 12:50:24,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:24,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:50:24,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:24,644 INFO L225 Difference]: With dead ends: 4926 [2019-09-08 12:50:24,644 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:50:24,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:50:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:50:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:50:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:50:24,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3919 transitions. [2019-09-08 12:50:24,926 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3919 transitions. Word has length 135 [2019-09-08 12:50:24,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:24,927 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3919 transitions. [2019-09-08 12:50:24,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3919 transitions. [2019-09-08 12:50:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:50:24,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:24,931 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:24,931 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:24,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:24,931 INFO L82 PathProgramCache]: Analyzing trace with hash 195793146, now seen corresponding path program 1 times [2019-09-08 12:50:24,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:24,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:24,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:24,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:24,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:25,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:25,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:25,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:25,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:25,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:25,141 INFO L87 Difference]: Start difference. First operand 2766 states and 3919 transitions. Second operand 9 states. [2019-09-08 12:50:32,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:32,895 INFO L93 Difference]: Finished difference Result 5090 states and 7231 transitions. [2019-09-08 12:50:32,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:32,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:50:32,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:32,901 INFO L225 Difference]: With dead ends: 5090 [2019-09-08 12:50:32,901 INFO L226 Difference]: Without dead ends: 4646 [2019-09-08 12:50:32,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:50:32,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-09-08 12:50:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 2766. [2019-09-08 12:50:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:50:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3917 transitions. [2019-09-08 12:50:33,189 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3917 transitions. Word has length 135 [2019-09-08 12:50:33,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:33,189 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3917 transitions. [2019-09-08 12:50:33,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3917 transitions. [2019-09-08 12:50:33,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:50:33,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:33,193 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:33,193 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:33,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:33,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1032140353, now seen corresponding path program 1 times [2019-09-08 12:50:33,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:33,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:33,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:33,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:33,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:33,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:33,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:33,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:33,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:33,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:33,392 INFO L87 Difference]: Start difference. First operand 2766 states and 3917 transitions. Second operand 9 states. [2019-09-08 12:50:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:40,566 INFO L93 Difference]: Finished difference Result 4812 states and 6837 transitions. [2019-09-08 12:50:40,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:40,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:50:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:40,570 INFO L225 Difference]: With dead ends: 4812 [2019-09-08 12:50:40,571 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:50:40,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:50:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:50:40,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:50:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:50:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3915 transitions. [2019-09-08 12:50:40,862 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3915 transitions. Word has length 135 [2019-09-08 12:50:40,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:40,862 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3915 transitions. [2019-09-08 12:50:40,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:40,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3915 transitions. [2019-09-08 12:50:40,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:50:40,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:40,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:40,865 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:40,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:40,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1671971411, now seen corresponding path program 1 times [2019-09-08 12:50:40,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:40,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:40,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:40,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:40,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:41,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:41,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:41,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:41,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:41,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:41,153 INFO L87 Difference]: Start difference. First operand 2766 states and 3915 transitions. Second operand 9 states. [2019-09-08 12:50:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:47,036 INFO L93 Difference]: Finished difference Result 4692 states and 6632 transitions. [2019-09-08 12:50:47,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:47,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:50:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:47,041 INFO L225 Difference]: With dead ends: 4692 [2019-09-08 12:50:47,041 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:50:47,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:50:47,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:50:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:50:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:50:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3913 transitions. [2019-09-08 12:50:47,338 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3913 transitions. Word has length 135 [2019-09-08 12:50:47,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:47,338 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3913 transitions. [2019-09-08 12:50:47,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3913 transitions. [2019-09-08 12:50:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:50:47,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:47,340 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:47,340 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:47,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:47,341 INFO L82 PathProgramCache]: Analyzing trace with hash 693839373, now seen corresponding path program 1 times [2019-09-08 12:50:47,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:47,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:47,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:47,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:47,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:47,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:47,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:47,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:47,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:47,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:47,537 INFO L87 Difference]: Start difference. First operand 2766 states and 3913 transitions. Second operand 9 states. [2019-09-08 12:50:55,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:55,274 INFO L93 Difference]: Finished difference Result 4926 states and 6997 transitions. [2019-09-08 12:50:55,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:55,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:50:55,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:55,278 INFO L225 Difference]: With dead ends: 4926 [2019-09-08 12:50:55,279 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:50:55,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:50:55,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:50:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:50:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:50:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3911 transitions. [2019-09-08 12:50:55,582 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3911 transitions. Word has length 135 [2019-09-08 12:50:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:55,582 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3911 transitions. [2019-09-08 12:50:55,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3911 transitions. [2019-09-08 12:50:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:50:55,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:55,585 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:55,585 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:55,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:55,585 INFO L82 PathProgramCache]: Analyzing trace with hash -376808769, now seen corresponding path program 1 times [2019-09-08 12:50:55,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:55,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:55,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:55,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:55,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:55,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:55,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:55,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:55,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:55,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:55,817 INFO L87 Difference]: Start difference. First operand 2766 states and 3911 transitions. Second operand 9 states. [2019-09-08 12:51:03,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:03,337 INFO L93 Difference]: Finished difference Result 4804 states and 6820 transitions. [2019-09-08 12:51:03,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:03,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:51:03,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:03,342 INFO L225 Difference]: With dead ends: 4804 [2019-09-08 12:51:03,342 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:51:03,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:51:03,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:51:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:51:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3909 transitions. [2019-09-08 12:51:03,652 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3909 transitions. Word has length 135 [2019-09-08 12:51:03,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:03,652 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3909 transitions. [2019-09-08 12:51:03,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3909 transitions. [2019-09-08 12:51:03,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:51:03,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:03,654 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:03,655 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:03,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:03,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1764484084, now seen corresponding path program 1 times [2019-09-08 12:51:03,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:03,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:03,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:03,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:03,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:03,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:03,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:03,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:03,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:03,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:03,847 INFO L87 Difference]: Start difference. First operand 2766 states and 3909 transitions. Second operand 9 states. [2019-09-08 12:51:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:09,958 INFO L93 Difference]: Finished difference Result 4684 states and 6616 transitions. [2019-09-08 12:51:09,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:09,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:51:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:09,964 INFO L225 Difference]: With dead ends: 4684 [2019-09-08 12:51:09,964 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:51:09,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:51:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:51:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:51:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:51:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3907 transitions. [2019-09-08 12:51:10,288 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3907 transitions. Word has length 135 [2019-09-08 12:51:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:10,288 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3907 transitions. [2019-09-08 12:51:10,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3907 transitions. [2019-09-08 12:51:10,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:51:10,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:10,292 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:10,292 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:10,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:10,292 INFO L82 PathProgramCache]: Analyzing trace with hash 812047935, now seen corresponding path program 1 times [2019-09-08 12:51:10,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:10,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:10,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:10,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:10,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:10,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:10,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:10,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:10,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:10,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:10,484 INFO L87 Difference]: Start difference. First operand 2766 states and 3907 transitions. Second operand 9 states. [2019-09-08 12:51:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:18,295 INFO L93 Difference]: Finished difference Result 4910 states and 6970 transitions. [2019-09-08 12:51:18,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:18,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:51:18,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:18,300 INFO L225 Difference]: With dead ends: 4910 [2019-09-08 12:51:18,300 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:51:18,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:18,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:51:18,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:51:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:51:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3905 transitions. [2019-09-08 12:51:18,623 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3905 transitions. Word has length 135 [2019-09-08 12:51:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:18,624 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3905 transitions. [2019-09-08 12:51:18,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3905 transitions. [2019-09-08 12:51:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:51:18,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:18,626 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:18,626 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:18,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:18,627 INFO L82 PathProgramCache]: Analyzing trace with hash -410135329, now seen corresponding path program 1 times [2019-09-08 12:51:18,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:18,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:18,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:18,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:18,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:18,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:18,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:18,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:18,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:18,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:18,863 INFO L87 Difference]: Start difference. First operand 2766 states and 3905 transitions. Second operand 9 states. [2019-09-08 12:51:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:26,442 INFO L93 Difference]: Finished difference Result 4784 states and 6783 transitions. [2019-09-08 12:51:26,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:26,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:51:26,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:26,448 INFO L225 Difference]: With dead ends: 4784 [2019-09-08 12:51:26,448 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:51:26,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:26,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:51:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:51:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:51:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3904 transitions. [2019-09-08 12:51:26,773 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3904 transitions. Word has length 135 [2019-09-08 12:51:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:26,773 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3904 transitions. [2019-09-08 12:51:26,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3904 transitions. [2019-09-08 12:51:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:51:26,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:26,776 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:26,776 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:26,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:26,777 INFO L82 PathProgramCache]: Analyzing trace with hash 466364518, now seen corresponding path program 1 times [2019-09-08 12:51:26,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:26,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:26,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:26,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:26,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:26,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:26,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:26,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:26,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:26,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:26,977 INFO L87 Difference]: Start difference. First operand 2766 states and 3904 transitions. Second operand 9 states. [2019-09-08 12:51:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:34,654 INFO L93 Difference]: Finished difference Result 4782 states and 6779 transitions. [2019-09-08 12:51:34,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:34,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:51:34,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:34,659 INFO L225 Difference]: With dead ends: 4782 [2019-09-08 12:51:34,659 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:51:34,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:34,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:51:34,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:51:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:51:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3903 transitions. [2019-09-08 12:51:34,987 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3903 transitions. Word has length 135 [2019-09-08 12:51:34,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:34,987 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3903 transitions. [2019-09-08 12:51:34,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3903 transitions. [2019-09-08 12:51:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:51:34,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:34,990 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:34,990 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:34,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:34,990 INFO L82 PathProgramCache]: Analyzing trace with hash -912187828, now seen corresponding path program 1 times [2019-09-08 12:51:34,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:34,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:34,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:34,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:34,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:35,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:35,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:35,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:35,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:35,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:35,192 INFO L87 Difference]: Start difference. First operand 2766 states and 3903 transitions. Second operand 9 states. [2019-09-08 12:51:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:42,811 INFO L93 Difference]: Finished difference Result 4782 states and 6778 transitions. [2019-09-08 12:51:42,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:42,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:51:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:42,817 INFO L225 Difference]: With dead ends: 4782 [2019-09-08 12:51:42,817 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:51:42,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:51:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:51:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:51:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3902 transitions. [2019-09-08 12:51:43,161 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3902 transitions. Word has length 135 [2019-09-08 12:51:43,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:43,161 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3902 transitions. [2019-09-08 12:51:43,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3902 transitions. [2019-09-08 12:51:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:51:43,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:43,163 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:43,163 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:43,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:43,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1490283073, now seen corresponding path program 1 times [2019-09-08 12:51:43,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:43,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:43,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:43,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:43,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:43,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:43,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:43,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:43,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:43,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:43,365 INFO L87 Difference]: Start difference. First operand 2766 states and 3902 transitions. Second operand 9 states. [2019-09-08 12:51:49,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:49,893 INFO L93 Difference]: Finished difference Result 4784 states and 6778 transitions. [2019-09-08 12:51:49,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:49,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:51:49,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:49,898 INFO L225 Difference]: With dead ends: 4784 [2019-09-08 12:51:49,898 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:51:49,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:51:50,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:51:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:51:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3901 transitions. [2019-09-08 12:51:50,235 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3901 transitions. Word has length 135 [2019-09-08 12:51:50,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:50,235 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3901 transitions. [2019-09-08 12:51:50,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3901 transitions. [2019-09-08 12:51:50,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:51:50,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:50,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:50,238 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:50,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:50,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2121611680, now seen corresponding path program 1 times [2019-09-08 12:51:50,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:50,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:50,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:50,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:50,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:50,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:50,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:50,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:50,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:50,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:50,429 INFO L87 Difference]: Start difference. First operand 2766 states and 3901 transitions. Second operand 9 states. [2019-09-08 12:51:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:58,085 INFO L93 Difference]: Finished difference Result 4789 states and 6781 transitions. [2019-09-08 12:51:58,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:58,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:51:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:58,090 INFO L225 Difference]: With dead ends: 4789 [2019-09-08 12:51:58,090 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:51:58,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:51:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:51:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:51:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3900 transitions. [2019-09-08 12:51:58,430 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3900 transitions. Word has length 135 [2019-09-08 12:51:58,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:58,431 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3900 transitions. [2019-09-08 12:51:58,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3900 transitions. [2019-09-08 12:51:58,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:51:58,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:58,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:58,434 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:58,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:58,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1744708295, now seen corresponding path program 1 times [2019-09-08 12:51:58,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:58,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:58,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:58,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:58,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:58,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:58,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:58,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:58,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:58,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:58,647 INFO L87 Difference]: Start difference. First operand 2766 states and 3900 transitions. Second operand 9 states. [2019-09-08 12:52:05,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:05,069 INFO L93 Difference]: Finished difference Result 4782 states and 6773 transitions. [2019-09-08 12:52:05,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:52:05,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:52:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:05,074 INFO L225 Difference]: With dead ends: 4782 [2019-09-08 12:52:05,074 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:52:05,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:05,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:52:05,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:52:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:52:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3899 transitions. [2019-09-08 12:52:05,418 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3899 transitions. Word has length 135 [2019-09-08 12:52:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:05,419 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3899 transitions. [2019-09-08 12:52:05,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:52:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3899 transitions. [2019-09-08 12:52:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:52:05,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:05,423 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:05,424 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:05,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:05,424 INFO L82 PathProgramCache]: Analyzing trace with hash 116908937, now seen corresponding path program 1 times [2019-09-08 12:52:05,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:05,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:05,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:05,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:05,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:05,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:05,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:52:05,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:52:05,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:52:05,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:52:05,636 INFO L87 Difference]: Start difference. First operand 2766 states and 3899 transitions. Second operand 9 states. [2019-09-08 12:52:12,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:12,307 INFO L93 Difference]: Finished difference Result 4784 states and 6774 transitions. [2019-09-08 12:52:12,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:52:12,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:52:12,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:12,312 INFO L225 Difference]: With dead ends: 4784 [2019-09-08 12:52:12,313 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:52:12,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:52:12,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:52:12,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:52:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3898 transitions. [2019-09-08 12:52:12,666 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3898 transitions. Word has length 135 [2019-09-08 12:52:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:12,666 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3898 transitions. [2019-09-08 12:52:12,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:52:12,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3898 transitions. [2019-09-08 12:52:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:52:12,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:12,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:12,669 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:12,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:12,669 INFO L82 PathProgramCache]: Analyzing trace with hash 137176145, now seen corresponding path program 1 times [2019-09-08 12:52:12,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:12,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:12,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:12,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:12,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:12,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:12,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:52:12,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:52:12,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:52:12,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:52:12,848 INFO L87 Difference]: Start difference. First operand 2766 states and 3898 transitions. Second operand 9 states. [2019-09-08 12:52:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:20,512 INFO L93 Difference]: Finished difference Result 4876 states and 6904 transitions. [2019-09-08 12:52:20,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:52:20,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:52:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:20,518 INFO L225 Difference]: With dead ends: 4876 [2019-09-08 12:52:20,518 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:52:20,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:20,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:52:20,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:52:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:52:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3897 transitions. [2019-09-08 12:52:20,898 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3897 transitions. Word has length 135 [2019-09-08 12:52:20,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:20,898 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3897 transitions. [2019-09-08 12:52:20,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:52:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3897 transitions. [2019-09-08 12:52:20,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:52:20,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:20,900 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:20,900 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:20,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:20,901 INFO L82 PathProgramCache]: Analyzing trace with hash 647556458, now seen corresponding path program 1 times [2019-09-08 12:52:20,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:20,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:20,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:20,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:20,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:21,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:21,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:52:21,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:52:21,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:52:21,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:52:21,152 INFO L87 Difference]: Start difference. First operand 2766 states and 3897 transitions. Second operand 9 states. [2019-09-08 12:52:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:29,111 INFO L93 Difference]: Finished difference Result 4789 states and 6776 transitions. [2019-09-08 12:52:29,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:52:29,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:52:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:29,116 INFO L225 Difference]: With dead ends: 4789 [2019-09-08 12:52:29,116 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:52:29,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:29,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:52:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:52:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:52:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3896 transitions. [2019-09-08 12:52:29,476 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3896 transitions. Word has length 135 [2019-09-08 12:52:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:29,477 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3896 transitions. [2019-09-08 12:52:29,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:52:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3896 transitions. [2019-09-08 12:52:29,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:52:29,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:29,479 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:29,479 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:29,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:29,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1300493919, now seen corresponding path program 1 times [2019-09-08 12:52:29,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:29,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:29,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:29,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:29,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:29,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:29,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:52:29,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:52:29,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:52:29,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:52:29,679 INFO L87 Difference]: Start difference. First operand 2766 states and 3896 transitions. Second operand 9 states. [2019-09-08 12:52:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:36,928 INFO L93 Difference]: Finished difference Result 4784 states and 6770 transitions. [2019-09-08 12:52:36,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:52:36,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:52:36,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:36,933 INFO L225 Difference]: With dead ends: 4784 [2019-09-08 12:52:36,933 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:52:36,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:36,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:52:37,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:52:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:52:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3895 transitions. [2019-09-08 12:52:37,296 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3895 transitions. Word has length 135 [2019-09-08 12:52:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:37,297 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3895 transitions. [2019-09-08 12:52:37,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:52:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3895 transitions. [2019-09-08 12:52:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:52:37,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:37,299 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:37,299 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:37,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:37,299 INFO L82 PathProgramCache]: Analyzing trace with hash 918178650, now seen corresponding path program 1 times [2019-09-08 12:52:37,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:37,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:37,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:37,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:37,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:37,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:37,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:52:37,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:52:37,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:52:37,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:52:37,491 INFO L87 Difference]: Start difference. First operand 2766 states and 3895 transitions. Second operand 9 states. [2019-09-08 12:52:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:45,356 INFO L93 Difference]: Finished difference Result 4789 states and 6774 transitions. [2019-09-08 12:52:45,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:52:45,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:52:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:45,361 INFO L225 Difference]: With dead ends: 4789 [2019-09-08 12:52:45,361 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:52:45,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:45,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:52:45,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:52:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:52:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3894 transitions. [2019-09-08 12:52:45,787 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3894 transitions. Word has length 135 [2019-09-08 12:52:45,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:45,787 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3894 transitions. [2019-09-08 12:52:45,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:52:45,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3894 transitions. [2019-09-08 12:52:45,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:52:45,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:45,789 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:45,790 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:45,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:45,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1625740784, now seen corresponding path program 1 times [2019-09-08 12:52:45,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:45,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:45,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:45,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:45,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:46,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:46,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:52:46,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:52:46,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:52:46,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:52:46,010 INFO L87 Difference]: Start difference. First operand 2766 states and 3894 transitions. Second operand 9 states. [2019-09-08 12:52:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:52,798 INFO L93 Difference]: Finished difference Result 4784 states and 6767 transitions. [2019-09-08 12:52:52,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:52:52,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:52:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:52,803 INFO L225 Difference]: With dead ends: 4784 [2019-09-08 12:52:52,803 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:52:52,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:52:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:52:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:52:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3893 transitions. [2019-09-08 12:52:53,181 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3893 transitions. Word has length 135 [2019-09-08 12:52:53,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:53,181 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3893 transitions. [2019-09-08 12:52:53,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:52:53,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3893 transitions. [2019-09-08 12:52:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:52:53,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:53,183 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:53,184 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:53,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:53,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1825339865, now seen corresponding path program 1 times [2019-09-08 12:52:53,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:53,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:53,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:53,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:53,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:53,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:53,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:52:53,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:52:53,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:52:53,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:52:53,384 INFO L87 Difference]: Start difference. First operand 2766 states and 3893 transitions. Second operand 9 states. [2019-09-08 12:53:00,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:00,650 INFO L93 Difference]: Finished difference Result 4784 states and 6765 transitions. [2019-09-08 12:53:00,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:00,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:53:00,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:00,655 INFO L225 Difference]: With dead ends: 4784 [2019-09-08 12:53:00,656 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:53:00,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:53:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:53:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:53:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:53:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3892 transitions. [2019-09-08 12:53:01,035 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3892 transitions. Word has length 135 [2019-09-08 12:53:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:01,035 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3892 transitions. [2019-09-08 12:53:01,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3892 transitions. [2019-09-08 12:53:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:53:01,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:01,037 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:01,038 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:01,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:01,038 INFO L82 PathProgramCache]: Analyzing trace with hash 2087701418, now seen corresponding path program 1 times [2019-09-08 12:53:01,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:01,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:01,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:01,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:01,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:01,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:01,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:01,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:01,224 INFO L87 Difference]: Start difference. First operand 2766 states and 3892 transitions. Second operand 9 states. [2019-09-08 12:53:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:08,962 INFO L93 Difference]: Finished difference Result 4789 states and 6769 transitions. [2019-09-08 12:53:08,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:08,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:53:08,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:08,967 INFO L225 Difference]: With dead ends: 4789 [2019-09-08 12:53:08,968 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:53:08,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:53:08,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:53:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:53:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:53:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3891 transitions. [2019-09-08 12:53:09,350 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3891 transitions. Word has length 135 [2019-09-08 12:53:09,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:09,350 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3891 transitions. [2019-09-08 12:53:09,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3891 transitions. [2019-09-08 12:53:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:53:09,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:09,353 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:09,354 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:09,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash 144242291, now seen corresponding path program 1 times [2019-09-08 12:53:09,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:09,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:09,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:09,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:09,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:09,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:09,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:09,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:09,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:09,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:09,564 INFO L87 Difference]: Start difference. First operand 2766 states and 3891 transitions. Second operand 9 states. [2019-09-08 12:53:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:16,088 INFO L93 Difference]: Finished difference Result 4674 states and 6585 transitions. [2019-09-08 12:53:16,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:16,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:53:16,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:16,093 INFO L225 Difference]: With dead ends: 4674 [2019-09-08 12:53:16,094 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:53:16,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:53:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:53:16,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:53:16,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:53:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3890 transitions. [2019-09-08 12:53:16,482 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3890 transitions. Word has length 136 [2019-09-08 12:53:16,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:16,483 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3890 transitions. [2019-09-08 12:53:16,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:16,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3890 transitions. [2019-09-08 12:53:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:53:16,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:16,486 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:16,486 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:16,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:16,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1686864049, now seen corresponding path program 1 times [2019-09-08 12:53:16,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:16,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:16,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:16,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:16,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:16,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:16,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:16,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:16,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:16,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:16,690 INFO L87 Difference]: Start difference. First operand 2766 states and 3890 transitions. Second operand 9 states. [2019-09-08 12:53:23,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:23,164 INFO L93 Difference]: Finished difference Result 4684 states and 6596 transitions. [2019-09-08 12:53:23,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:23,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:53:23,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:23,170 INFO L225 Difference]: With dead ends: 4684 [2019-09-08 12:53:23,170 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:53:23,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:53:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:53:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:53:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:53:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3888 transitions. [2019-09-08 12:53:23,565 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3888 transitions. Word has length 137 [2019-09-08 12:53:23,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:23,565 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3888 transitions. [2019-09-08 12:53:23,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3888 transitions. [2019-09-08 12:53:23,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:53:23,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:23,569 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:23,569 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:23,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:23,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2049773003, now seen corresponding path program 1 times [2019-09-08 12:53:23,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:23,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:23,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:23,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:23,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:23,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:23,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:23,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:23,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:23,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:23,775 INFO L87 Difference]: Start difference. First operand 2766 states and 3888 transitions. Second operand 9 states. [2019-09-08 12:53:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:30,219 INFO L93 Difference]: Finished difference Result 4686 states and 6595 transitions. [2019-09-08 12:53:30,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:30,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:53:30,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:30,225 INFO L225 Difference]: With dead ends: 4686 [2019-09-08 12:53:30,226 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:53:30,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:53:30,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:53:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:53:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:53:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3886 transitions. [2019-09-08 12:53:30,628 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3886 transitions. Word has length 137 [2019-09-08 12:53:30,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:30,628 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3886 transitions. [2019-09-08 12:53:30,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:30,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3886 transitions. [2019-09-08 12:53:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:53:30,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:30,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:30,631 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:30,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:30,632 INFO L82 PathProgramCache]: Analyzing trace with hash -736196611, now seen corresponding path program 1 times [2019-09-08 12:53:30,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:30,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:30,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:30,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:30,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:30,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:30,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:30,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:30,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:30,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:30,845 INFO L87 Difference]: Start difference. First operand 2766 states and 3886 transitions. Second operand 9 states. [2019-09-08 12:53:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:37,822 INFO L93 Difference]: Finished difference Result 4686 states and 6591 transitions. [2019-09-08 12:53:37,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:37,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:53:37,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:37,828 INFO L225 Difference]: With dead ends: 4686 [2019-09-08 12:53:37,828 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:53:37,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:53:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:53:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:53:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:53:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3884 transitions. [2019-09-08 12:53:38,248 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3884 transitions. Word has length 137 [2019-09-08 12:53:38,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:38,248 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3884 transitions. [2019-09-08 12:53:38,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3884 transitions. [2019-09-08 12:53:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:53:38,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:38,251 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:38,251 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:38,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:38,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2086215576, now seen corresponding path program 1 times [2019-09-08 12:53:38,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:38,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:38,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:38,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:38,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:38,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:38,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:38,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:38,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:38,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:38,452 INFO L87 Difference]: Start difference. First operand 2766 states and 3884 transitions. Second operand 9 states. [2019-09-08 12:53:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:46,039 INFO L93 Difference]: Finished difference Result 4808 states and 6780 transitions. [2019-09-08 12:53:46,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:46,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:53:46,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:46,044 INFO L225 Difference]: With dead ends: 4808 [2019-09-08 12:53:46,044 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:53:46,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:53:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:53:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:53:46,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:53:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3882 transitions. [2019-09-08 12:53:46,451 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3882 transitions. Word has length 137 [2019-09-08 12:53:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:46,451 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3882 transitions. [2019-09-08 12:53:46,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3882 transitions. [2019-09-08 12:53:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:53:46,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:46,454 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:46,454 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:46,454 INFO L82 PathProgramCache]: Analyzing trace with hash -697623189, now seen corresponding path program 1 times [2019-09-08 12:53:46,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:46,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:46,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:46,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:46,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:46,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:46,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:46,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:46,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:46,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:46,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:46,658 INFO L87 Difference]: Start difference. First operand 2766 states and 3882 transitions. Second operand 9 states. [2019-09-08 12:53:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:53,712 INFO L93 Difference]: Finished difference Result 4682 states and 6584 transitions. [2019-09-08 12:53:53,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:53,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:53:53,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:53,717 INFO L225 Difference]: With dead ends: 4682 [2019-09-08 12:53:53,717 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:53:53,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:53:53,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:53:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:53:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:53:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3880 transitions. [2019-09-08 12:53:54,132 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3880 transitions. Word has length 137 [2019-09-08 12:53:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:54,132 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3880 transitions. [2019-09-08 12:53:54,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3880 transitions. [2019-09-08 12:53:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:53:54,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:54,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:54,134 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:54,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:54,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2077693142, now seen corresponding path program 1 times [2019-09-08 12:53:54,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:54,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:54,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:54,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:54,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:54,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:54,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:54,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:54,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:54,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:54,354 INFO L87 Difference]: Start difference. First operand 2766 states and 3880 transitions. Second operand 9 states. [2019-09-08 12:54:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:01,642 INFO L93 Difference]: Finished difference Result 4684 states and 6584 transitions. [2019-09-08 12:54:01,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:01,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:54:01,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:01,646 INFO L225 Difference]: With dead ends: 4684 [2019-09-08 12:54:01,646 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:54:01,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:54:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:54:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:54:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:54:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3878 transitions. [2019-09-08 12:54:02,064 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3878 transitions. Word has length 137 [2019-09-08 12:54:02,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:02,064 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3878 transitions. [2019-09-08 12:54:02,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3878 transitions. [2019-09-08 12:54:02,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:54:02,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:02,066 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:02,067 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:02,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:02,067 INFO L82 PathProgramCache]: Analyzing trace with hash 444186417, now seen corresponding path program 1 times [2019-09-08 12:54:02,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:02,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:02,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:02,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:02,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:02,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:02,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:02,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:02,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:02,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:02,264 INFO L87 Difference]: Start difference. First operand 2766 states and 3878 transitions. Second operand 9 states. [2019-09-08 12:54:09,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:09,883 INFO L93 Difference]: Finished difference Result 4808 states and 6775 transitions. [2019-09-08 12:54:09,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:09,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:54:09,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:09,888 INFO L225 Difference]: With dead ends: 4808 [2019-09-08 12:54:09,888 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:54:09,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:54:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:54:10,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:54:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:54:10,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3876 transitions. [2019-09-08 12:54:10,309 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3876 transitions. Word has length 137 [2019-09-08 12:54:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:10,309 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3876 transitions. [2019-09-08 12:54:10,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3876 transitions. [2019-09-08 12:54:10,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:54:10,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:10,312 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:10,312 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:10,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:10,312 INFO L82 PathProgramCache]: Analyzing trace with hash -55425074, now seen corresponding path program 1 times [2019-09-08 12:54:10,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:10,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:10,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:10,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:10,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:10,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:10,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:10,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:10,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:10,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:10,512 INFO L87 Difference]: Start difference. First operand 2766 states and 3876 transitions. Second operand 9 states. [2019-09-08 12:54:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:17,270 INFO L93 Difference]: Finished difference Result 4684 states and 6578 transitions. [2019-09-08 12:54:17,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:17,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:54:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:17,274 INFO L225 Difference]: With dead ends: 4684 [2019-09-08 12:54:17,274 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:54:17,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:54:17,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:54:17,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:54:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:54:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3874 transitions. [2019-09-08 12:54:17,699 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3874 transitions. Word has length 137 [2019-09-08 12:54:17,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:17,699 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3874 transitions. [2019-09-08 12:54:17,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:17,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3874 transitions. [2019-09-08 12:54:17,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:54:17,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:17,702 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:17,702 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:17,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:17,702 INFO L82 PathProgramCache]: Analyzing trace with hash -802138012, now seen corresponding path program 1 times [2019-09-08 12:54:17,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:17,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:17,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:17,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:17,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:17,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:17,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:17,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:17,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:17,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:17,898 INFO L87 Difference]: Start difference. First operand 2766 states and 3874 transitions. Second operand 9 states. [2019-09-08 12:54:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:25,387 INFO L93 Difference]: Finished difference Result 4808 states and 6767 transitions. [2019-09-08 12:54:25,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:25,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:54:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:25,391 INFO L225 Difference]: With dead ends: 4808 [2019-09-08 12:54:25,391 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:54:25,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:54:25,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:54:25,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:54:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:54:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3872 transitions. [2019-09-08 12:54:25,828 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3872 transitions. Word has length 137 [2019-09-08 12:54:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:25,828 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3872 transitions. [2019-09-08 12:54:25,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3872 transitions. [2019-09-08 12:54:25,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:54:25,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:25,831 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:25,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:25,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1721277275, now seen corresponding path program 1 times [2019-09-08 12:54:25,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:25,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:25,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:25,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:25,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:26,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:26,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:26,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:26,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:26,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:26,017 INFO L87 Difference]: Start difference. First operand 2766 states and 3872 transitions. Second operand 9 states. [2019-09-08 12:54:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:33,403 INFO L93 Difference]: Finished difference Result 4684 states and 6574 transitions. [2019-09-08 12:54:33,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:33,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:54:33,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:33,409 INFO L225 Difference]: With dead ends: 4684 [2019-09-08 12:54:33,409 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:54:33,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:54:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:54:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:54:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:54:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3870 transitions. [2019-09-08 12:54:33,919 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3870 transitions. Word has length 137 [2019-09-08 12:54:33,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:33,919 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3870 transitions. [2019-09-08 12:54:33,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3870 transitions. [2019-09-08 12:54:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:54:33,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:33,922 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:33,922 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:33,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:33,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1897729281, now seen corresponding path program 1 times [2019-09-08 12:54:33,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:33,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:33,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:33,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:33,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:34,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:34,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:34,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:34,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:34,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:34,127 INFO L87 Difference]: Start difference. First operand 2766 states and 3870 transitions. Second operand 9 states. [2019-09-08 12:54:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:41,821 INFO L93 Difference]: Finished difference Result 4682 states and 6570 transitions. [2019-09-08 12:54:41,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:41,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:54:41,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:41,826 INFO L225 Difference]: With dead ends: 4682 [2019-09-08 12:54:41,827 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:54:41,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:54:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:54:42,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:54:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:54:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3868 transitions. [2019-09-08 12:54:42,352 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3868 transitions. Word has length 137 [2019-09-08 12:54:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:42,352 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3868 transitions. [2019-09-08 12:54:42,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3868 transitions. [2019-09-08 12:54:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:54:42,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:42,354 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:42,355 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:42,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:42,355 INFO L82 PathProgramCache]: Analyzing trace with hash -300990793, now seen corresponding path program 1 times [2019-09-08 12:54:42,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:42,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:42,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:42,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:42,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:42,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:42,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:42,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:42,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:42,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:42,557 INFO L87 Difference]: Start difference. First operand 2766 states and 3868 transitions. Second operand 9 states. [2019-09-08 12:54:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:50,201 INFO L93 Difference]: Finished difference Result 4684 states and 6570 transitions. [2019-09-08 12:54:50,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:50,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:54:50,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:50,206 INFO L225 Difference]: With dead ends: 4684 [2019-09-08 12:54:50,206 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:54:50,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:54:50,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:54:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:54:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:54:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3866 transitions. [2019-09-08 12:54:50,656 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3866 transitions. Word has length 137 [2019-09-08 12:54:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:50,656 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3866 transitions. [2019-09-08 12:54:50,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:50,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3866 transitions. [2019-09-08 12:54:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:54:50,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:50,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:50,659 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:50,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:50,659 INFO L82 PathProgramCache]: Analyzing trace with hash -309521725, now seen corresponding path program 1 times [2019-09-08 12:54:50,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:50,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:50,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:50,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:50,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:50,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:50,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:50,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:50,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:50,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:50,866 INFO L87 Difference]: Start difference. First operand 2766 states and 3866 transitions. Second operand 9 states. [2019-09-08 12:54:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:57,924 INFO L93 Difference]: Finished difference Result 4682 states and 6564 transitions. [2019-09-08 12:54:57,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:57,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:54:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:57,930 INFO L225 Difference]: With dead ends: 4682 [2019-09-08 12:54:57,930 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:54:57,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:54:57,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:54:58,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:54:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:54:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3864 transitions. [2019-09-08 12:54:58,397 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3864 transitions. Word has length 137 [2019-09-08 12:54:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:58,398 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3864 transitions. [2019-09-08 12:54:58,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3864 transitions. [2019-09-08 12:54:58,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:54:58,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:58,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:58,400 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:58,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:58,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1800379711, now seen corresponding path program 1 times [2019-09-08 12:54:58,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:58,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:58,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:58,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:58,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:58,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:58,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:58,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:58,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:58,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:58,598 INFO L87 Difference]: Start difference. First operand 2766 states and 3864 transitions. Second operand 9 states. [2019-09-08 12:55:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:05,483 INFO L93 Difference]: Finished difference Result 4684 states and 6564 transitions. [2019-09-08 12:55:05,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:55:05,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:55:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:05,488 INFO L225 Difference]: With dead ends: 4684 [2019-09-08 12:55:05,488 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:55:05,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:55:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:55:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:55:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:55:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3862 transitions. [2019-09-08 12:55:05,960 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3862 transitions. Word has length 137 [2019-09-08 12:55:05,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:05,961 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3862 transitions. [2019-09-08 12:55:05,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:55:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3862 transitions. [2019-09-08 12:55:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:55:05,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:05,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:05,963 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:05,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:05,964 INFO L82 PathProgramCache]: Analyzing trace with hash -919121388, now seen corresponding path program 1 times [2019-09-08 12:55:05,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:05,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:05,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:05,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:05,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:06,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:06,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:55:06,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:55:06,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:55:06,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:55:06,165 INFO L87 Difference]: Start difference. First operand 2766 states and 3862 transitions. Second operand 9 states. [2019-09-08 12:55:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:13,693 INFO L93 Difference]: Finished difference Result 4682 states and 6558 transitions. [2019-09-08 12:55:13,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:55:13,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:55:13,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:13,697 INFO L225 Difference]: With dead ends: 4682 [2019-09-08 12:55:13,697 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:55:13,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:55:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:55:14,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:55:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:55:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3860 transitions. [2019-09-08 12:55:14,159 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3860 transitions. Word has length 137 [2019-09-08 12:55:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:14,159 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3860 transitions. [2019-09-08 12:55:14,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:55:14,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3860 transitions. [2019-09-08 12:55:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:55:14,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:14,162 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:14,162 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:14,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1698314947, now seen corresponding path program 1 times [2019-09-08 12:55:14,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:14,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:14,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:14,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:14,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:14,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:14,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:55:14,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:55:14,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:55:14,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:55:14,366 INFO L87 Difference]: Start difference. First operand 2766 states and 3860 transitions. Second operand 9 states. [2019-09-08 12:55:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:22,223 INFO L93 Difference]: Finished difference Result 4942 states and 6934 transitions. [2019-09-08 12:55:22,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:55:22,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:55:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:22,227 INFO L225 Difference]: With dead ends: 4942 [2019-09-08 12:55:22,228 INFO L226 Difference]: Without dead ends: 4622 [2019-09-08 12:55:22,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:55:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-09-08 12:55:22,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2766. [2019-09-08 12:55:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:55:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3858 transitions. [2019-09-08 12:55:22,692 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3858 transitions. Word has length 137 [2019-09-08 12:55:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:22,692 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3858 transitions. [2019-09-08 12:55:22,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:55:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3858 transitions. [2019-09-08 12:55:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:55:22,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:22,694 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:22,694 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:22,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:22,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1245069544, now seen corresponding path program 1 times [2019-09-08 12:55:22,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:22,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:22,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:22,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:22,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:22,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:22,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:55:22,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:55:22,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:55:22,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:55:22,915 INFO L87 Difference]: Start difference. First operand 2766 states and 3858 transitions. Second operand 9 states. [2019-09-08 12:55:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:29,888 INFO L93 Difference]: Finished difference Result 4820 states and 6759 transitions. [2019-09-08 12:55:29,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:55:29,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:55:29,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:29,892 INFO L225 Difference]: With dead ends: 4820 [2019-09-08 12:55:29,892 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:55:29,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:55:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:55:30,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:55:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:55:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3856 transitions. [2019-09-08 12:55:30,363 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3856 transitions. Word has length 137 [2019-09-08 12:55:30,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:30,363 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3856 transitions. [2019-09-08 12:55:30,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:55:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3856 transitions. [2019-09-08 12:55:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:55:30,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:30,366 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:30,366 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:30,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:30,366 INFO L82 PathProgramCache]: Analyzing trace with hash 813537713, now seen corresponding path program 1 times [2019-09-08 12:55:30,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:30,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:30,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:30,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:30,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:30,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:30,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:55:30,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:55:30,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:55:30,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:55:30,554 INFO L87 Difference]: Start difference. First operand 2766 states and 3856 transitions. Second operand 9 states. [2019-09-08 12:55:37,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:37,988 INFO L93 Difference]: Finished difference Result 4690 states and 6559 transitions. [2019-09-08 12:55:37,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:55:37,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:55:37,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:37,992 INFO L225 Difference]: With dead ends: 4690 [2019-09-08 12:55:37,993 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:55:37,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:55:37,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:55:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:55:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:55:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3854 transitions. [2019-09-08 12:55:38,474 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3854 transitions. Word has length 137 [2019-09-08 12:55:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:38,474 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3854 transitions. [2019-09-08 12:55:38,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:55:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3854 transitions. [2019-09-08 12:55:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:55:38,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:38,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:38,477 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:38,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:38,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1206644294, now seen corresponding path program 1 times [2019-09-08 12:55:38,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:38,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:38,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:38,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:38,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:38,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:38,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:55:38,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:55:38,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:55:38,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:55:38,727 INFO L87 Difference]: Start difference. First operand 2766 states and 3854 transitions. Second operand 9 states. [2019-09-08 12:55:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:45,794 INFO L93 Difference]: Finished difference Result 4820 states and 6755 transitions. [2019-09-08 12:55:45,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:55:45,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:55:45,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:45,799 INFO L225 Difference]: With dead ends: 4820 [2019-09-08 12:55:45,800 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:55:45,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:55:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:55:46,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:55:46,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:55:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3852 transitions. [2019-09-08 12:55:46,338 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3852 transitions. Word has length 137 [2019-09-08 12:55:46,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:46,339 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3852 transitions. [2019-09-08 12:55:46,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:55:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3852 transitions. [2019-09-08 12:55:46,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:55:46,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:46,342 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:46,342 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:46,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:46,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1336095039, now seen corresponding path program 1 times [2019-09-08 12:55:46,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:46,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:46,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:46,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:46,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:46,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:46,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:46,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:55:46,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:55:46,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:55:46,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:55:46,536 INFO L87 Difference]: Start difference. First operand 2766 states and 3852 transitions. Second operand 9 states. [2019-09-08 12:55:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:53,775 INFO L93 Difference]: Finished difference Result 4690 states and 6555 transitions. [2019-09-08 12:55:53,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:55:53,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:55:53,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:53,780 INFO L225 Difference]: With dead ends: 4690 [2019-09-08 12:55:53,780 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:55:53,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:55:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:55:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:55:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:55:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3850 transitions. [2019-09-08 12:55:54,296 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3850 transitions. Word has length 137 [2019-09-08 12:55:54,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:54,296 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3850 transitions. [2019-09-08 12:55:54,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:55:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3850 transitions. [2019-09-08 12:55:54,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:55:54,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:54,300 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:54,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:54,300 INFO L82 PathProgramCache]: Analyzing trace with hash -332508341, now seen corresponding path program 1 times [2019-09-08 12:55:54,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:54,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:54,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:54,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:54,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:54,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:54,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:55:54,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:55:54,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:55:54,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:55:54,571 INFO L87 Difference]: Start difference. First operand 2766 states and 3850 transitions. Second operand 9 states. [2019-09-08 12:56:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:01,890 INFO L93 Difference]: Finished difference Result 4690 states and 6553 transitions. [2019-09-08 12:56:01,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:56:01,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:56:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:01,896 INFO L225 Difference]: With dead ends: 4690 [2019-09-08 12:56:01,896 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:56:01,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:56:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:56:02,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:56:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:56:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3848 transitions. [2019-09-08 12:56:02,402 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3848 transitions. Word has length 137 [2019-09-08 12:56:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:02,403 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3848 transitions. [2019-09-08 12:56:02,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3848 transitions. [2019-09-08 12:56:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:56:02,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:02,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:02,406 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:02,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:02,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1766393205, now seen corresponding path program 1 times [2019-09-08 12:56:02,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:02,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:02,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:02,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:02,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:02,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:02,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:56:02,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:56:02,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:56:02,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:56:02,607 INFO L87 Difference]: Start difference. First operand 2766 states and 3848 transitions. Second operand 9 states. [2019-09-08 12:56:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:10,045 INFO L93 Difference]: Finished difference Result 4684 states and 6542 transitions. [2019-09-08 12:56:10,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:56:10,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:56:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:10,052 INFO L225 Difference]: With dead ends: 4684 [2019-09-08 12:56:10,052 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:56:10,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:56:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:56:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:56:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:56:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3846 transitions. [2019-09-08 12:56:10,609 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3846 transitions. Word has length 137 [2019-09-08 12:56:10,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:10,609 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3846 transitions. [2019-09-08 12:56:10,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3846 transitions. [2019-09-08 12:56:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:56:10,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:10,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:10,612 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:10,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:10,612 INFO L82 PathProgramCache]: Analyzing trace with hash 36725900, now seen corresponding path program 1 times [2019-09-08 12:56:10,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:10,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:10,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:10,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:10,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:10,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:10,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:56:10,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:56:10,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:56:10,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:56:10,801 INFO L87 Difference]: Start difference. First operand 2766 states and 3846 transitions. Second operand 9 states. [2019-09-08 12:56:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:18,561 INFO L93 Difference]: Finished difference Result 4820 states and 6741 transitions. [2019-09-08 12:56:18,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:56:18,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:56:18,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:18,565 INFO L225 Difference]: With dead ends: 4820 [2019-09-08 12:56:18,565 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:56:18,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:56:18,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:56:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:56:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:56:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3844 transitions. [2019-09-08 12:56:19,072 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3844 transitions. Word has length 137 [2019-09-08 12:56:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:19,072 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3844 transitions. [2019-09-08 12:56:19,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:19,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3844 transitions. [2019-09-08 12:56:19,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:56:19,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:19,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:19,076 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:19,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:19,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2095333157, now seen corresponding path program 1 times [2019-09-08 12:56:19,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:19,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:19,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:19,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:19,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:19,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:19,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:56:19,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:56:19,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:56:19,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:56:19,283 INFO L87 Difference]: Start difference. First operand 2766 states and 3844 transitions. Second operand 9 states. [2019-09-08 12:56:26,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:26,707 INFO L93 Difference]: Finished difference Result 4690 states and 6545 transitions. [2019-09-08 12:56:26,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:56:26,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:56:26,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:26,711 INFO L225 Difference]: With dead ends: 4690 [2019-09-08 12:56:26,711 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:56:26,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:56:26,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:56:27,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:56:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:56:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3842 transitions. [2019-09-08 12:56:27,232 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3842 transitions. Word has length 137 [2019-09-08 12:56:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:27,232 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3842 transitions. [2019-09-08 12:56:27,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3842 transitions. [2019-09-08 12:56:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:56:27,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:27,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:27,235 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:27,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:27,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1769781830, now seen corresponding path program 1 times [2019-09-08 12:56:27,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:27,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:27,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:27,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:27,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:27,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:27,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:27,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:56:27,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:56:27,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:56:27,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:56:27,436 INFO L87 Difference]: Start difference. First operand 2766 states and 3842 transitions. Second operand 9 states. [2019-09-08 12:56:35,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:35,110 INFO L93 Difference]: Finished difference Result 4684 states and 6536 transitions. [2019-09-08 12:56:35,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:56:35,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:56:35,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:35,114 INFO L225 Difference]: With dead ends: 4684 [2019-09-08 12:56:35,114 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:56:35,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:56:35,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:56:35,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:56:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:56:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3840 transitions. [2019-09-08 12:56:35,630 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3840 transitions. Word has length 137 [2019-09-08 12:56:35,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:35,630 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3840 transitions. [2019-09-08 12:56:35,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:35,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3840 transitions. [2019-09-08 12:56:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:56:35,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:35,633 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:35,633 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:35,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash 426729777, now seen corresponding path program 1 times [2019-09-08 12:56:35,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:35,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:35,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:35,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:35,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:56:35,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:56:35,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:56:35,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:56:35,833 INFO L87 Difference]: Start difference. First operand 2766 states and 3840 transitions. Second operand 9 states. [2019-09-08 12:56:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:43,193 INFO L93 Difference]: Finished difference Result 4690 states and 6541 transitions. [2019-09-08 12:56:43,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:56:43,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:56:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:43,199 INFO L225 Difference]: With dead ends: 4690 [2019-09-08 12:56:43,199 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:56:43,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:56:43,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:56:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:56:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:56:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3838 transitions. [2019-09-08 12:56:43,762 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3838 transitions. Word has length 137 [2019-09-08 12:56:43,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:43,763 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3838 transitions. [2019-09-08 12:56:43,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3838 transitions. [2019-09-08 12:56:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:56:43,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:43,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:43,765 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:43,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:43,766 INFO L82 PathProgramCache]: Analyzing trace with hash 129006585, now seen corresponding path program 1 times [2019-09-08 12:56:43,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:43,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:43,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:43,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:43,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:43,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:43,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:56:43,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:56:43,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:56:43,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:56:43,960 INFO L87 Difference]: Start difference. First operand 2766 states and 3838 transitions. Second operand 9 states. [2019-09-08 12:56:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:51,479 INFO L93 Difference]: Finished difference Result 4684 states and 6530 transitions. [2019-09-08 12:56:51,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:56:51,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:56:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:51,484 INFO L225 Difference]: With dead ends: 4684 [2019-09-08 12:56:51,484 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:56:51,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:56:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:56:52,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:56:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:56:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3836 transitions. [2019-09-08 12:56:52,065 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3836 transitions. Word has length 137 [2019-09-08 12:56:52,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:52,066 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3836 transitions. [2019-09-08 12:56:52,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3836 transitions. [2019-09-08 12:56:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:56:52,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:52,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:52,068 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:52,068 INFO L82 PathProgramCache]: Analyzing trace with hash -352527193, now seen corresponding path program 1 times [2019-09-08 12:56:52,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:52,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:52,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:52,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:52,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:52,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:52,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:52,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:56:52,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:56:52,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:56:52,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:56:52,253 INFO L87 Difference]: Start difference. First operand 2766 states and 3836 transitions. Second operand 9 states. [2019-09-08 12:57:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:00,404 INFO L93 Difference]: Finished difference Result 4812 states and 6719 transitions. [2019-09-08 12:57:00,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:57:00,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:57:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:00,410 INFO L225 Difference]: With dead ends: 4812 [2019-09-08 12:57:00,410 INFO L226 Difference]: Without dead ends: 4574 [2019-09-08 12:57:00,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:57:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-09-08 12:57:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 2766. [2019-09-08 12:57:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:57:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3834 transitions. [2019-09-08 12:57:00,970 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3834 transitions. Word has length 137 [2019-09-08 12:57:00,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:00,971 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3834 transitions. [2019-09-08 12:57:00,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:57:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3834 transitions. [2019-09-08 12:57:00,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:57:00,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:00,975 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:00,975 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:00,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:00,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852232, now seen corresponding path program 1 times [2019-09-08 12:57:00,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:00,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:00,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:00,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:00,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:01,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:01,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:01,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:01,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:01,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:01,165 INFO L87 Difference]: Start difference. First operand 2766 states and 3834 transitions. Second operand 9 states. [2019-09-08 12:57:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:08,740 INFO L93 Difference]: Finished difference Result 4675 states and 6512 transitions. [2019-09-08 12:57:08,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:57:08,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:57:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:08,746 INFO L225 Difference]: With dead ends: 4675 [2019-09-08 12:57:08,746 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:57:08,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:57:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:57:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:57:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:57:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3833 transitions. [2019-09-08 12:57:09,275 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3833 transitions. Word has length 137 [2019-09-08 12:57:09,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:09,276 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3833 transitions. [2019-09-08 12:57:09,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:57:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3833 transitions. [2019-09-08 12:57:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:57:09,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:09,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:09,278 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:09,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2043120089, now seen corresponding path program 1 times [2019-09-08 12:57:09,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:09,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:09,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:09,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:09,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:09,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:09,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:09,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:09,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:09,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:09,471 INFO L87 Difference]: Start difference. First operand 2766 states and 3833 transitions. Second operand 9 states. [2019-09-08 12:57:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:16,819 INFO L93 Difference]: Finished difference Result 4676 states and 6512 transitions. [2019-09-08 12:57:16,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:57:16,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:57:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:16,824 INFO L225 Difference]: With dead ends: 4676 [2019-09-08 12:57:16,824 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:57:16,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:57:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:57:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:57:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:57:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3832 transitions. [2019-09-08 12:57:17,355 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3832 transitions. Word has length 137 [2019-09-08 12:57:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:17,355 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3832 transitions. [2019-09-08 12:57:17,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:57:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3832 transitions. [2019-09-08 12:57:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:57:17,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:17,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:17,358 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:17,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:17,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1751515401, now seen corresponding path program 1 times [2019-09-08 12:57:17,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:17,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:17,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:17,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:17,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:17,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:17,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:17,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:17,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:17,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:17,555 INFO L87 Difference]: Start difference. First operand 2766 states and 3832 transitions. Second operand 9 states. [2019-09-08 12:57:25,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:25,242 INFO L93 Difference]: Finished difference Result 4675 states and 6509 transitions. [2019-09-08 12:57:25,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:57:25,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:57:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:25,247 INFO L225 Difference]: With dead ends: 4675 [2019-09-08 12:57:25,247 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:57:25,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:57:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:57:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:57:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:57:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3831 transitions. [2019-09-08 12:57:25,786 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3831 transitions. Word has length 137 [2019-09-08 12:57:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:25,786 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3831 transitions. [2019-09-08 12:57:25,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:57:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3831 transitions. [2019-09-08 12:57:25,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:57:25,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:25,788 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:25,789 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:25,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:25,789 INFO L82 PathProgramCache]: Analyzing trace with hash 455078159, now seen corresponding path program 1 times [2019-09-08 12:57:25,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:25,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:25,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:25,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:25,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:25,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:25,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:25,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:25,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:25,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:25,973 INFO L87 Difference]: Start difference. First operand 2766 states and 3831 transitions. Second operand 9 states. [2019-09-08 12:57:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:33,695 INFO L93 Difference]: Finished difference Result 4675 states and 6507 transitions. [2019-09-08 12:57:33,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:57:33,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:57:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:33,700 INFO L225 Difference]: With dead ends: 4675 [2019-09-08 12:57:33,700 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:57:33,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:57:33,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:57:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:57:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:57:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3830 transitions. [2019-09-08 12:57:34,248 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3830 transitions. Word has length 137 [2019-09-08 12:57:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:34,248 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3830 transitions. [2019-09-08 12:57:34,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:57:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3830 transitions. [2019-09-08 12:57:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:57:34,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:34,251 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:34,251 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:34,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:34,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1686170407, now seen corresponding path program 1 times [2019-09-08 12:57:34,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:34,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:34,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:34,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:34,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:34,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:34,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:34,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:34,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:34,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:34,458 INFO L87 Difference]: Start difference. First operand 2766 states and 3830 transitions. Second operand 9 states. [2019-09-08 12:57:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:41,544 INFO L93 Difference]: Finished difference Result 4675 states and 6505 transitions. [2019-09-08 12:57:41,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:57:41,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:57:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:41,548 INFO L225 Difference]: With dead ends: 4675 [2019-09-08 12:57:41,548 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:57:41,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:57:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:57:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:57:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:57:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3829 transitions. [2019-09-08 12:57:42,089 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3829 transitions. Word has length 137 [2019-09-08 12:57:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:42,089 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3829 transitions. [2019-09-08 12:57:42,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:57:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3829 transitions. [2019-09-08 12:57:42,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:57:42,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:42,091 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:42,092 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:42,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:42,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1396045607, now seen corresponding path program 1 times [2019-09-08 12:57:42,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:42,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:42,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:42,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:42,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:42,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:42,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:42,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:42,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:42,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:42,292 INFO L87 Difference]: Start difference. First operand 2766 states and 3829 transitions. Second operand 9 states. [2019-09-08 12:57:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:49,482 INFO L93 Difference]: Finished difference Result 4676 states and 6505 transitions. [2019-09-08 12:57:49,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:57:49,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:57:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:49,486 INFO L225 Difference]: With dead ends: 4676 [2019-09-08 12:57:49,486 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:57:49,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:57:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:57:50,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:57:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:57:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3828 transitions. [2019-09-08 12:57:50,038 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3828 transitions. Word has length 137 [2019-09-08 12:57:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:50,038 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3828 transitions. [2019-09-08 12:57:50,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:57:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3828 transitions. [2019-09-08 12:57:50,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:57:50,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:50,040 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:50,040 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:50,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:50,041 INFO L82 PathProgramCache]: Analyzing trace with hash 70777875, now seen corresponding path program 1 times [2019-09-08 12:57:50,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:50,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:50,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:50,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:50,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:50,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:50,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:50,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:50,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:50,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:50,242 INFO L87 Difference]: Start difference. First operand 2766 states and 3828 transitions. Second operand 9 states. [2019-09-08 12:57:57,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:57,871 INFO L93 Difference]: Finished difference Result 4680 states and 6506 transitions. [2019-09-08 12:57:57,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:57:57,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:57:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:57,875 INFO L225 Difference]: With dead ends: 4680 [2019-09-08 12:57:57,876 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:57:57,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:57:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:57:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:57:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:57:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3827 transitions. [2019-09-08 12:57:58,449 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3827 transitions. Word has length 137 [2019-09-08 12:57:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:58,449 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3827 transitions. [2019-09-08 12:57:58,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:57:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3827 transitions. [2019-09-08 12:57:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:57:58,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:58,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:58,453 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:58,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:58,453 INFO L82 PathProgramCache]: Analyzing trace with hash 626222461, now seen corresponding path program 1 times [2019-09-08 12:57:58,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:58,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:58,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:58,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:58,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:58,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:58,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:58,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:58,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:58,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:58,667 INFO L87 Difference]: Start difference. First operand 2766 states and 3827 transitions. Second operand 9 states. [2019-09-08 12:58:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:05,868 INFO L93 Difference]: Finished difference Result 4676 states and 6501 transitions. [2019-09-08 12:58:05,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:58:05,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 12:58:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:05,874 INFO L225 Difference]: With dead ends: 4676 [2019-09-08 12:58:05,874 INFO L226 Difference]: Without dead ends: 4478 [2019-09-08 12:58:05,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:58:05,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-08 12:58:06,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 2766. [2019-09-08 12:58:06,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-09-08 12:58:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3826 transitions. [2019-09-08 12:58:06,485 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3826 transitions. Word has length 137 [2019-09-08 12:58:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:06,485 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3826 transitions. [2019-09-08 12:58:06,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:58:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3826 transitions. [2019-09-08 12:58:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:58:06,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:06,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:06,488 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:06,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:06,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1630188996, now seen corresponding path program 1 times [2019-09-08 12:58:06,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:06,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:06,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:06,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:06,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:06,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:06,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:58:06,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:58:06,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:58:06,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:58:06,688 INFO L87 Difference]: Start difference. First operand 2766 states and 3826 transitions. Second operand 9 states.