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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:12:46,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:12:46,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:12:46,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:12:46,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:12:46,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:12:46,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:12:46,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:12:46,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:12:46,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:12:46,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:12:46,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:12:46,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:12:46,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:12:46,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:12:46,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:12:46,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:12:46,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:12:46,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:12:46,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:12:46,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:12:46,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:12:46,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:12:46,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:12:46,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:12:46,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:12:46,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:12:46,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:12:46,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:12:46,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:12:46,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:12:46,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:12:46,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:12:46,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:12:46,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:12:46,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:12:46,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:12:46,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:12:46,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:12:46,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:12:46,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:12:46,810 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:12:46,847 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:12:46,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:12:46,848 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:12:46,848 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:12:46,851 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:12:46,851 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:12:46,851 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:12:46,851 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:12:46,851 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:12:46,852 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:12:46,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:12:46,853 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:12:46,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:12:46,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:12:46,854 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:12:46,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:12:46,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:12:46,855 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:12:46,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:12:46,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:12:46,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:12:46,856 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:12:46,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:12:46,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:12:46,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:12:46,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:12:46,857 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:12:46,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:12:46,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:12:46,857 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:12:46,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:12:46,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:12:46,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:12:46,914 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:12:46,915 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:12:46,916 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:12:46,996 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85feff282/6df2f80dd25d4aa3b55b84e5dc52a5e0/FLAG6ac711abc [2019-09-10 08:12:47,718 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:12:47,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:12:47,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85feff282/6df2f80dd25d4aa3b55b84e5dc52a5e0/FLAG6ac711abc [2019-09-10 08:12:47,791 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85feff282/6df2f80dd25d4aa3b55b84e5dc52a5e0 [2019-09-10 08:12:47,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:12:47,803 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:12:47,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:12:47,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:12:47,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:12:47,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:12:47" (1/1) ... [2019-09-10 08:12:47,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5105dca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:47, skipping insertion in model container [2019-09-10 08:12:47,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:12:47" (1/1) ... [2019-09-10 08:12:47,820 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:12:47,958 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:12:49,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:12:49,277 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:12:49,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:12:49,888 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:12:49,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:49 WrapperNode [2019-09-10 08:12:49,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:12:49,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:12:49,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:12:49,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:12:49,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:49" (1/1) ... [2019-09-10 08:12:49,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:49" (1/1) ... [2019-09-10 08:12:49,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:49" (1/1) ... [2019-09-10 08:12:49,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:49" (1/1) ... [2019-09-10 08:12:50,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:49" (1/1) ... [2019-09-10 08:12:50,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:49" (1/1) ... [2019-09-10 08:12:50,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:49" (1/1) ... [2019-09-10 08:12:50,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:12:50,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:12:50,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:12:50,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:12:50,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:49" (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-10 08:12:50,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:12:50,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:12:50,272 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:12:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:12:50,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:12:50,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:12:50,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:12:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:12:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:12:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:12:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:12:50,277 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:12:50,277 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:12:50,278 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:12:50,279 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:12:50,280 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:12:50,280 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:12:50,280 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:12:50,281 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:12:50,281 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:12:50,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:12:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:12:54,543 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:12:54,544 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:12:54,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:12:54 BoogieIcfgContainer [2019-09-10 08:12:54,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:12:54,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:12:54,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:12:54,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:12:54,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:12:47" (1/3) ... [2019-09-10 08:12:54,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793e2f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:12:54, skipping insertion in model container [2019-09-10 08:12:54,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:12:49" (2/3) ... [2019-09-10 08:12:54,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793e2f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:12:54, skipping insertion in model container [2019-09-10 08:12:54,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:12:54" (3/3) ... [2019-09-10 08:12:54,563 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:12:54,573 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:12:54,597 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-10 08:12:54,613 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-10 08:12:54,641 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:12:54,641 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:12:54,641 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:12:54,642 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:12:54,642 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:12:54,642 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:12:54,642 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:12:54,642 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:12:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states. [2019-09-10 08:12:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:12:54,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:54,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:54,715 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:54,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:54,721 INFO L82 PathProgramCache]: Analyzing trace with hash -583578649, now seen corresponding path program 1 times [2019-09-10 08:12:54,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:54,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:54,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:54,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:54,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:55,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:55,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:12:55,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:55,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:12:55,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:12:55,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:12:55,501 INFO L87 Difference]: Start difference. First operand 1129 states. Second operand 5 states. [2019-09-10 08:12:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:57,021 INFO L93 Difference]: Finished difference Result 1230 states and 2081 transitions. [2019-09-10 08:12:57,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:12:57,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-10 08:12:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:57,047 INFO L225 Difference]: With dead ends: 1230 [2019-09-10 08:12:57,047 INFO L226 Difference]: Without dead ends: 1218 [2019-09-10 08:12:57,049 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-10 08:12:57,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2019-09-10 08:12:57,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1138. [2019-09-10 08:12:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-09-10 08:12:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1527 transitions. [2019-09-10 08:12:57,192 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1527 transitions. Word has length 89 [2019-09-10 08:12:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:57,193 INFO L475 AbstractCegarLoop]: Abstraction has 1138 states and 1527 transitions. [2019-09-10 08:12:57,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:12:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1527 transitions. [2019-09-10 08:12:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:12:57,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:57,201 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:57,202 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:57,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:57,203 INFO L82 PathProgramCache]: Analyzing trace with hash -2090250761, now seen corresponding path program 1 times [2019-09-10 08:12:57,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:57,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:57,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:57,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:57,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:57,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:57,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:12:57,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:57,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:12:57,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:12:57,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:12:57,461 INFO L87 Difference]: Start difference. First operand 1138 states and 1527 transitions. Second operand 5 states. [2019-09-10 08:12:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:58,188 INFO L93 Difference]: Finished difference Result 1013 states and 1384 transitions. [2019-09-10 08:12:58,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:12:58,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-10 08:12:58,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:58,196 INFO L225 Difference]: With dead ends: 1013 [2019-09-10 08:12:58,196 INFO L226 Difference]: Without dead ends: 1013 [2019-09-10 08:12:58,197 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-10 08:12:58,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-09-10 08:12:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1013. [2019-09-10 08:12:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2019-09-10 08:12:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1384 transitions. [2019-09-10 08:12:58,224 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1384 transitions. Word has length 90 [2019-09-10 08:12:58,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:58,225 INFO L475 AbstractCegarLoop]: Abstraction has 1013 states and 1384 transitions. [2019-09-10 08:12:58,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:12:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1384 transitions. [2019-09-10 08:12:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:12:58,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:58,228 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:58,229 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:58,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:58,230 INFO L82 PathProgramCache]: Analyzing trace with hash -592131867, now seen corresponding path program 1 times [2019-09-10 08:12:58,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:58,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:58,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:58,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:58,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:58,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:58,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:12:58,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:58,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:12:58,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:12:58,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:12:58,384 INFO L87 Difference]: Start difference. First operand 1013 states and 1384 transitions. Second operand 5 states. [2019-09-10 08:12:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:59,161 INFO L93 Difference]: Finished difference Result 955 states and 1316 transitions. [2019-09-10 08:12:59,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:12:59,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 08:12:59,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:59,170 INFO L225 Difference]: With dead ends: 955 [2019-09-10 08:12:59,170 INFO L226 Difference]: Without dead ends: 955 [2019-09-10 08:12:59,171 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-10 08:12:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-09-10 08:12:59,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2019-09-10 08:12:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-09-10 08:12:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1316 transitions. [2019-09-10 08:12:59,194 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1316 transitions. Word has length 91 [2019-09-10 08:12:59,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:59,194 INFO L475 AbstractCegarLoop]: Abstraction has 955 states and 1316 transitions. [2019-09-10 08:12:59,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:12:59,195 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1316 transitions. [2019-09-10 08:12:59,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 08:12:59,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:59,198 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:59,198 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:59,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:59,199 INFO L82 PathProgramCache]: Analyzing trace with hash -21106018, now seen corresponding path program 1 times [2019-09-10 08:12:59,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:59,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:59,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:59,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:59,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:59,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:59,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:12:59,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:59,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:12:59,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:12:59,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:12:59,334 INFO L87 Difference]: Start difference. First operand 955 states and 1316 transitions. Second operand 5 states. [2019-09-10 08:13:00,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:00,067 INFO L93 Difference]: Finished difference Result 929 states and 1284 transitions. [2019-09-10 08:13:00,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:13:00,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-10 08:13:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:00,073 INFO L225 Difference]: With dead ends: 929 [2019-09-10 08:13:00,073 INFO L226 Difference]: Without dead ends: 929 [2019-09-10 08:13:00,074 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-10 08:13:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-09-10 08:13:00,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 929. [2019-09-10 08:13:00,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-09-10 08:13:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1284 transitions. [2019-09-10 08:13:00,096 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1284 transitions. Word has length 92 [2019-09-10 08:13:00,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:00,097 INFO L475 AbstractCegarLoop]: Abstraction has 929 states and 1284 transitions. [2019-09-10 08:13:00,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:13:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1284 transitions. [2019-09-10 08:13:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:13:00,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:00,100 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:00,101 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:00,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:00,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1839633213, now seen corresponding path program 1 times [2019-09-10 08:13:00,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:00,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:00,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:00,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:00,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:00,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:00,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:13:00,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:00,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:13:00,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:13:00,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:13:00,331 INFO L87 Difference]: Start difference. First operand 929 states and 1284 transitions. Second operand 5 states. [2019-09-10 08:13:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:00,963 INFO L93 Difference]: Finished difference Result 910 states and 1261 transitions. [2019-09-10 08:13:00,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:13:00,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 08:13:00,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:00,968 INFO L225 Difference]: With dead ends: 910 [2019-09-10 08:13:00,969 INFO L226 Difference]: Without dead ends: 910 [2019-09-10 08:13:00,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:13:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-09-10 08:13:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2019-09-10 08:13:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-10 08:13:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1261 transitions. [2019-09-10 08:13:00,992 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1261 transitions. Word has length 93 [2019-09-10 08:13:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:00,992 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1261 transitions. [2019-09-10 08:13:00,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:13:00,993 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1261 transitions. [2019-09-10 08:13:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:13:00,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:00,995 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:00,996 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:00,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:00,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1412961549, now seen corresponding path program 1 times [2019-09-10 08:13:00,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:00,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:00,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:00,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:00,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:01,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:01,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:13:01,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:01,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:13:01,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:13:01,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:13:01,129 INFO L87 Difference]: Start difference. First operand 910 states and 1261 transitions. Second operand 5 states. [2019-09-10 08:13:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:01,933 INFO L93 Difference]: Finished difference Result 905 states and 1253 transitions. [2019-09-10 08:13:01,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:13:01,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-10 08:13:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:01,939 INFO L225 Difference]: With dead ends: 905 [2019-09-10 08:13:01,939 INFO L226 Difference]: Without dead ends: 905 [2019-09-10 08:13:01,940 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-10 08:13:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-09-10 08:13:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 905. [2019-09-10 08:13:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1253 transitions. [2019-09-10 08:13:01,962 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1253 transitions. Word has length 94 [2019-09-10 08:13:01,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:01,963 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1253 transitions. [2019-09-10 08:13:01,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:13:01,963 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1253 transitions. [2019-09-10 08:13:01,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:13:01,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:01,966 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:01,967 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:01,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:01,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1447378303, now seen corresponding path program 1 times [2019-09-10 08:13:01,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:01,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:01,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:01,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:01,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:02,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:02,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:02,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:02,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:02,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:02,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:02,329 INFO L87 Difference]: Start difference. First operand 905 states and 1253 transitions. Second operand 9 states. [2019-09-10 08:13:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:04,594 INFO L93 Difference]: Finished difference Result 1698 states and 2383 transitions. [2019-09-10 08:13:04,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:04,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 08:13:04,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:04,605 INFO L225 Difference]: With dead ends: 1698 [2019-09-10 08:13:04,605 INFO L226 Difference]: Without dead ends: 1698 [2019-09-10 08:13:04,606 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-10 08:13:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-10 08:13:04,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-10 08:13:04,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1252 transitions. [2019-09-10 08:13:04,642 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1252 transitions. Word has length 95 [2019-09-10 08:13:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:04,642 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1252 transitions. [2019-09-10 08:13:04,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1252 transitions. [2019-09-10 08:13:04,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:13:04,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:04,645 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:04,646 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:04,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:04,646 INFO L82 PathProgramCache]: Analyzing trace with hash -102853389, now seen corresponding path program 1 times [2019-09-10 08:13:04,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:04,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:04,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:04,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:04,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:05,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:05,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:05,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:05,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:05,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:05,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:05,002 INFO L87 Difference]: Start difference. First operand 905 states and 1252 transitions. Second operand 9 states. [2019-09-10 08:13:07,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:07,803 INFO L93 Difference]: Finished difference Result 1628 states and 2278 transitions. [2019-09-10 08:13:07,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:13:07,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 08:13:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:07,813 INFO L225 Difference]: With dead ends: 1628 [2019-09-10 08:13:07,813 INFO L226 Difference]: Without dead ends: 1628 [2019-09-10 08:13:07,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:13:07,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2019-09-10 08:13:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 905. [2019-09-10 08:13:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1251 transitions. [2019-09-10 08:13:07,842 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1251 transitions. Word has length 95 [2019-09-10 08:13:07,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:07,843 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1251 transitions. [2019-09-10 08:13:07,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1251 transitions. [2019-09-10 08:13:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:13:07,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:07,846 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:07,847 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1602183325, now seen corresponding path program 1 times [2019-09-10 08:13:07,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:07,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:07,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:07,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:07,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:08,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:08,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:13:08,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:08,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:13:08,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:13:08,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:13:08,132 INFO L87 Difference]: Start difference. First operand 905 states and 1251 transitions. Second operand 8 states. [2019-09-10 08:13:09,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:09,658 INFO L93 Difference]: Finished difference Result 1226 states and 1639 transitions. [2019-09-10 08:13:09,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:13:09,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-09-10 08:13:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:09,666 INFO L225 Difference]: With dead ends: 1226 [2019-09-10 08:13:09,666 INFO L226 Difference]: Without dead ends: 1226 [2019-09-10 08:13:09,667 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-10 08:13:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2019-09-10 08:13:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 905. [2019-09-10 08:13:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1250 transitions. [2019-09-10 08:13:09,688 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1250 transitions. Word has length 95 [2019-09-10 08:13:09,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:09,688 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1250 transitions. [2019-09-10 08:13:09,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:13:09,688 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1250 transitions. [2019-09-10 08:13:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:13:09,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:09,691 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:09,691 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:09,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:09,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1113047675, now seen corresponding path program 1 times [2019-09-10 08:13:09,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:09,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:09,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:09,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:09,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:09,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:09,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:09,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:09,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:09,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:09,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:09,917 INFO L87 Difference]: Start difference. First operand 905 states and 1250 transitions. Second operand 9 states. [2019-09-10 08:13:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:12,176 INFO L93 Difference]: Finished difference Result 1674 states and 2338 transitions. [2019-09-10 08:13:12,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:12,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:13:12,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:12,185 INFO L225 Difference]: With dead ends: 1674 [2019-09-10 08:13:12,185 INFO L226 Difference]: Without dead ends: 1674 [2019-09-10 08:13:12,186 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-10 08:13:12,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-10 08:13:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-10 08:13:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1248 transitions. [2019-09-10 08:13:12,210 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1248 transitions. Word has length 97 [2019-09-10 08:13:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:12,210 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1248 transitions. [2019-09-10 08:13:12,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1248 transitions. [2019-09-10 08:13:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:13:12,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:12,213 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:12,213 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:12,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:12,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1446852495, now seen corresponding path program 1 times [2019-09-10 08:13:12,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:12,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:12,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:12,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:12,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:12,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:12,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:12,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:12,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:12,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:12,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:12,413 INFO L87 Difference]: Start difference. First operand 905 states and 1248 transitions. Second operand 9 states. [2019-09-10 08:13:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:14,489 INFO L93 Difference]: Finished difference Result 1698 states and 2373 transitions. [2019-09-10 08:13:14,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:14,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:13:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:14,499 INFO L225 Difference]: With dead ends: 1698 [2019-09-10 08:13:14,500 INFO L226 Difference]: Without dead ends: 1698 [2019-09-10 08:13:14,500 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-10 08:13:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-10 08:13:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-10 08:13:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1246 transitions. [2019-09-10 08:13:14,526 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1246 transitions. Word has length 97 [2019-09-10 08:13:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:14,526 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1246 transitions. [2019-09-10 08:13:14,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1246 transitions. [2019-09-10 08:13:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:13:14,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:14,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] [2019-09-10 08:13:14,530 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:14,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:14,530 INFO L82 PathProgramCache]: Analyzing trace with hash 794751107, now seen corresponding path program 1 times [2019-09-10 08:13:14,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:14,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:14,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:14,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:14,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:14,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:14,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:14,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:14,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:14,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:14,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:14,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:14,797 INFO L87 Difference]: Start difference. First operand 905 states and 1246 transitions. Second operand 9 states. [2019-09-10 08:13:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:17,015 INFO L93 Difference]: Finished difference Result 1674 states and 2332 transitions. [2019-09-10 08:13:17,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:17,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:13:17,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:17,024 INFO L225 Difference]: With dead ends: 1674 [2019-09-10 08:13:17,024 INFO L226 Difference]: Without dead ends: 1674 [2019-09-10 08:13:17,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:13:17,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-10 08:13:17,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-10 08:13:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1244 transitions. [2019-09-10 08:13:17,048 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1244 transitions. Word has length 97 [2019-09-10 08:13:17,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:17,048 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1244 transitions. [2019-09-10 08:13:17,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1244 transitions. [2019-09-10 08:13:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:13:17,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:17,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:17,051 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:17,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:17,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1280890073, now seen corresponding path program 1 times [2019-09-10 08:13:17,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:17,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:17,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:17,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:17,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:17,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:17,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:17,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:17,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:17,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:17,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:17,229 INFO L87 Difference]: Start difference. First operand 905 states and 1244 transitions. Second operand 9 states. [2019-09-10 08:13:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:19,500 INFO L93 Difference]: Finished difference Result 1282 states and 1803 transitions. [2019-09-10 08:13:19,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:13:19,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:13:19,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:19,507 INFO L225 Difference]: With dead ends: 1282 [2019-09-10 08:13:19,507 INFO L226 Difference]: Without dead ends: 1282 [2019-09-10 08:13:19,507 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-10 08:13:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2019-09-10 08:13:19,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 905. [2019-09-10 08:13:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1242 transitions. [2019-09-10 08:13:19,527 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1242 transitions. Word has length 97 [2019-09-10 08:13:19,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:19,527 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1242 transitions. [2019-09-10 08:13:19,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1242 transitions. [2019-09-10 08:13:19,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:13:19,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:19,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:19,531 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:19,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:19,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1541936904, now seen corresponding path program 1 times [2019-09-10 08:13:19,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:19,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:19,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:19,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:19,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:19,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:19,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:19,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:19,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:19,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:19,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:19,718 INFO L87 Difference]: Start difference. First operand 905 states and 1242 transitions. Second operand 9 states. [2019-09-10 08:13:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:21,842 INFO L93 Difference]: Finished difference Result 1674 states and 2329 transitions. [2019-09-10 08:13:21,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:21,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:13:21,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:21,856 INFO L225 Difference]: With dead ends: 1674 [2019-09-10 08:13:21,857 INFO L226 Difference]: Without dead ends: 1674 [2019-09-10 08:13:21,858 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-10 08:13:21,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-10 08:13:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-10 08:13:21,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1241 transitions. [2019-09-10 08:13:21,885 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1241 transitions. Word has length 97 [2019-09-10 08:13:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:21,886 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1241 transitions. [2019-09-10 08:13:21,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1241 transitions. [2019-09-10 08:13:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:13:21,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:21,888 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:21,889 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:21,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:21,890 INFO L82 PathProgramCache]: Analyzing trace with hash -824530987, now seen corresponding path program 1 times [2019-09-10 08:13:21,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:21,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:21,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:21,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:21,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:22,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:22,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:22,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:22,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:22,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:22,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:22,115 INFO L87 Difference]: Start difference. First operand 905 states and 1241 transitions. Second operand 9 states. [2019-09-10 08:13:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:24,492 INFO L93 Difference]: Finished difference Result 1674 states and 2327 transitions. [2019-09-10 08:13:24,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:24,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:13:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:24,500 INFO L225 Difference]: With dead ends: 1674 [2019-09-10 08:13:24,500 INFO L226 Difference]: Without dead ends: 1674 [2019-09-10 08:13:24,500 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-10 08:13:24,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-10 08:13:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-10 08:13:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1240 transitions. [2019-09-10 08:13:24,521 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1240 transitions. Word has length 97 [2019-09-10 08:13:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:24,522 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1240 transitions. [2019-09-10 08:13:24,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1240 transitions. [2019-09-10 08:13:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:13:24,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:24,524 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:24,525 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:24,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash 990068976, now seen corresponding path program 1 times [2019-09-10 08:13:24,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:24,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:24,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:24,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:24,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:24,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-10 08:13:24,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:24,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:24,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:24,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:24,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:24,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:24,718 INFO L87 Difference]: Start difference. First operand 905 states and 1240 transitions. Second operand 9 states. [2019-09-10 08:13:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:26,805 INFO L93 Difference]: Finished difference Result 1674 states and 2325 transitions. [2019-09-10 08:13:26,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:26,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:13:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:26,814 INFO L225 Difference]: With dead ends: 1674 [2019-09-10 08:13:26,814 INFO L226 Difference]: Without dead ends: 1674 [2019-09-10 08:13:26,815 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-10 08:13:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-10 08:13:26,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-10 08:13:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1239 transitions. [2019-09-10 08:13:26,834 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1239 transitions. Word has length 97 [2019-09-10 08:13:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:26,835 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1239 transitions. [2019-09-10 08:13:26,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1239 transitions. [2019-09-10 08:13:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:13:26,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:26,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:26,838 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:26,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:26,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1326473449, now seen corresponding path program 1 times [2019-09-10 08:13:26,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:26,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:26,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:26,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:26,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:27,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:27,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:27,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:27,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:27,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:27,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:27,079 INFO L87 Difference]: Start difference. First operand 905 states and 1239 transitions. Second operand 9 states. [2019-09-10 08:13:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:29,423 INFO L93 Difference]: Finished difference Result 1698 states and 2363 transitions. [2019-09-10 08:13:29,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:29,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:13:29,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:29,432 INFO L225 Difference]: With dead ends: 1698 [2019-09-10 08:13:29,432 INFO L226 Difference]: Without dead ends: 1698 [2019-09-10 08:13:29,432 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-10 08:13:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-10 08:13:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-10 08:13:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1238 transitions. [2019-09-10 08:13:29,451 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1238 transitions. Word has length 97 [2019-09-10 08:13:29,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:29,452 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1238 transitions. [2019-09-10 08:13:29,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1238 transitions. [2019-09-10 08:13:29,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:13:29,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:29,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] [2019-09-10 08:13:29,455 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:29,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:29,456 INFO L82 PathProgramCache]: Analyzing trace with hash -975840379, now seen corresponding path program 1 times [2019-09-10 08:13:29,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:29,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:29,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:29,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:29,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:29,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:29,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:29,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:29,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:29,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:29,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:29,632 INFO L87 Difference]: Start difference. First operand 905 states and 1238 transitions. Second operand 9 states. [2019-09-10 08:13:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:31,510 INFO L93 Difference]: Finished difference Result 1698 states and 2361 transitions. [2019-09-10 08:13:31,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:31,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:13:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:31,518 INFO L225 Difference]: With dead ends: 1698 [2019-09-10 08:13:31,518 INFO L226 Difference]: Without dead ends: 1698 [2019-09-10 08:13:31,519 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-10 08:13:31,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-10 08:13:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-10 08:13:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1237 transitions. [2019-09-10 08:13:31,595 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1237 transitions. Word has length 97 [2019-09-10 08:13:31,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:31,595 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1237 transitions. [2019-09-10 08:13:31,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1237 transitions. [2019-09-10 08:13:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:13:31,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:31,598 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:31,599 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:31,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:31,599 INFO L82 PathProgramCache]: Analyzing trace with hash -846389634, now seen corresponding path program 1 times [2019-09-10 08:13:31,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:31,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:31,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:31,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:31,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:31,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:31,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:31,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:31,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:31,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:31,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:31,805 INFO L87 Difference]: Start difference. First operand 905 states and 1237 transitions. Second operand 9 states. [2019-09-10 08:13:34,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:34,254 INFO L93 Difference]: Finished difference Result 1674 states and 2322 transitions. [2019-09-10 08:13:34,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:34,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:13:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:34,262 INFO L225 Difference]: With dead ends: 1674 [2019-09-10 08:13:34,262 INFO L226 Difference]: Without dead ends: 1674 [2019-09-10 08:13:34,262 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-10 08:13:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-10 08:13:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-10 08:13:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1236 transitions. [2019-09-10 08:13:34,283 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1236 transitions. Word has length 97 [2019-09-10 08:13:34,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:34,283 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1236 transitions. [2019-09-10 08:13:34,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1236 transitions. [2019-09-10 08:13:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:13:34,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:34,287 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:34,287 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:34,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:34,287 INFO L82 PathProgramCache]: Analyzing trace with hash -614722141, now seen corresponding path program 1 times [2019-09-10 08:13:34,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:34,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:34,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:34,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:34,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:34,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:34,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:34,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:34,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:34,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:34,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:34,466 INFO L87 Difference]: Start difference. First operand 905 states and 1236 transitions. Second operand 9 states. [2019-09-10 08:13:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:36,385 INFO L93 Difference]: Finished difference Result 1698 states and 2355 transitions. [2019-09-10 08:13:36,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:36,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:13:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:36,429 INFO L225 Difference]: With dead ends: 1698 [2019-09-10 08:13:36,429 INFO L226 Difference]: Without dead ends: 1698 [2019-09-10 08:13:36,431 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-10 08:13:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-10 08:13:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-10 08:13:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1234 transitions. [2019-09-10 08:13:36,459 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1234 transitions. Word has length 99 [2019-09-10 08:13:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:36,460 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1234 transitions. [2019-09-10 08:13:36,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1234 transitions. [2019-09-10 08:13:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:13:36,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:36,465 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:36,466 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:36,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:36,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1600456637, now seen corresponding path program 1 times [2019-09-10 08:13:36,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:36,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:36,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:36,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:36,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:36,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:36,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:36,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:36,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:36,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:36,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:36,656 INFO L87 Difference]: Start difference. First operand 905 states and 1234 transitions. Second operand 9 states. [2019-09-10 08:13:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:39,447 INFO L93 Difference]: Finished difference Result 1726 states and 2404 transitions. [2019-09-10 08:13:39,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:39,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:13:39,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:39,453 INFO L225 Difference]: With dead ends: 1726 [2019-09-10 08:13:39,453 INFO L226 Difference]: Without dead ends: 1726 [2019-09-10 08:13:39,453 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-10 08:13:39,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-09-10 08:13:39,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 905. [2019-09-10 08:13:39,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1232 transitions. [2019-09-10 08:13:39,470 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1232 transitions. Word has length 99 [2019-09-10 08:13:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:39,471 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1232 transitions. [2019-09-10 08:13:39,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1232 transitions. [2019-09-10 08:13:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:13:39,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:39,473 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:39,473 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:39,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:39,474 INFO L82 PathProgramCache]: Analyzing trace with hash -16190442, now seen corresponding path program 1 times [2019-09-10 08:13:39,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:39,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:39,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:39,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:39,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:39,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:39,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:39,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:39,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:39,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:39,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:39,645 INFO L87 Difference]: Start difference. First operand 905 states and 1232 transitions. Second operand 9 states. [2019-09-10 08:13:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:41,775 INFO L93 Difference]: Finished difference Result 1674 states and 2314 transitions. [2019-09-10 08:13:41,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:41,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:13:41,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:41,783 INFO L225 Difference]: With dead ends: 1674 [2019-09-10 08:13:41,783 INFO L226 Difference]: Without dead ends: 1674 [2019-09-10 08:13:41,784 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-10 08:13:41,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-10 08:13:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-10 08:13:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1230 transitions. [2019-09-10 08:13:41,826 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1230 transitions. Word has length 99 [2019-09-10 08:13:41,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:41,827 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1230 transitions. [2019-09-10 08:13:41,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:41,827 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1230 transitions. [2019-09-10 08:13:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:13:41,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:41,829 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:41,830 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:41,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:41,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1945346954, now seen corresponding path program 1 times [2019-09-10 08:13:41,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:41,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:41,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:41,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:41,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:41,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:41,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:41,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:41,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:41,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:41,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:41,990 INFO L87 Difference]: Start difference. First operand 905 states and 1230 transitions. Second operand 9 states. [2019-09-10 08:13:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:44,124 INFO L93 Difference]: Finished difference Result 1626 states and 2234 transitions. [2019-09-10 08:13:44,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:44,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:13:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:44,129 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:13:44,129 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:13:44,130 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-10 08:13:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:13:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:13:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:44,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1228 transitions. [2019-09-10 08:13:44,146 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1228 transitions. Word has length 99 [2019-09-10 08:13:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:44,147 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1228 transitions. [2019-09-10 08:13:44,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1228 transitions. [2019-09-10 08:13:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:13:44,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:44,149 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:44,150 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:44,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:44,150 INFO L82 PathProgramCache]: Analyzing trace with hash 113260303, now seen corresponding path program 1 times [2019-09-10 08:13:44,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:44,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:44,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:44,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:44,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:44,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:44,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:44,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:44,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:44,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:44,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:44,356 INFO L87 Difference]: Start difference. First operand 905 states and 1228 transitions. Second operand 9 states. [2019-09-10 08:13:46,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:46,830 INFO L93 Difference]: Finished difference Result 1674 states and 2308 transitions. [2019-09-10 08:13:46,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:46,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:13:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:46,836 INFO L225 Difference]: With dead ends: 1674 [2019-09-10 08:13:46,837 INFO L226 Difference]: Without dead ends: 1674 [2019-09-10 08:13:46,837 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-10 08:13:46,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-10 08:13:46,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-10 08:13:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:46,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1226 transitions. [2019-09-10 08:13:46,853 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1226 transitions. Word has length 99 [2019-09-10 08:13:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:46,854 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1226 transitions. [2019-09-10 08:13:46,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1226 transitions. [2019-09-10 08:13:46,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:13:46,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:46,856 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:46,856 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:46,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:46,857 INFO L82 PathProgramCache]: Analyzing trace with hash -503675873, now seen corresponding path program 1 times [2019-09-10 08:13:46,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:46,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:46,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:46,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:46,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:47,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:47,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:47,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:47,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:47,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:47,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:47,096 INFO L87 Difference]: Start difference. First operand 905 states and 1226 transitions. Second operand 9 states. [2019-09-10 08:13:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:50,010 INFO L93 Difference]: Finished difference Result 1726 states and 2390 transitions. [2019-09-10 08:13:50,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:50,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:13:50,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:50,015 INFO L225 Difference]: With dead ends: 1726 [2019-09-10 08:13:50,015 INFO L226 Difference]: Without dead ends: 1726 [2019-09-10 08:13:50,016 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-10 08:13:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-09-10 08:13:50,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 905. [2019-09-10 08:13:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1224 transitions. [2019-09-10 08:13:50,033 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1224 transitions. Word has length 99 [2019-09-10 08:13:50,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:50,034 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1224 transitions. [2019-09-10 08:13:50,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1224 transitions. [2019-09-10 08:13:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:13:50,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:50,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:50,037 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:50,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:50,037 INFO L82 PathProgramCache]: Analyzing trace with hash 412844447, now seen corresponding path program 1 times [2019-09-10 08:13:50,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:50,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:50,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:50,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:50,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:50,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:50,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:50,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:50,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:50,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:50,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:50,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:50,233 INFO L87 Difference]: Start difference. First operand 905 states and 1224 transitions. Second operand 9 states. [2019-09-10 08:13:52,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:52,496 INFO L93 Difference]: Finished difference Result 1626 states and 2228 transitions. [2019-09-10 08:13:52,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:52,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:13:52,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:52,500 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:13:52,500 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:13:52,500 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-10 08:13:52,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:13:52,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:13:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1222 transitions. [2019-09-10 08:13:52,515 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1222 transitions. Word has length 99 [2019-09-10 08:13:52,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:52,515 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1222 transitions. [2019-09-10 08:13:52,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:52,515 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1222 transitions. [2019-09-10 08:13:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:13:52,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:52,517 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:52,517 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:52,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:52,518 INFO L82 PathProgramCache]: Analyzing trace with hash -860630256, now seen corresponding path program 1 times [2019-09-10 08:13:52,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:52,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:52,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:52,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:52,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:52,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:52,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:52,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:52,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:52,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:52,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:52,712 INFO L87 Difference]: Start difference. First operand 905 states and 1222 transitions. Second operand 9 states. [2019-09-10 08:13:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:55,248 INFO L93 Difference]: Finished difference Result 1626 states and 2224 transitions. [2019-09-10 08:13:55,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:55,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:13:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:55,251 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:13:55,252 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:13:55,252 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-10 08:13:55,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:13:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:13:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1220 transitions. [2019-09-10 08:13:55,268 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1220 transitions. Word has length 99 [2019-09-10 08:13:55,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:55,268 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1220 transitions. [2019-09-10 08:13:55,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1220 transitions. [2019-09-10 08:13:55,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:13:55,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:55,270 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:55,271 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:55,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:55,271 INFO L82 PathProgramCache]: Analyzing trace with hash 155343894, now seen corresponding path program 1 times [2019-09-10 08:13:55,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:55,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:55,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:55,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:55,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:55,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:55,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:55,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:55,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:55,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:55,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:55,456 INFO L87 Difference]: Start difference. First operand 905 states and 1220 transitions. Second operand 9 states. [2019-09-10 08:13:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:57,954 INFO L93 Difference]: Finished difference Result 1626 states and 2220 transitions. [2019-09-10 08:13:57,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:13:57,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:13:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:57,958 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:13:57,958 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:13:57,958 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-10 08:13:57,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:13:57,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:13:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:13:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1218 transitions. [2019-09-10 08:13:57,970 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1218 transitions. Word has length 99 [2019-09-10 08:13:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:57,970 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1218 transitions. [2019-09-10 08:13:57,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:13:57,971 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1218 transitions. [2019-09-10 08:13:57,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:13:57,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:57,972 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:57,973 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:57,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:57,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1278535753, now seen corresponding path program 1 times [2019-09-10 08:13:57,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:57,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:57,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:57,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:57,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:58,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:58,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:13:58,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:58,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:13:58,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:13:58,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:13:58,134 INFO L87 Difference]: Start difference. First operand 905 states and 1218 transitions. Second operand 9 states. [2019-09-10 08:14:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:00,703 INFO L93 Difference]: Finished difference Result 1726 states and 2383 transitions. [2019-09-10 08:14:00,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:00,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:14:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:00,706 INFO L225 Difference]: With dead ends: 1726 [2019-09-10 08:14:00,706 INFO L226 Difference]: Without dead ends: 1726 [2019-09-10 08:14:00,707 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-10 08:14:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-09-10 08:14:00,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 905. [2019-09-10 08:14:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1217 transitions. [2019-09-10 08:14:00,723 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1217 transitions. Word has length 99 [2019-09-10 08:14:00,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:00,723 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1217 transitions. [2019-09-10 08:14:00,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:00,724 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1217 transitions. [2019-09-10 08:14:00,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:14:00,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:00,726 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:00,726 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:00,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:00,726 INFO L82 PathProgramCache]: Analyzing trace with hash -724838198, now seen corresponding path program 1 times [2019-09-10 08:14:00,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:00,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:00,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:00,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:00,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:00,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:00,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:00,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:00,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:00,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:00,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:00,915 INFO L87 Difference]: Start difference. First operand 905 states and 1217 transitions. Second operand 9 states. [2019-09-10 08:14:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:03,475 INFO L93 Difference]: Finished difference Result 1674 states and 2294 transitions. [2019-09-10 08:14:03,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:03,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:14:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:03,478 INFO L225 Difference]: With dead ends: 1674 [2019-09-10 08:14:03,478 INFO L226 Difference]: Without dead ends: 1674 [2019-09-10 08:14:03,479 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-10 08:14:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-10 08:14:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-10 08:14:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1216 transitions. [2019-09-10 08:14:03,494 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1216 transitions. Word has length 99 [2019-09-10 08:14:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:03,494 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1216 transitions. [2019-09-10 08:14:03,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1216 transitions. [2019-09-10 08:14:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:14:03,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:03,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:03,497 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:03,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:03,497 INFO L82 PathProgramCache]: Analyzing trace with hash -695001007, now seen corresponding path program 1 times [2019-09-10 08:14:03,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:03,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:03,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:03,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:03,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:03,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:03,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:03,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:03,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:03,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:03,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:03,666 INFO L87 Difference]: Start difference. First operand 905 states and 1216 transitions. Second operand 9 states. [2019-09-10 08:14:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:06,107 INFO L93 Difference]: Finished difference Result 1626 states and 2216 transitions. [2019-09-10 08:14:06,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:06,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:14:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:06,110 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:14:06,110 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:14:06,111 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-10 08:14:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:14:06,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:14:06,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1215 transitions. [2019-09-10 08:14:06,126 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1215 transitions. Word has length 99 [2019-09-10 08:14:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:06,126 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1215 transitions. [2019-09-10 08:14:06,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1215 transitions. [2019-09-10 08:14:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:14:06,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:06,128 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:06,129 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:06,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:06,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1931265789, now seen corresponding path program 1 times [2019-09-10 08:14:06,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:06,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:06,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:06,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:06,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:06,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:06,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:06,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:06,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:06,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:06,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:06,297 INFO L87 Difference]: Start difference. First operand 905 states and 1215 transitions. Second operand 9 states. [2019-09-10 08:14:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:08,891 INFO L93 Difference]: Finished difference Result 1698 states and 2335 transitions. [2019-09-10 08:14:08,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:08,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:14:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:08,894 INFO L225 Difference]: With dead ends: 1698 [2019-09-10 08:14:08,894 INFO L226 Difference]: Without dead ends: 1698 [2019-09-10 08:14:08,895 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-10 08:14:08,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-10 08:14:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-10 08:14:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1214 transitions. [2019-09-10 08:14:08,906 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1214 transitions. Word has length 99 [2019-09-10 08:14:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:08,907 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1214 transitions. [2019-09-10 08:14:08,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:08,907 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1214 transitions. [2019-09-10 08:14:08,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:14:08,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:08,908 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:08,908 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:08,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:08,909 INFO L82 PathProgramCache]: Analyzing trace with hash 747056842, now seen corresponding path program 1 times [2019-09-10 08:14:08,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:08,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:08,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:08,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:08,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:09,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:09,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:09,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:09,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:09,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:09,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:09,112 INFO L87 Difference]: Start difference. First operand 905 states and 1214 transitions. Second operand 9 states. [2019-09-10 08:14:11,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:11,683 INFO L93 Difference]: Finished difference Result 1674 states and 2289 transitions. [2019-09-10 08:14:11,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:11,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:14:11,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:11,686 INFO L225 Difference]: With dead ends: 1674 [2019-09-10 08:14:11,686 INFO L226 Difference]: Without dead ends: 1674 [2019-09-10 08:14:11,687 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-10 08:14:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-10 08:14:11,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-10 08:14:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1213 transitions. [2019-09-10 08:14:11,698 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1213 transitions. Word has length 99 [2019-09-10 08:14:11,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:11,698 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1213 transitions. [2019-09-10 08:14:11,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1213 transitions. [2019-09-10 08:14:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:14:11,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:11,700 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:11,701 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:11,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash 358054313, now seen corresponding path program 1 times [2019-09-10 08:14:11,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:11,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:11,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:11,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:11,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:11,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:11,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:11,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:11,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:11,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:11,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:11,871 INFO L87 Difference]: Start difference. First operand 905 states and 1213 transitions. Second operand 9 states. [2019-09-10 08:14:14,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:14,627 INFO L93 Difference]: Finished difference Result 1674 states and 2288 transitions. [2019-09-10 08:14:14,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:14,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:14:14,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:14,631 INFO L225 Difference]: With dead ends: 1674 [2019-09-10 08:14:14,631 INFO L226 Difference]: Without dead ends: 1674 [2019-09-10 08:14:14,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:14:14,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-10 08:14:14,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-10 08:14:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1212 transitions. [2019-09-10 08:14:14,643 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1212 transitions. Word has length 99 [2019-09-10 08:14:14,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:14,644 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1212 transitions. [2019-09-10 08:14:14,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:14,644 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1212 transitions. [2019-09-10 08:14:14,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:14:14,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:14,645 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:14,646 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:14,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:14,646 INFO L82 PathProgramCache]: Analyzing trace with hash 656430520, now seen corresponding path program 1 times [2019-09-10 08:14:14,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:14,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:14,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:14,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:14,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:14,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:14,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:14,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:14,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:14,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:14,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:14,819 INFO L87 Difference]: Start difference. First operand 905 states and 1212 transitions. Second operand 9 states. [2019-09-10 08:14:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:17,793 INFO L93 Difference]: Finished difference Result 1726 states and 2374 transitions. [2019-09-10 08:14:17,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:17,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:14:17,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:17,797 INFO L225 Difference]: With dead ends: 1726 [2019-09-10 08:14:17,797 INFO L226 Difference]: Without dead ends: 1726 [2019-09-10 08:14:17,798 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-10 08:14:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-09-10 08:14:17,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 905. [2019-09-10 08:14:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1211 transitions. [2019-09-10 08:14:17,822 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1211 transitions. Word has length 99 [2019-09-10 08:14:17,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:17,822 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1211 transitions. [2019-09-10 08:14:17,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1211 transitions. [2019-09-10 08:14:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:17,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:17,823 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:17,823 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:17,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:17,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1803814491, now seen corresponding path program 1 times [2019-09-10 08:14:17,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:17,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:17,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:17,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:17,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:17,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:17,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:17,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:17,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:17,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:17,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:17,984 INFO L87 Difference]: Start difference. First operand 905 states and 1211 transitions. Second operand 9 states. [2019-09-10 08:14:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:20,401 INFO L93 Difference]: Finished difference Result 1626 states and 2210 transitions. [2019-09-10 08:14:20,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:20,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:14:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:20,404 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:14:20,404 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:14:20,405 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-10 08:14:20,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:14:20,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:14:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1209 transitions. [2019-09-10 08:14:20,415 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1209 transitions. Word has length 101 [2019-09-10 08:14:20,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:20,415 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1209 transitions. [2019-09-10 08:14:20,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1209 transitions. [2019-09-10 08:14:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:20,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:20,417 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:20,417 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:20,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:20,418 INFO L82 PathProgramCache]: Analyzing trace with hash 125342021, now seen corresponding path program 1 times [2019-09-10 08:14:20,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:20,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:20,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:20,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:20,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:20,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:20,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:20,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:20,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:20,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:20,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:20,581 INFO L87 Difference]: Start difference. First operand 905 states and 1209 transitions. Second operand 9 states. [2019-09-10 08:14:23,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:23,035 INFO L93 Difference]: Finished difference Result 1674 states and 2283 transitions. [2019-09-10 08:14:23,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:23,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:14:23,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:23,038 INFO L225 Difference]: With dead ends: 1674 [2019-09-10 08:14:23,038 INFO L226 Difference]: Without dead ends: 1674 [2019-09-10 08:14:23,039 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-10 08:14:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-10 08:14:23,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-10 08:14:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1207 transitions. [2019-09-10 08:14:23,050 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1207 transitions. Word has length 101 [2019-09-10 08:14:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:23,051 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1207 transitions. [2019-09-10 08:14:23,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1207 transitions. [2019-09-10 08:14:23,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:23,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:23,053 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:23,053 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:23,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:23,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2143197222, now seen corresponding path program 1 times [2019-09-10 08:14:23,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:23,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:23,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:23,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:23,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:23,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:23,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:23,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:23,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:23,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:23,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:23,213 INFO L87 Difference]: Start difference. First operand 905 states and 1207 transitions. Second operand 9 states. [2019-09-10 08:14:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:25,917 INFO L93 Difference]: Finished difference Result 1698 states and 2322 transitions. [2019-09-10 08:14:25,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:25,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:14:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:25,920 INFO L225 Difference]: With dead ends: 1698 [2019-09-10 08:14:25,921 INFO L226 Difference]: Without dead ends: 1698 [2019-09-10 08:14:25,921 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-10 08:14:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-10 08:14:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-10 08:14:25,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1205 transitions. [2019-09-10 08:14:25,934 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1205 transitions. Word has length 101 [2019-09-10 08:14:25,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:25,934 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1205 transitions. [2019-09-10 08:14:25,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1205 transitions. [2019-09-10 08:14:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:25,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:25,936 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:25,936 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:25,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:25,936 INFO L82 PathProgramCache]: Analyzing trace with hash 666625533, now seen corresponding path program 1 times [2019-09-10 08:14:25,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:25,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:25,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:25,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:25,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:26,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:26,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:26,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:26,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:26,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:26,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:26,098 INFO L87 Difference]: Start difference. First operand 905 states and 1205 transitions. Second operand 9 states. [2019-09-10 08:14:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:28,806 INFO L93 Difference]: Finished difference Result 1626 states and 2202 transitions. [2019-09-10 08:14:28,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:28,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:14:28,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:28,809 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:14:28,809 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:14:28,809 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-10 08:14:28,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:14:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:14:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1203 transitions. [2019-09-10 08:14:28,821 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1203 transitions. Word has length 101 [2019-09-10 08:14:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:28,822 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1203 transitions. [2019-09-10 08:14:28,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1203 transitions. [2019-09-10 08:14:28,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:28,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:28,823 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:28,824 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:28,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:28,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1503001015, now seen corresponding path program 1 times [2019-09-10 08:14:28,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:28,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:28,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:28,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:28,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:28,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:28,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:28,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:28,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:28,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:28,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:28,981 INFO L87 Difference]: Start difference. First operand 905 states and 1203 transitions. Second operand 9 states. [2019-09-10 08:14:31,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:31,296 INFO L93 Difference]: Finished difference Result 1626 states and 2200 transitions. [2019-09-10 08:14:31,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:31,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:14:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:31,298 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:14:31,299 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:14:31,299 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-10 08:14:31,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:14:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:14:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1201 transitions. [2019-09-10 08:14:31,308 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1201 transitions. Word has length 101 [2019-09-10 08:14:31,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:31,309 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1201 transitions. [2019-09-10 08:14:31,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1201 transitions. [2019-09-10 08:14:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:31,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:31,310 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:31,310 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:31,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:31,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1720349999, now seen corresponding path program 1 times [2019-09-10 08:14:31,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:31,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:31,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:31,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:31,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:31,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:31,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:31,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:31,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:31,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:31,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:31,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:31,468 INFO L87 Difference]: Start difference. First operand 905 states and 1201 transitions. Second operand 9 states. [2019-09-10 08:14:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:34,018 INFO L93 Difference]: Finished difference Result 1698 states and 2316 transitions. [2019-09-10 08:14:34,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:34,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:14:34,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:34,021 INFO L225 Difference]: With dead ends: 1698 [2019-09-10 08:14:34,021 INFO L226 Difference]: Without dead ends: 1698 [2019-09-10 08:14:34,022 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-10 08:14:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-10 08:14:34,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-10 08:14:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1199 transitions. [2019-09-10 08:14:34,034 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1199 transitions. Word has length 101 [2019-09-10 08:14:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:34,034 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1199 transitions. [2019-09-10 08:14:34,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1199 transitions. [2019-09-10 08:14:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:34,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:34,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:34,036 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:34,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1464481640, now seen corresponding path program 1 times [2019-09-10 08:14:34,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:34,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:34,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:34,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:34,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:34,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:34,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:34,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:34,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:34,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:34,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:34,184 INFO L87 Difference]: Start difference. First operand 905 states and 1199 transitions. Second operand 9 states. [2019-09-10 08:14:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:36,674 INFO L93 Difference]: Finished difference Result 1626 states and 2196 transitions. [2019-09-10 08:14:36,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:36,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:14:36,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:36,678 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:14:36,678 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:14:36,679 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-10 08:14:36,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:14:36,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:14:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1197 transitions. [2019-09-10 08:14:36,692 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1197 transitions. Word has length 101 [2019-09-10 08:14:36,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:36,693 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1197 transitions. [2019-09-10 08:14:36,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1197 transitions. [2019-09-10 08:14:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:36,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:36,695 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:36,695 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:36,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:36,695 INFO L82 PathProgramCache]: Analyzing trace with hash -22612664, now seen corresponding path program 1 times [2019-09-10 08:14:36,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:36,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:36,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:36,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:36,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:36,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:36,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:36,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:36,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:36,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:36,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:36,876 INFO L87 Difference]: Start difference. First operand 905 states and 1197 transitions. Second operand 9 states. [2019-09-10 08:14:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:39,479 INFO L93 Difference]: Finished difference Result 1674 states and 2271 transitions. [2019-09-10 08:14:39,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:39,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:14:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:39,482 INFO L225 Difference]: With dead ends: 1674 [2019-09-10 08:14:39,482 INFO L226 Difference]: Without dead ends: 1674 [2019-09-10 08:14:39,483 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-10 08:14:39,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-10 08:14:39,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-10 08:14:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1195 transitions. [2019-09-10 08:14:39,494 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1195 transitions. Word has length 101 [2019-09-10 08:14:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:39,494 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1195 transitions. [2019-09-10 08:14:39,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1195 transitions. [2019-09-10 08:14:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:39,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:39,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:39,496 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:39,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:39,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1367426141, now seen corresponding path program 1 times [2019-09-10 08:14:39,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:39,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:39,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:39,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:39,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:39,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:39,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:39,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:39,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:39,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:39,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:39,646 INFO L87 Difference]: Start difference. First operand 905 states and 1195 transitions. Second operand 9 states. [2019-09-10 08:14:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:42,404 INFO L93 Difference]: Finished difference Result 1674 states and 2267 transitions. [2019-09-10 08:14:42,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:42,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:14:42,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:42,407 INFO L225 Difference]: With dead ends: 1674 [2019-09-10 08:14:42,407 INFO L226 Difference]: Without dead ends: 1674 [2019-09-10 08:14:42,408 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-10 08:14:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-10 08:14:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-10 08:14:42,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1193 transitions. [2019-09-10 08:14:42,420 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1193 transitions. Word has length 101 [2019-09-10 08:14:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:42,420 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1193 transitions. [2019-09-10 08:14:42,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1193 transitions. [2019-09-10 08:14:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:42,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:42,422 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:42,422 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:42,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:42,423 INFO L82 PathProgramCache]: Analyzing trace with hash -982377980, now seen corresponding path program 1 times [2019-09-10 08:14:42,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:42,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:42,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:42,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:42,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:42,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:42,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:42,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:42,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:42,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:42,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:42,591 INFO L87 Difference]: Start difference. First operand 905 states and 1193 transitions. Second operand 9 states. [2019-09-10 08:14:44,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:44,962 INFO L93 Difference]: Finished difference Result 1626 states and 2190 transitions. [2019-09-10 08:14:44,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:44,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:14:44,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:44,965 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:14:44,965 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:14:44,966 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-10 08:14:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:14:44,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:14:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1191 transitions. [2019-09-10 08:14:44,976 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1191 transitions. Word has length 101 [2019-09-10 08:14:44,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:44,976 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1191 transitions. [2019-09-10 08:14:44,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1191 transitions. [2019-09-10 08:14:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:44,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:44,977 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:44,978 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:44,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:44,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1167978122, now seen corresponding path program 1 times [2019-09-10 08:14:44,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:44,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:44,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:44,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:44,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:45,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:45,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:45,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:45,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:45,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:45,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:45,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:45,140 INFO L87 Difference]: Start difference. First operand 905 states and 1191 transitions. Second operand 9 states. [2019-09-10 08:14:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:47,720 INFO L93 Difference]: Finished difference Result 1626 states and 2186 transitions. [2019-09-10 08:14:47,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:47,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:14:47,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:47,723 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:14:47,723 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:14:47,724 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-10 08:14:47,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:14:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:14:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1189 transitions. [2019-09-10 08:14:47,734 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1189 transitions. Word has length 101 [2019-09-10 08:14:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:47,735 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1189 transitions. [2019-09-10 08:14:47,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1189 transitions. [2019-09-10 08:14:47,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:47,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:47,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:47,736 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:47,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:47,736 INFO L82 PathProgramCache]: Analyzing trace with hash 105604818, now seen corresponding path program 1 times [2019-09-10 08:14:47,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:47,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:47,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:47,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:47,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:47,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:47,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:47,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:47,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:47,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:47,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:47,873 INFO L87 Difference]: Start difference. First operand 905 states and 1189 transitions. Second operand 9 states. [2019-09-10 08:14:50,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:50,460 INFO L93 Difference]: Finished difference Result 1626 states and 2184 transitions. [2019-09-10 08:14:50,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:50,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:14:50,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:50,463 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:14:50,463 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:14:50,464 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-10 08:14:50,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:14:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:14:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1187 transitions. [2019-09-10 08:14:50,476 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1187 transitions. Word has length 101 [2019-09-10 08:14:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:50,477 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1187 transitions. [2019-09-10 08:14:50,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1187 transitions. [2019-09-10 08:14:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:50,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:50,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] [2019-09-10 08:14:50,479 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:50,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1810364723, now seen corresponding path program 1 times [2019-09-10 08:14:50,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:50,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:50,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:50,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:50,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:50,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:50,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:50,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:50,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:50,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:50,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:50,642 INFO L87 Difference]: Start difference. First operand 905 states and 1187 transitions. Second operand 9 states. [2019-09-10 08:14:53,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:53,130 INFO L93 Difference]: Finished difference Result 1626 states and 2182 transitions. [2019-09-10 08:14:53,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:53,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:14:53,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:53,133 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:14:53,133 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:14:53,133 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-10 08:14:53,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:14:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:14:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1186 transitions. [2019-09-10 08:14:53,145 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1186 transitions. Word has length 101 [2019-09-10 08:14:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:53,145 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1186 transitions. [2019-09-10 08:14:53,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1186 transitions. [2019-09-10 08:14:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:53,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:53,146 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:53,147 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:53,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:53,147 INFO L82 PathProgramCache]: Analyzing trace with hash -668731238, now seen corresponding path program 1 times [2019-09-10 08:14:53,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:53,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:53,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:53,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:53,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:53,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:53,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:53,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:53,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:53,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:53,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:53,293 INFO L87 Difference]: Start difference. First operand 905 states and 1186 transitions. Second operand 9 states. [2019-09-10 08:14:55,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:55,959 INFO L93 Difference]: Finished difference Result 1626 states and 2181 transitions. [2019-09-10 08:14:55,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:55,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:14:55,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:55,962 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:14:55,962 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:14:55,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:14:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:14:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:14:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1185 transitions. [2019-09-10 08:14:55,974 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1185 transitions. Word has length 101 [2019-09-10 08:14:55,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:55,974 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1185 transitions. [2019-09-10 08:14:55,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:55,975 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1185 transitions. [2019-09-10 08:14:55,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:55,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:55,976 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:55,976 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:55,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:55,977 INFO L82 PathProgramCache]: Analyzing trace with hash 266353513, now seen corresponding path program 1 times [2019-09-10 08:14:55,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:55,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:55,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:55,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:55,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:56,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-10 08:14:56,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:56,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:56,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:56,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:56,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:56,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:56,192 INFO L87 Difference]: Start difference. First operand 905 states and 1185 transitions. Second operand 9 states. [2019-09-10 08:14:58,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:58,901 INFO L93 Difference]: Finished difference Result 1626 states and 2180 transitions. [2019-09-10 08:14:58,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:58,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:14:58,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:58,904 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:14:58,904 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:14:58,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:14:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:14:58,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:14:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:14:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1184 transitions. [2019-09-10 08:14:58,919 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1184 transitions. Word has length 101 [2019-09-10 08:14:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:58,919 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1184 transitions. [2019-09-10 08:14:58,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1184 transitions. [2019-09-10 08:14:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:14:58,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:58,921 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:58,921 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:58,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:58,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1006473754, now seen corresponding path program 1 times [2019-09-10 08:14:58,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:58,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:58,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:58,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:58,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:59,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:59,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:59,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:59,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:59,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:59,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:59,079 INFO L87 Difference]: Start difference. First operand 905 states and 1184 transitions. Second operand 9 states. [2019-09-10 08:15:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:01,946 INFO L93 Difference]: Finished difference Result 1626 states and 2178 transitions. [2019-09-10 08:15:01,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:01,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:15:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:01,949 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:15:01,949 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:15:01,950 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-10 08:15:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:15:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:15:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:15:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1183 transitions. [2019-09-10 08:15:01,962 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1183 transitions. Word has length 101 [2019-09-10 08:15:01,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:01,963 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1183 transitions. [2019-09-10 08:15:01,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:01,963 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1183 transitions. [2019-09-10 08:15:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:15:01,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:01,965 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:01,965 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:01,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:01,965 INFO L82 PathProgramCache]: Analyzing trace with hash 411987299, now seen corresponding path program 1 times [2019-09-10 08:15:01,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:01,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:01,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:01,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:01,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:02,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:02,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:02,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:02,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:02,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:02,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:02,118 INFO L87 Difference]: Start difference. First operand 905 states and 1183 transitions. Second operand 9 states. [2019-09-10 08:15:04,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:04,835 INFO L93 Difference]: Finished difference Result 1626 states and 2176 transitions. [2019-09-10 08:15:04,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:04,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:15:04,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:04,838 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:15:04,839 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:15:04,839 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-10 08:15:04,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:15:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:15:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:15:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1182 transitions. [2019-09-10 08:15:04,849 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1182 transitions. Word has length 101 [2019-09-10 08:15:04,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:04,849 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1182 transitions. [2019-09-10 08:15:04,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1182 transitions. [2019-09-10 08:15:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:15:04,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:04,850 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:04,851 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:04,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:04,851 INFO L82 PathProgramCache]: Analyzing trace with hash 135143125, now seen corresponding path program 1 times [2019-09-10 08:15:04,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:04,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:04,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:04,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:04,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:04,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:04,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:04,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:04,995 INFO L87 Difference]: Start difference. First operand 905 states and 1182 transitions. Second operand 9 states. [2019-09-10 08:15:07,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:07,559 INFO L93 Difference]: Finished difference Result 1626 states and 2175 transitions. [2019-09-10 08:15:07,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:07,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:15:07,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:07,561 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:15:07,562 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:15:07,562 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-10 08:15:07,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:15:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:15:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:15:07,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1181 transitions. [2019-09-10 08:15:07,572 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1181 transitions. Word has length 101 [2019-09-10 08:15:07,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:07,572 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1181 transitions. [2019-09-10 08:15:07,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:07,573 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1181 transitions. [2019-09-10 08:15:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:15:07,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:07,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:07,575 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:07,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:07,575 INFO L82 PathProgramCache]: Analyzing trace with hash 160216056, now seen corresponding path program 1 times [2019-09-10 08:15:07,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:07,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:07,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:07,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:07,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:07,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:07,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:07,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:07,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:07,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:07,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:07,743 INFO L87 Difference]: Start difference. First operand 905 states and 1181 transitions. Second operand 9 states. [2019-09-10 08:15:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:10,226 INFO L93 Difference]: Finished difference Result 1674 states and 2248 transitions. [2019-09-10 08:15:10,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:10,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:15:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:10,229 INFO L225 Difference]: With dead ends: 1674 [2019-09-10 08:15:10,229 INFO L226 Difference]: Without dead ends: 1674 [2019-09-10 08:15:10,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-10 08:15:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-10 08:15:10,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-10 08:15:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:15:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1180 transitions. [2019-09-10 08:15:10,244 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1180 transitions. Word has length 101 [2019-09-10 08:15:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:10,244 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1180 transitions. [2019-09-10 08:15:10,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1180 transitions. [2019-09-10 08:15:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:15:10,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:10,246 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:10,246 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:10,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:10,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1768940456, now seen corresponding path program 1 times [2019-09-10 08:15:10,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:10,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:10,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:10,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:10,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:10,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:10,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:10,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:10,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:10,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:10,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:10,406 INFO L87 Difference]: Start difference. First operand 905 states and 1180 transitions. Second operand 9 states. [2019-09-10 08:15:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:12,908 INFO L93 Difference]: Finished difference Result 1626 states and 2173 transitions. [2019-09-10 08:15:12,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:12,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:15:12,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:12,911 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:15:12,911 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:15:12,912 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-10 08:15:12,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:15:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:15:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:15:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1179 transitions. [2019-09-10 08:15:12,921 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1179 transitions. Word has length 101 [2019-09-10 08:15:12,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:12,922 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1179 transitions. [2019-09-10 08:15:12,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1179 transitions. [2019-09-10 08:15:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:15:12,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:12,923 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:12,923 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:12,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:12,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1364812236, now seen corresponding path program 1 times [2019-09-10 08:15:12,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:12,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:12,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:12,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:12,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:13,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:13,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:13,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:13,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:13,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:13,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:13,125 INFO L87 Difference]: Start difference. First operand 905 states and 1179 transitions. Second operand 9 states. [2019-09-10 08:15:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:15,927 INFO L93 Difference]: Finished difference Result 1626 states and 2171 transitions. [2019-09-10 08:15:15,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:15,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:15:15,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:15,931 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:15:15,931 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:15:15,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:15:15,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:15:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:15:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:15:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1178 transitions. [2019-09-10 08:15:15,941 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1178 transitions. Word has length 101 [2019-09-10 08:15:15,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:15,941 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1178 transitions. [2019-09-10 08:15:15,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1178 transitions. [2019-09-10 08:15:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:15:15,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:15,942 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:15,942 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:15,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:15,943 INFO L82 PathProgramCache]: Analyzing trace with hash -805496503, now seen corresponding path program 1 times [2019-09-10 08:15:15,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:15,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:15,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:15,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:15,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:16,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:16,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:16,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:16,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:16,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:16,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:16,083 INFO L87 Difference]: Start difference. First operand 905 states and 1178 transitions. Second operand 9 states. [2019-09-10 08:15:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:18,229 INFO L93 Difference]: Finished difference Result 1626 states and 2170 transitions. [2019-09-10 08:15:18,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:18,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:15:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:18,232 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:15:18,232 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:15:18,232 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-10 08:15:18,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:15:18,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:15:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:15:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1177 transitions. [2019-09-10 08:15:18,241 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1177 transitions. Word has length 101 [2019-09-10 08:15:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:18,241 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1177 transitions. [2019-09-10 08:15:18,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1177 transitions. [2019-09-10 08:15:18,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:15:18,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:18,242 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:18,243 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:18,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:18,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1984318311, now seen corresponding path program 1 times [2019-09-10 08:15:18,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:18,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:18,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:18,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:18,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:18,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:18,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:18,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:18,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:18,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:18,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:18,398 INFO L87 Difference]: Start difference. First operand 905 states and 1177 transitions. Second operand 9 states. [2019-09-10 08:15:20,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:20,626 INFO L93 Difference]: Finished difference Result 1626 states and 2169 transitions. [2019-09-10 08:15:20,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:20,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:15:20,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:20,629 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:15:20,630 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:15:20,630 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-10 08:15:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:15:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:15:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:15:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1176 transitions. [2019-09-10 08:15:20,641 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1176 transitions. Word has length 101 [2019-09-10 08:15:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:20,641 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1176 transitions. [2019-09-10 08:15:20,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1176 transitions. [2019-09-10 08:15:20,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:15:20,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:20,644 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:20,644 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:20,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:20,644 INFO L82 PathProgramCache]: Analyzing trace with hash -140231016, now seen corresponding path program 1 times [2019-09-10 08:15:20,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:20,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:20,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:20,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:20,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:20,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:20,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:20,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:20,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:20,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:20,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:20,804 INFO L87 Difference]: Start difference. First operand 905 states and 1176 transitions. Second operand 9 states. [2019-09-10 08:15:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:23,458 INFO L93 Difference]: Finished difference Result 1626 states and 2167 transitions. [2019-09-10 08:15:23,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:23,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:15:23,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:23,460 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:15:23,461 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:15:23,461 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-10 08:15:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:15:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:15:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:15:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1175 transitions. [2019-09-10 08:15:23,470 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1175 transitions. Word has length 101 [2019-09-10 08:15:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:23,470 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1175 transitions. [2019-09-10 08:15:23,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1175 transitions. [2019-09-10 08:15:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:15:23,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:23,472 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:23,472 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:23,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:23,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1539223594, now seen corresponding path program 1 times [2019-09-10 08:15:23,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:23,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:23,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:23,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:23,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:23,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:23,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:23,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:23,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:23,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:23,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:23,632 INFO L87 Difference]: Start difference. First operand 905 states and 1175 transitions. Second operand 9 states. [2019-09-10 08:15:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:25,871 INFO L93 Difference]: Finished difference Result 1626 states and 2165 transitions. [2019-09-10 08:15:25,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:25,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:15:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:25,874 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:15:25,874 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:15:25,875 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-10 08:15:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:15:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:15:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:15:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1174 transitions. [2019-09-10 08:15:25,884 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1174 transitions. Word has length 101 [2019-09-10 08:15:25,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:25,884 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1174 transitions. [2019-09-10 08:15:25,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:25,884 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1174 transitions. [2019-09-10 08:15:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:15:25,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:25,885 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:25,885 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:25,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:25,886 INFO L82 PathProgramCache]: Analyzing trace with hash 156727661, now seen corresponding path program 1 times [2019-09-10 08:15:25,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:25,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:25,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:25,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:25,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:26,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:26,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:26,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:26,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:26,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:26,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:26,005 INFO L87 Difference]: Start difference. First operand 905 states and 1174 transitions. Second operand 9 states. [2019-09-10 08:15:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:28,458 INFO L93 Difference]: Finished difference Result 1626 states and 2164 transitions. [2019-09-10 08:15:28,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:28,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:15:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:28,462 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:15:28,462 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:15:28,462 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-10 08:15:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:15:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:15:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:15:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1173 transitions. [2019-09-10 08:15:28,475 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1173 transitions. Word has length 102 [2019-09-10 08:15:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:28,475 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1173 transitions. [2019-09-10 08:15:28,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1173 transitions. [2019-09-10 08:15:28,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:15:28,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:28,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] [2019-09-10 08:15:28,477 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:28,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:28,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1086833095, now seen corresponding path program 1 times [2019-09-10 08:15:28,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:28,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:28,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:28,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:28,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:28,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:28,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:28,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:28,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:28,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:28,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:28,613 INFO L87 Difference]: Start difference. First operand 905 states and 1173 transitions. Second operand 9 states. [2019-09-10 08:15:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:31,082 INFO L93 Difference]: Finished difference Result 1626 states and 2163 transitions. [2019-09-10 08:15:31,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:31,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:15:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:31,085 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:15:31,085 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:15:31,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:15:31,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:15:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:15:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:15:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1172 transitions. [2019-09-10 08:15:31,096 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1172 transitions. Word has length 102 [2019-09-10 08:15:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:31,096 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1172 transitions. [2019-09-10 08:15:31,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1172 transitions. [2019-09-10 08:15:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:15:31,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:31,097 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:31,098 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:31,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:31,098 INFO L82 PathProgramCache]: Analyzing trace with hash 725509289, now seen corresponding path program 1 times [2019-09-10 08:15:31,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:31,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:31,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:31,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:31,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:32,759 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:15:32,921 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:15:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:34,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:34,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:15:34,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:34,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:15:34,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:15:34,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:15:34,102 INFO L87 Difference]: Start difference. First operand 905 states and 1172 transitions. Second operand 31 states. [2019-09-10 08:15:34,332 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 08:15:35,495 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 08:15:35,687 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:15:36,205 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 08:15:36,660 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 08:15:37,178 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 106 [2019-09-10 08:15:37,867 WARN L188 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 125 [2019-09-10 08:15:41,756 WARN L188 SmtUtils]: Spent 3.78 s on a formula simplification. DAG size of input: 161 DAG size of output: 145 [2019-09-10 08:15:42,089 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 08:15:42,400 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 08:15:42,596 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 08:16:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:00,302 INFO L93 Difference]: Finished difference Result 2247 states and 2982 transitions. [2019-09-10 08:16:00,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 08:16:00,303 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 103 [2019-09-10 08:16:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:00,306 INFO L225 Difference]: With dead ends: 2247 [2019-09-10 08:16:00,306 INFO L226 Difference]: Without dead ends: 2247 [2019-09-10 08:16:00,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=481, Invalid=2941, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 08:16:00,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2019-09-10 08:16:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 924. [2019-09-10 08:16:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2019-09-10 08:16:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1196 transitions. [2019-09-10 08:16:00,322 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1196 transitions. Word has length 103 [2019-09-10 08:16:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:00,322 INFO L475 AbstractCegarLoop]: Abstraction has 924 states and 1196 transitions. [2019-09-10 08:16:00,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:16:00,323 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1196 transitions. [2019-09-10 08:16:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:16:00,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:00,324 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:00,325 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:00,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:00,325 INFO L82 PathProgramCache]: Analyzing trace with hash -841243648, now seen corresponding path program 1 times [2019-09-10 08:16:00,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:00,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:00,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:00,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:00,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:01,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:01,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:16:01,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:01,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:16:01,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:16:01,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:16:01,196 INFO L87 Difference]: Start difference. First operand 924 states and 1196 transitions. Second operand 17 states. [2019-09-10 08:16:01,857 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:16:02,015 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:16:05,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:05,268 INFO L93 Difference]: Finished difference Result 1821 states and 2419 transitions. [2019-09-10 08:16:05,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:16:05,269 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:16:05,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:05,272 INFO L225 Difference]: With dead ends: 1821 [2019-09-10 08:16:05,272 INFO L226 Difference]: Without dead ends: 1821 [2019-09-10 08:16:05,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:16:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2019-09-10 08:16:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 885. [2019-09-10 08:16:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-09-10 08:16:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1143 transitions. [2019-09-10 08:16:05,285 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1143 transitions. Word has length 103 [2019-09-10 08:16:05,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:05,285 INFO L475 AbstractCegarLoop]: Abstraction has 885 states and 1143 transitions. [2019-09-10 08:16:05,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:16:05,286 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1143 transitions. [2019-09-10 08:16:05,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:16:05,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:05,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] [2019-09-10 08:16:05,288 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:05,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:05,288 INFO L82 PathProgramCache]: Analyzing trace with hash 75685686, now seen corresponding path program 1 times [2019-09-10 08:16:05,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:05,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:05,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:05,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:05,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:05,987 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 08:16:06,129 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 08:16:06,279 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 08:16:06,475 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:16:06,656 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:16:06,854 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 08:16:07,031 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 08:16:07,206 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 08:16:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:08,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:08,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:16:08,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:08,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:16:08,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:16:08,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:16:08,725 INFO L87 Difference]: Start difference. First operand 885 states and 1143 transitions. Second operand 31 states. [2019-09-10 08:16:09,032 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-09-10 08:16:10,059 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 29 [2019-09-10 08:16:10,268 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 32 [2019-09-10 08:16:10,492 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-10 08:16:10,725 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-09-10 08:16:11,358 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-09-10 08:16:11,756 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-09-10 08:16:12,169 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 64 [2019-09-10 08:16:12,664 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 73 [2019-09-10 08:16:13,253 WARN L188 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2019-09-10 08:16:13,652 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2019-09-10 08:16:14,045 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2019-09-10 08:16:14,267 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 08:16:28,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:28,141 INFO L93 Difference]: Finished difference Result 1207 states and 1558 transitions. [2019-09-10 08:16:28,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:16:28,142 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 103 [2019-09-10 08:16:28,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:28,144 INFO L225 Difference]: With dead ends: 1207 [2019-09-10 08:16:28,144 INFO L226 Difference]: Without dead ends: 1207 [2019-09-10 08:16:28,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=445, Invalid=2417, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 08:16:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2019-09-10 08:16:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 905. [2019-09-10 08:16:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:16:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1170 transitions. [2019-09-10 08:16:28,154 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1170 transitions. Word has length 103 [2019-09-10 08:16:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:28,155 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1170 transitions. [2019-09-10 08:16:28,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:16:28,155 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1170 transitions. [2019-09-10 08:16:28,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:16:28,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:28,157 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:28,157 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:28,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:28,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1062800595, now seen corresponding path program 1 times [2019-09-10 08:16:28,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:28,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:28,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:28,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:28,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:29,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:29,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:16:29,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:29,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:16:29,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:16:29,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:16:29,065 INFO L87 Difference]: Start difference. First operand 905 states and 1170 transitions. Second operand 17 states. [2019-09-10 08:16:29,856 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:16:30,013 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 08:16:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:32,588 INFO L93 Difference]: Finished difference Result 1757 states and 2338 transitions. [2019-09-10 08:16:32,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:16:32,589 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:16:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:32,591 INFO L225 Difference]: With dead ends: 1757 [2019-09-10 08:16:32,591 INFO L226 Difference]: Without dead ends: 1757 [2019-09-10 08:16:32,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:16:32,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-10 08:16:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 859. [2019-09-10 08:16:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-09-10 08:16:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1107 transitions. [2019-09-10 08:16:32,615 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1107 transitions. Word has length 103 [2019-09-10 08:16:32,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:32,616 INFO L475 AbstractCegarLoop]: Abstraction has 859 states and 1107 transitions. [2019-09-10 08:16:32,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:16:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1107 transitions. [2019-09-10 08:16:32,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:16:32,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:32,618 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:32,618 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:32,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:32,618 INFO L82 PathProgramCache]: Analyzing trace with hash 559668261, now seen corresponding path program 1 times [2019-09-10 08:16:32,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:32,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:32,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:32,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:32,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:33,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:33,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:16:33,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:33,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:16:33,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:16:33,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:16:33,505 INFO L87 Difference]: Start difference. First operand 859 states and 1107 transitions. Second operand 17 states. [2019-09-10 08:16:34,246 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:16:34,392 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 08:16:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:36,568 INFO L93 Difference]: Finished difference Result 1715 states and 2280 transitions. [2019-09-10 08:16:36,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:16:36,568 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:16:36,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:36,572 INFO L225 Difference]: With dead ends: 1715 [2019-09-10 08:16:36,572 INFO L226 Difference]: Without dead ends: 1715 [2019-09-10 08:16:36,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:16:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-09-10 08:16:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 823. [2019-09-10 08:16:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-10 08:16:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1055 transitions. [2019-09-10 08:16:36,586 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1055 transitions. Word has length 103 [2019-09-10 08:16:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:36,586 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1055 transitions. [2019-09-10 08:16:36,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:16:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1055 transitions. [2019-09-10 08:16:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:16:36,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:36,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:36,588 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:36,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:36,588 INFO L82 PathProgramCache]: Analyzing trace with hash -171293856, now seen corresponding path program 1 times [2019-09-10 08:16:36,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:36,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:36,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:36,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:36,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:37,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:37,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:37,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:16:37,408 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:37,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:16:37,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:16:37,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:16:37,408 INFO L87 Difference]: Start difference. First operand 823 states and 1055 transitions. Second operand 16 states. [2019-09-10 08:16:38,226 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:16:38,377 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:16:38,525 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:16:38,664 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-10 08:16:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:42,379 INFO L93 Difference]: Finished difference Result 1281 states and 1618 transitions. [2019-09-10 08:16:42,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:16:42,380 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-09-10 08:16:42,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:42,382 INFO L225 Difference]: With dead ends: 1281 [2019-09-10 08:16:42,382 INFO L226 Difference]: Without dead ends: 1281 [2019-09-10 08:16:42,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:16:42,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-09-10 08:16:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 829. [2019-09-10 08:16:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-10 08:16:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1063 transitions. [2019-09-10 08:16:42,391 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1063 transitions. Word has length 103 [2019-09-10 08:16:42,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:42,391 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1063 transitions. [2019-09-10 08:16:42,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:16:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1063 transitions. [2019-09-10 08:16:42,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:16:42,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:42,393 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:42,393 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:42,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:42,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1183554526, now seen corresponding path program 1 times [2019-09-10 08:16:42,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:42,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:42,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:42,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:42,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:43,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:43,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:16:43,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:43,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:16:43,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:16:43,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:16:43,294 INFO L87 Difference]: Start difference. First operand 829 states and 1063 transitions. Second operand 16 states. [2019-09-10 08:16:44,080 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:16:44,260 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:16:44,429 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:16:44,640 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:16:44,834 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:16:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:48,356 INFO L93 Difference]: Finished difference Result 1256 states and 1595 transitions. [2019-09-10 08:16:48,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:16:48,356 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-09-10 08:16:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:48,358 INFO L225 Difference]: With dead ends: 1256 [2019-09-10 08:16:48,358 INFO L226 Difference]: Without dead ends: 1256 [2019-09-10 08:16:48,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:16:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-09-10 08:16:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 828. [2019-09-10 08:16:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-10 08:16:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1061 transitions. [2019-09-10 08:16:48,367 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1061 transitions. Word has length 103 [2019-09-10 08:16:48,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:48,368 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1061 transitions. [2019-09-10 08:16:48,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:16:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1061 transitions. [2019-09-10 08:16:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:16:48,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:48,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:48,369 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:48,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:48,370 INFO L82 PathProgramCache]: Analyzing trace with hash 739529577, now seen corresponding path program 1 times [2019-09-10 08:16:48,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:48,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:48,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:48,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:48,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:49,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:49,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:16:49,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:49,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:16:49,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:16:49,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:16:49,879 INFO L87 Difference]: Start difference. First operand 828 states and 1061 transitions. Second operand 22 states. [2019-09-10 08:16:50,623 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-10 08:16:51,059 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 08:16:51,358 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 08:16:51,683 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 08:16:51,868 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 08:16:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:54,664 INFO L93 Difference]: Finished difference Result 1283 states and 1678 transitions. [2019-09-10 08:16:54,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:16:54,665 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 103 [2019-09-10 08:16:54,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:54,667 INFO L225 Difference]: With dead ends: 1283 [2019-09-10 08:16:54,667 INFO L226 Difference]: Without dead ends: 1283 [2019-09-10 08:16:54,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:16:54,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-09-10 08:16:54,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 840. [2019-09-10 08:16:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-09-10 08:16:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1073 transitions. [2019-09-10 08:16:54,674 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1073 transitions. Word has length 103 [2019-09-10 08:16:54,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:54,674 INFO L475 AbstractCegarLoop]: Abstraction has 840 states and 1073 transitions. [2019-09-10 08:16:54,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:16:54,674 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1073 transitions. [2019-09-10 08:16:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:16:54,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:54,676 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:54,676 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:54,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:54,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1338576063, now seen corresponding path program 1 times [2019-09-10 08:16:54,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:54,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:54,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:54,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:54,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:55,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:55,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:55,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:16:55,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:55,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:16:55,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:16:55,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:16:55,612 INFO L87 Difference]: Start difference. First operand 840 states and 1073 transitions. Second operand 17 states. [2019-09-10 08:16:56,252 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:16:56,408 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 08:16:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:57,983 INFO L93 Difference]: Finished difference Result 1213 states and 1606 transitions. [2019-09-10 08:16:57,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:16:57,984 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:16:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:57,986 INFO L225 Difference]: With dead ends: 1213 [2019-09-10 08:16:57,986 INFO L226 Difference]: Without dead ends: 1213 [2019-09-10 08:16:57,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:16:57,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-09-10 08:16:57,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 800. [2019-09-10 08:16:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-09-10 08:16:57,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1017 transitions. [2019-09-10 08:16:57,994 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1017 transitions. Word has length 103 [2019-09-10 08:16:57,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:57,995 INFO L475 AbstractCegarLoop]: Abstraction has 800 states and 1017 transitions. [2019-09-10 08:16:57,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:16:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1017 transitions. [2019-09-10 08:16:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:16:57,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:57,996 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:57,996 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:57,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:57,996 INFO L82 PathProgramCache]: Analyzing trace with hash -120255204, now seen corresponding path program 1 times [2019-09-10 08:16:57,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:57,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:57,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:57,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:59,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:59,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:16:59,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:59,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:16:59,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:16:59,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:16:59,027 INFO L87 Difference]: Start difference. First operand 800 states and 1017 transitions. Second operand 17 states. [2019-09-10 08:16:59,727 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 08:16:59,906 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 08:17:03,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:03,683 INFO L93 Difference]: Finished difference Result 1540 states and 2036 transitions. [2019-09-10 08:17:03,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:17:03,684 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:17:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:03,686 INFO L225 Difference]: With dead ends: 1540 [2019-09-10 08:17:03,686 INFO L226 Difference]: Without dead ends: 1540 [2019-09-10 08:17:03,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:17:03,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-09-10 08:17:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 799. [2019-09-10 08:17:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-09-10 08:17:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1014 transitions. [2019-09-10 08:17:03,696 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1014 transitions. Word has length 103 [2019-09-10 08:17:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:03,696 INFO L475 AbstractCegarLoop]: Abstraction has 799 states and 1014 transitions. [2019-09-10 08:17:03,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:17:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1014 transitions. [2019-09-10 08:17:03,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:17:03,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:03,698 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:03,698 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:03,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:03,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1687008141, now seen corresponding path program 1 times [2019-09-10 08:17:03,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:03,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:03,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:03,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:03,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:04,549 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 08:17:04,705 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 08:17:04,905 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:17:05,074 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 08:17:05,251 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 08:17:05,420 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 08:17:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:06,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:06,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-10 08:17:06,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:06,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 08:17:06,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 08:17:06,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:17:06,423 INFO L87 Difference]: Start difference. First operand 799 states and 1014 transitions. Second operand 30 states. [2019-09-10 08:17:06,673 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 08:17:07,640 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2019-09-10 08:17:07,819 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-09-10 08:17:08,024 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-10 08:17:08,355 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 08:17:08,893 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2019-09-10 08:17:09,338 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-09-10 08:17:09,856 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 90 [2019-09-10 08:17:10,419 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 101 [2019-09-10 08:17:10,778 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-10 08:17:11,118 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-10 08:17:11,473 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 08:17:11,793 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 08:17:12,083 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 08:17:12,550 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-10 08:17:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:22,300 INFO L93 Difference]: Finished difference Result 1317 states and 1713 transitions. [2019-09-10 08:17:22,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 08:17:22,301 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 103 [2019-09-10 08:17:22,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:22,303 INFO L225 Difference]: With dead ends: 1317 [2019-09-10 08:17:22,303 INFO L226 Difference]: Without dead ends: 1317 [2019-09-10 08:17:22,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=544, Invalid=2108, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 08:17:22,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2019-09-10 08:17:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 815. [2019-09-10 08:17:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-09-10 08:17:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1032 transitions. [2019-09-10 08:17:22,312 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1032 transitions. Word has length 103 [2019-09-10 08:17:22,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:22,312 INFO L475 AbstractCegarLoop]: Abstraction has 815 states and 1032 transitions. [2019-09-10 08:17:22,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 08:17:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1032 transitions. [2019-09-10 08:17:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:17:22,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:22,314 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:22,315 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:22,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash 644009232, now seen corresponding path program 1 times [2019-09-10 08:17:22,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:22,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:22,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:22,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:22,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:22,931 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 08:17:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:23,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:23,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:17:23,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:23,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:17:23,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:17:23,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:17:23,528 INFO L87 Difference]: Start difference. First operand 815 states and 1032 transitions. Second operand 20 states. [2019-09-10 08:17:24,305 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2019-09-10 08:17:24,612 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-09-10 08:17:24,893 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-09-10 08:17:25,118 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 08:17:25,349 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 08:17:25,555 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 08:17:25,733 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-10 08:17:25,889 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-10 08:17:26,144 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-10 08:17:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:28,861 INFO L93 Difference]: Finished difference Result 1206 states and 1577 transitions. [2019-09-10 08:17:28,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:17:28,861 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2019-09-10 08:17:28,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:28,863 INFO L225 Difference]: With dead ends: 1206 [2019-09-10 08:17:28,863 INFO L226 Difference]: Without dead ends: 1206 [2019-09-10 08:17:28,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:17:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2019-09-10 08:17:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 805. [2019-09-10 08:17:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-09-10 08:17:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1020 transitions. [2019-09-10 08:17:28,871 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1020 transitions. Word has length 103 [2019-09-10 08:17:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:28,871 INFO L475 AbstractCegarLoop]: Abstraction has 805 states and 1020 transitions. [2019-09-10 08:17:28,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:17:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1020 transitions. [2019-09-10 08:17:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:17:28,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:28,872 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:28,872 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:28,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:28,873 INFO L82 PathProgramCache]: Analyzing trace with hash -272553273, now seen corresponding path program 1 times [2019-09-10 08:17:28,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:28,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:28,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:28,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:28,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:29,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:29,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:17:29,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:29,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:17:29,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:17:29,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:17:29,339 INFO L87 Difference]: Start difference. First operand 805 states and 1020 transitions. Second operand 12 states. [2019-09-10 08:17:29,894 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 08:17:30,053 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 08:17:30,382 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-09-10 08:17:30,677 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-09-10 08:17:31,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:31,513 INFO L93 Difference]: Finished difference Result 2255 states and 3078 transitions. [2019-09-10 08:17:31,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:17:31,513 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-09-10 08:17:31,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:31,516 INFO L225 Difference]: With dead ends: 2255 [2019-09-10 08:17:31,517 INFO L226 Difference]: Without dead ends: 2255 [2019-09-10 08:17:31,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:17:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2019-09-10 08:17:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 771. [2019-09-10 08:17:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-09-10 08:17:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 978 transitions. [2019-09-10 08:17:31,528 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 978 transitions. Word has length 104 [2019-09-10 08:17:31,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:31,528 INFO L475 AbstractCegarLoop]: Abstraction has 771 states and 978 transitions. [2019-09-10 08:17:31,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:17:31,528 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 978 transitions. [2019-09-10 08:17:31,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:17:31,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:31,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] [2019-09-10 08:17:31,529 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:31,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:31,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1720315989, now seen corresponding path program 1 times [2019-09-10 08:17:31,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:31,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:31,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:31,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:31,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:31,923 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 18 [2019-09-10 08:17:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:32,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:32,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:17:32,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:32,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:17:32,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:17:32,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:17:32,086 INFO L87 Difference]: Start difference. First operand 771 states and 978 transitions. Second operand 11 states. [2019-09-10 08:17:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:33,737 INFO L93 Difference]: Finished difference Result 2158 states and 2989 transitions. [2019-09-10 08:17:33,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:33,738 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-10 08:17:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:33,740 INFO L225 Difference]: With dead ends: 2158 [2019-09-10 08:17:33,741 INFO L226 Difference]: Without dead ends: 2158 [2019-09-10 08:17:33,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:17:33,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2019-09-10 08:17:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 729. [2019-09-10 08:17:33,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-09-10 08:17:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 921 transitions. [2019-09-10 08:17:33,750 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 921 transitions. Word has length 104 [2019-09-10 08:17:33,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:33,751 INFO L475 AbstractCegarLoop]: Abstraction has 729 states and 921 transitions. [2019-09-10 08:17:33,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:17:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 921 transitions. [2019-09-10 08:17:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:17:33,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:33,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:33,752 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:33,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:33,752 INFO L82 PathProgramCache]: Analyzing trace with hash 267466075, now seen corresponding path program 1 times [2019-09-10 08:17:33,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:33,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:33,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:33,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:33,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:33,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:33,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:33,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:33,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:33,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:33,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:33,905 INFO L87 Difference]: Start difference. First operand 729 states and 921 transitions. Second operand 9 states. [2019-09-10 08:17:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:35,804 INFO L93 Difference]: Finished difference Result 1356 states and 1799 transitions. [2019-09-10 08:17:35,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:35,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:17:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:35,808 INFO L225 Difference]: With dead ends: 1356 [2019-09-10 08:17:35,808 INFO L226 Difference]: Without dead ends: 1356 [2019-09-10 08:17:35,808 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-10 08:17:35,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2019-09-10 08:17:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 729. [2019-09-10 08:17:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-09-10 08:17:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 919 transitions. [2019-09-10 08:17:35,817 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 919 transitions. Word has length 104 [2019-09-10 08:17:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:35,817 INFO L475 AbstractCegarLoop]: Abstraction has 729 states and 919 transitions. [2019-09-10 08:17:35,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 919 transitions. [2019-09-10 08:17:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:17:35,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:35,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:35,818 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:35,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1850286100, now seen corresponding path program 1 times [2019-09-10 08:17:35,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:35,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:35,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:35,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:35,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:36,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:36,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:17:36,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:36,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:17:36,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:17:36,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:17:36,261 INFO L87 Difference]: Start difference. First operand 729 states and 919 transitions. Second operand 11 states. [2019-09-10 08:17:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:37,897 INFO L93 Difference]: Finished difference Result 2044 states and 2797 transitions. [2019-09-10 08:17:37,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:17:37,897 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-10 08:17:37,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:37,900 INFO L225 Difference]: With dead ends: 2044 [2019-09-10 08:17:37,900 INFO L226 Difference]: Without dead ends: 2044 [2019-09-10 08:17:37,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:17:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2019-09-10 08:17:37,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 663. [2019-09-10 08:17:37,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-10 08:17:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 836 transitions. [2019-09-10 08:17:37,911 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 836 transitions. Word has length 104 [2019-09-10 08:17:37,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:37,911 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 836 transitions. [2019-09-10 08:17:37,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:17:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 836 transitions. [2019-09-10 08:17:37,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:17:37,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:37,912 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:37,912 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:37,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:37,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1999000552, now seen corresponding path program 1 times [2019-09-10 08:17:37,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:37,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:37,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:37,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:38,014 ERROR L253 erpolLogProxyWrapper]: Interpolant 61 not inductive: (Check returned sat) [2019-09-10 08:17:38,036 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:969) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-10 08:17:38,045 INFO L168 Benchmark]: Toolchain (without parser) took 290238.91 ms. Allocated memory was 142.6 MB in the beginning and 322.4 MB in the end (delta: 179.8 MB). Free memory was 82.1 MB in the beginning and 164.6 MB in the end (delta: -82.5 MB). Peak memory consumption was 97.3 MB. Max. memory is 7.1 GB. [2019-09-10 08:17:38,050 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 142.6 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-09-10 08:17:38,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2085.41 ms. Allocated memory was 142.6 MB in the beginning and 230.2 MB in the end (delta: 87.6 MB). Free memory was 81.9 MB in the beginning and 119.6 MB in the end (delta: -37.7 MB). Peak memory consumption was 63.1 MB. Max. memory is 7.1 GB. [2019-09-10 08:17:38,054 INFO L168 Benchmark]: Boogie Preprocessor took 287.28 ms. Allocated memory is still 230.2 MB. Free memory was 119.6 MB in the beginning and 104.0 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-09-10 08:17:38,061 INFO L168 Benchmark]: RCFGBuilder took 4370.54 ms. Allocated memory was 230.2 MB in the beginning and 333.4 MB in the end (delta: 103.3 MB). Free memory was 104.0 MB in the beginning and 265.2 MB in the end (delta: -161.2 MB). Peak memory consumption was 125.5 MB. Max. memory is 7.1 GB. [2019-09-10 08:17:38,062 INFO L168 Benchmark]: TraceAbstraction took 283489.34 ms. Allocated memory was 333.4 MB in the beginning and 322.4 MB in the end (delta: -11.0 MB). Free memory was 265.2 MB in the beginning and 164.6 MB in the end (delta: 100.6 MB). Peak memory consumption was 89.5 MB. Max. memory is 7.1 GB. [2019-09-10 08:17:38,066 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 142.6 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2085.41 ms. Allocated memory was 142.6 MB in the beginning and 230.2 MB in the end (delta: 87.6 MB). Free memory was 81.9 MB in the beginning and 119.6 MB in the end (delta: -37.7 MB). Peak memory consumption was 63.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 287.28 ms. Allocated memory is still 230.2 MB. Free memory was 119.6 MB in the beginning and 104.0 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4370.54 ms. Allocated memory was 230.2 MB in the beginning and 333.4 MB in the end (delta: 103.3 MB). Free memory was 104.0 MB in the beginning and 265.2 MB in the end (delta: -161.2 MB). Peak memory consumption was 125.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 283489.34 ms. Allocated memory was 333.4 MB in the beginning and 322.4 MB in the end (delta: -11.0 MB). Free memory was 265.2 MB in the beginning and 164.6 MB in the end (delta: 100.6 MB). Peak memory consumption was 89.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:969) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...