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_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:12:21,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:12:21,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:12:21,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:12:21,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:12:21,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:12:21,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:12:21,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:12:21,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:12:21,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:12:21,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:12:21,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:12:21,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:12:21,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:12:21,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:12:21,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:12:21,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:12:21,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:12:21,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:12:21,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:12:21,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:12:21,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:12:21,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:12:21,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:12:21,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:12:21,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:12:21,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:12:21,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:12:21,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:12:21,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:12:21,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:12:21,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:12:21,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:12:21,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:12:21,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:12:21,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:12:21,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:12:21,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:12:21,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:12:21,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:12:21,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:12:21,640 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 06:12:21,657 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:12:21,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:12:21,658 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:12:21,658 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:12:21,661 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:12:21,661 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:12:21,661 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:12:21,662 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:12:21,662 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:12:21,662 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:12:21,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:12:21,663 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:12:21,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:12:21,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:12:21,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:12:21,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:12:21,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:12:21,665 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:12:21,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:12:21,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:12:21,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:12:21,666 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:12:21,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:12:21,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:12:21,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:12:21,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:12:21,667 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:12:21,667 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:12:21,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:12:21,668 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:12:21,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:12:21,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:12:21,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:12:21,735 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:12:21,736 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:12:21,737 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:12:21,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3e3917fe/b17bb6c04fde4563bb2a536afedffebb/FLAG816136aa8 [2019-09-10 06:12:22,462 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:12:22,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:12:22,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3e3917fe/b17bb6c04fde4563bb2a536afedffebb/FLAG816136aa8 [2019-09-10 06:12:22,609 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3e3917fe/b17bb6c04fde4563bb2a536afedffebb [2019-09-10 06:12:22,619 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:12:22,621 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:12:22,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:12:22,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:12:22,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:12:22,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:12:22" (1/1) ... [2019-09-10 06:12:22,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e99815b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:22, skipping insertion in model container [2019-09-10 06:12:22,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:12:22" (1/1) ... [2019-09-10 06:12:22,638 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:12:22,798 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:12:24,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:12:24,360 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:12:25,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:12:25,432 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:12:25,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:25 WrapperNode [2019-09-10 06:12:25,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:12:25,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:12:25,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:12:25,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:12:25,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:25" (1/1) ... [2019-09-10 06:12:25,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:25" (1/1) ... [2019-09-10 06:12:25,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:25" (1/1) ... [2019-09-10 06:12:25,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:25" (1/1) ... [2019-09-10 06:12:25,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:25" (1/1) ... [2019-09-10 06:12:25,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:25" (1/1) ... [2019-09-10 06:12:25,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:25" (1/1) ... [2019-09-10 06:12:25,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:12:25,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:12:25,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:12:25,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:12:25,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:25" (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 06:12:25,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:12:25,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:12:25,735 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:12:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:12:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:12:25,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:12:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:12:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:12:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:12:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:12:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:12:25,737 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:12:25,737 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:12:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:12:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:12:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:12:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:12:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:12:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:12:29,067 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:12:29,068 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:12:29,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:12:29 BoogieIcfgContainer [2019-09-10 06:12:29,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:12:29,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:12:29,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:12:29,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:12:29,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:12:22" (1/3) ... [2019-09-10 06:12:29,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fd103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:12:29, skipping insertion in model container [2019-09-10 06:12:29,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:25" (2/3) ... [2019-09-10 06:12:29,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fd103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:12:29, skipping insertion in model container [2019-09-10 06:12:29,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:12:29" (3/3) ... [2019-09-10 06:12:29,079 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:12:29,091 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:12:29,107 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-10 06:12:29,124 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-10 06:12:29,152 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:12:29,153 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:12:29,153 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:12:29,153 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:12:29,153 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:12:29,153 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:12:29,153 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:12:29,154 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:12:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states. [2019-09-10 06:12:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-10 06:12:29,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:29,231 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:29,234 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:29,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:29,241 INFO L82 PathProgramCache]: Analyzing trace with hash 131976985, now seen corresponding path program 1 times [2019-09-10 06:12:29,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:29,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:29,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:29,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:29,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:30,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:30,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:30,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:30,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:30,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:30,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:30,889 INFO L87 Difference]: Start difference. First operand 898 states. Second operand 4 states. [2019-09-10 06:12:31,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:31,271 INFO L93 Difference]: Finished difference Result 1762 states and 3135 transitions. [2019-09-10 06:12:31,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:12:31,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 290 [2019-09-10 06:12:31,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:31,309 INFO L225 Difference]: With dead ends: 1762 [2019-09-10 06:12:31,309 INFO L226 Difference]: Without dead ends: 1754 [2019-09-10 06:12:31,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2019-09-10 06:12:31,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1663. [2019-09-10 06:12:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1663 states. [2019-09-10 06:12:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2555 transitions. [2019-09-10 06:12:31,474 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2555 transitions. Word has length 290 [2019-09-10 06:12:31,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:31,477 INFO L475 AbstractCegarLoop]: Abstraction has 1663 states and 2555 transitions. [2019-09-10 06:12:31,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2555 transitions. [2019-09-10 06:12:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-10 06:12:31,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:31,492 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:31,493 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:31,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:31,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1362145513, now seen corresponding path program 1 times [2019-09-10 06:12:31,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:31,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:31,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:31,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:31,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:31,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:31,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:31,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:31,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:31,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:31,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:31,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:31,967 INFO L87 Difference]: Start difference. First operand 1663 states and 2555 transitions. Second operand 3 states. [2019-09-10 06:12:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:32,169 INFO L93 Difference]: Finished difference Result 3270 states and 4998 transitions. [2019-09-10 06:12:32,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:32,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-09-10 06:12:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:32,194 INFO L225 Difference]: With dead ends: 3270 [2019-09-10 06:12:32,194 INFO L226 Difference]: Without dead ends: 3270 [2019-09-10 06:12:32,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:32,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2019-09-10 06:12:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3179. [2019-09-10 06:12:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3179 states. [2019-09-10 06:12:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 4884 transitions. [2019-09-10 06:12:32,305 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 4884 transitions. Word has length 292 [2019-09-10 06:12:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:32,308 INFO L475 AbstractCegarLoop]: Abstraction has 3179 states and 4884 transitions. [2019-09-10 06:12:32,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 4884 transitions. [2019-09-10 06:12:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-10 06:12:32,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:32,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:32,320 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:32,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:32,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1870066724, now seen corresponding path program 1 times [2019-09-10 06:12:32,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:32,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:32,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:32,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:32,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:32,503 INFO 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 06:12:32,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:32,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:32,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:32,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:32,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:32,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:32,506 INFO L87 Difference]: Start difference. First operand 3179 states and 4884 transitions. Second operand 3 states. [2019-09-10 06:12:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:32,630 INFO L93 Difference]: Finished difference Result 6325 states and 9708 transitions. [2019-09-10 06:12:32,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:32,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-09-10 06:12:32,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:32,659 INFO L225 Difference]: With dead ends: 6325 [2019-09-10 06:12:32,660 INFO L226 Difference]: Without dead ends: 6325 [2019-09-10 06:12:32,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6325 states. [2019-09-10 06:12:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6325 to 3198. [2019-09-10 06:12:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3198 states. [2019-09-10 06:12:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 4912 transitions. [2019-09-10 06:12:32,769 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 4912 transitions. Word has length 292 [2019-09-10 06:12:32,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:32,769 INFO L475 AbstractCegarLoop]: Abstraction has 3198 states and 4912 transitions. [2019-09-10 06:12:32,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:32,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 4912 transitions. [2019-09-10 06:12:32,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-10 06:12:32,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:32,779 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:32,780 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:32,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:32,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1528789777, now seen corresponding path program 1 times [2019-09-10 06:12:32,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:32,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:32,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:32,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:32,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:32,907 INFO 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 06:12:32,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:32,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:32,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:32,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:32,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:32,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:32,910 INFO L87 Difference]: Start difference. First operand 3198 states and 4912 transitions. Second operand 3 states. [2019-09-10 06:12:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:32,993 INFO L93 Difference]: Finished difference Result 6343 states and 9729 transitions. [2019-09-10 06:12:32,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:32,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-09-10 06:12:32,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:33,022 INFO L225 Difference]: With dead ends: 6343 [2019-09-10 06:12:33,023 INFO L226 Difference]: Without dead ends: 6343 [2019-09-10 06:12:33,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:33,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2019-09-10 06:12:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 3216. [2019-09-10 06:12:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3216 states. [2019-09-10 06:12:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 4933 transitions. [2019-09-10 06:12:33,134 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 4933 transitions. Word has length 293 [2019-09-10 06:12:33,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:33,135 INFO L475 AbstractCegarLoop]: Abstraction has 3216 states and 4933 transitions. [2019-09-10 06:12:33,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 4933 transitions. [2019-09-10 06:12:33,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-10 06:12:33,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:33,145 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:33,146 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:33,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:33,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1263048754, now seen corresponding path program 1 times [2019-09-10 06:12:33,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:33,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:33,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:33,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:33,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:33,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 06:12:33,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:33,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:33,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:33,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:33,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:33,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:33,414 INFO L87 Difference]: Start difference. First operand 3216 states and 4933 transitions. Second operand 3 states. [2019-09-10 06:12:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:33,561 INFO L93 Difference]: Finished difference Result 6230 states and 9487 transitions. [2019-09-10 06:12:33,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:33,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-09-10 06:12:33,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:33,612 INFO L225 Difference]: With dead ends: 6230 [2019-09-10 06:12:33,612 INFO L226 Difference]: Without dead ends: 6230 [2019-09-10 06:12:33,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:33,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6230 states. [2019-09-10 06:12:33,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6230 to 6139. [2019-09-10 06:12:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6139 states. [2019-09-10 06:12:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6139 states to 6139 states and 9373 transitions. [2019-09-10 06:12:33,769 INFO L78 Accepts]: Start accepts. Automaton has 6139 states and 9373 transitions. Word has length 294 [2019-09-10 06:12:33,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:33,770 INFO L475 AbstractCegarLoop]: Abstraction has 6139 states and 9373 transitions. [2019-09-10 06:12:33,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 6139 states and 9373 transitions. [2019-09-10 06:12:33,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-10 06:12:33,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:33,786 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:33,788 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:33,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:33,789 INFO L82 PathProgramCache]: Analyzing trace with hash -448917937, now seen corresponding path program 1 times [2019-09-10 06:12:33,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:33,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:33,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:33,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:33,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:34,216 INFO 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 06:12:34,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:34,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:34,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:34,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:34,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:34,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:34,219 INFO L87 Difference]: Start difference. First operand 6139 states and 9373 transitions. Second operand 4 states. [2019-09-10 06:12:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:34,333 INFO L93 Difference]: Finished difference Result 11246 states and 17068 transitions. [2019-09-10 06:12:34,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:34,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 294 [2019-09-10 06:12:34,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:34,361 INFO L225 Difference]: With dead ends: 11246 [2019-09-10 06:12:34,361 INFO L226 Difference]: Without dead ends: 11246 [2019-09-10 06:12:34,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11246 states. [2019-09-10 06:12:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11246 to 6374. [2019-09-10 06:12:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6374 states. [2019-09-10 06:12:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6374 states to 6374 states and 9761 transitions. [2019-09-10 06:12:34,594 INFO L78 Accepts]: Start accepts. Automaton has 6374 states and 9761 transitions. Word has length 294 [2019-09-10 06:12:34,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:34,594 INFO L475 AbstractCegarLoop]: Abstraction has 6374 states and 9761 transitions. [2019-09-10 06:12:34,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 6374 states and 9761 transitions. [2019-09-10 06:12:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-10 06:12:34,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:34,622 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:34,622 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:34,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:34,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1623899282, now seen corresponding path program 1 times [2019-09-10 06:12:34,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:34,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:34,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:34,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:34,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:34,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:34,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:34,782 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:34,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:34,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:34,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:34,784 INFO L87 Difference]: Start difference. First operand 6374 states and 9761 transitions. Second operand 3 states. [2019-09-10 06:12:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:34,851 INFO L93 Difference]: Finished difference Result 11981 states and 18166 transitions. [2019-09-10 06:12:34,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:34,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-09-10 06:12:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:34,877 INFO L225 Difference]: With dead ends: 11981 [2019-09-10 06:12:34,878 INFO L226 Difference]: Without dead ends: 11981 [2019-09-10 06:12:34,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:34,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11981 states. [2019-09-10 06:12:35,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11981 to 6478. [2019-09-10 06:12:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6478 states. [2019-09-10 06:12:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6478 states to 6478 states and 9904 transitions. [2019-09-10 06:12:35,047 INFO L78 Accepts]: Start accepts. Automaton has 6478 states and 9904 transitions. Word has length 296 [2019-09-10 06:12:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:35,047 INFO L475 AbstractCegarLoop]: Abstraction has 6478 states and 9904 transitions. [2019-09-10 06:12:35,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 6478 states and 9904 transitions. [2019-09-10 06:12:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-10 06:12:35,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:35,063 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:35,063 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:35,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:35,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2113224453, now seen corresponding path program 1 times [2019-09-10 06:12:35,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:35,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:35,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:35,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:35,318 INFO 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 06:12:35,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:35,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:35,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:35,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:35,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:35,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:35,320 INFO L87 Difference]: Start difference. First operand 6478 states and 9904 transitions. Second operand 3 states. [2019-09-10 06:12:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:35,401 INFO L93 Difference]: Finished difference Result 12106 states and 18312 transitions. [2019-09-10 06:12:35,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:35,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-09-10 06:12:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:35,428 INFO L225 Difference]: With dead ends: 12106 [2019-09-10 06:12:35,429 INFO L226 Difference]: Without dead ends: 12106 [2019-09-10 06:12:35,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12106 states. [2019-09-10 06:12:35,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12106 to 6603. [2019-09-10 06:12:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6603 states. [2019-09-10 06:12:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6603 states to 6603 states and 10050 transitions. [2019-09-10 06:12:35,590 INFO L78 Accepts]: Start accepts. Automaton has 6603 states and 10050 transitions. Word has length 297 [2019-09-10 06:12:35,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:35,591 INFO L475 AbstractCegarLoop]: Abstraction has 6603 states and 10050 transitions. [2019-09-10 06:12:35,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:35,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6603 states and 10050 transitions. [2019-09-10 06:12:35,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-10 06:12:35,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:35,608 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:35,608 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:35,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:35,609 INFO L82 PathProgramCache]: Analyzing trace with hash -703602847, now seen corresponding path program 1 times [2019-09-10 06:12:35,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:35,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:35,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:35,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:35,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:36,026 INFO 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 06:12:36,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:36,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:36,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:36,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:36,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:36,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:36,028 INFO L87 Difference]: Start difference. First operand 6603 states and 10050 transitions. Second operand 4 states. [2019-09-10 06:12:36,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:36,183 INFO L93 Difference]: Finished difference Result 8292 states and 12552 transitions. [2019-09-10 06:12:36,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:36,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2019-09-10 06:12:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:36,201 INFO L225 Difference]: With dead ends: 8292 [2019-09-10 06:12:36,201 INFO L226 Difference]: Without dead ends: 7540 [2019-09-10 06:12:36,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:36,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-09-10 06:12:36,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 7449. [2019-09-10 06:12:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7449 states. [2019-09-10 06:12:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7449 states to 7449 states and 11297 transitions. [2019-09-10 06:12:36,319 INFO L78 Accepts]: Start accepts. Automaton has 7449 states and 11297 transitions. Word has length 298 [2019-09-10 06:12:36,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:36,320 INFO L475 AbstractCegarLoop]: Abstraction has 7449 states and 11297 transitions. [2019-09-10 06:12:36,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 7449 states and 11297 transitions. [2019-09-10 06:12:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-10 06:12:36,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:36,338 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:36,339 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:36,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:36,339 INFO L82 PathProgramCache]: Analyzing trace with hash -421707953, now seen corresponding path program 1 times [2019-09-10 06:12:36,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:36,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:36,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:36,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:36,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:36,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:36,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:36,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:36,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:36,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:36,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:36,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:36,575 INFO L87 Difference]: Start difference. First operand 7449 states and 11297 transitions. Second operand 3 states. [2019-09-10 06:12:36,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:36,664 INFO L93 Difference]: Finished difference Result 14431 states and 21778 transitions. [2019-09-10 06:12:36,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:36,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-09-10 06:12:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:36,699 INFO L225 Difference]: With dead ends: 14431 [2019-09-10 06:12:36,699 INFO L226 Difference]: Without dead ends: 14431 [2019-09-10 06:12:36,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:36,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14431 states. [2019-09-10 06:12:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14431 to 7519. [2019-09-10 06:12:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7519 states. [2019-09-10 06:12:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7519 states to 7519 states and 11388 transitions. [2019-09-10 06:12:36,863 INFO L78 Accepts]: Start accepts. Automaton has 7519 states and 11388 transitions. Word has length 300 [2019-09-10 06:12:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:36,863 INFO L475 AbstractCegarLoop]: Abstraction has 7519 states and 11388 transitions. [2019-09-10 06:12:36,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 7519 states and 11388 transitions. [2019-09-10 06:12:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-10 06:12:36,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:36,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:36,882 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:36,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:36,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1681679701, now seen corresponding path program 1 times [2019-09-10 06:12:36,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:36,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:36,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:36,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:36,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:37,202 INFO 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 06:12:37,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:37,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:37,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:37,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:37,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:37,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:37,205 INFO L87 Difference]: Start difference. First operand 7519 states and 11388 transitions. Second operand 4 states. [2019-09-10 06:12:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:37,325 INFO L93 Difference]: Finished difference Result 14700 states and 22218 transitions. [2019-09-10 06:12:37,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:37,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2019-09-10 06:12:37,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:37,358 INFO L225 Difference]: With dead ends: 14700 [2019-09-10 06:12:37,359 INFO L226 Difference]: Without dead ends: 14700 [2019-09-10 06:12:37,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14700 states. [2019-09-10 06:12:37,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14700 to 8381. [2019-09-10 06:12:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8381 states. [2019-09-10 06:12:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8381 states to 8381 states and 12812 transitions. [2019-09-10 06:12:37,530 INFO L78 Accepts]: Start accepts. Automaton has 8381 states and 12812 transitions. Word has length 300 [2019-09-10 06:12:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:37,531 INFO L475 AbstractCegarLoop]: Abstraction has 8381 states and 12812 transitions. [2019-09-10 06:12:37,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 8381 states and 12812 transitions. [2019-09-10 06:12:37,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-10 06:12:37,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:37,549 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:37,550 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:37,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:37,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1171308623, now seen corresponding path program 1 times [2019-09-10 06:12:37,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:37,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:37,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:37,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:37,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:37,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:37,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:37,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:37,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:37,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:37,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:37,823 INFO L87 Difference]: Start difference. First operand 8381 states and 12812 transitions. Second operand 3 states. [2019-09-10 06:12:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:37,966 INFO L93 Difference]: Finished difference Result 16460 states and 24998 transitions. [2019-09-10 06:12:37,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:37,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-09-10 06:12:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:38,000 INFO L225 Difference]: With dead ends: 16460 [2019-09-10 06:12:38,000 INFO L226 Difference]: Without dead ends: 16460 [2019-09-10 06:12:38,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:38,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16460 states. [2019-09-10 06:12:38,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16460 to 16376. [2019-09-10 06:12:38,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16376 states. [2019-09-10 06:12:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16376 states to 16376 states and 24897 transitions. [2019-09-10 06:12:38,261 INFO L78 Accepts]: Start accepts. Automaton has 16376 states and 24897 transitions. Word has length 300 [2019-09-10 06:12:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:38,262 INFO L475 AbstractCegarLoop]: Abstraction has 16376 states and 24897 transitions. [2019-09-10 06:12:38,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 16376 states and 24897 transitions. [2019-09-10 06:12:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-10 06:12:38,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:38,299 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:38,299 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:38,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:38,300 INFO L82 PathProgramCache]: Analyzing trace with hash 943792940, now seen corresponding path program 1 times [2019-09-10 06:12:38,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:38,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:38,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:38,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:38,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:38,617 INFO 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 06:12:38,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:38,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:38,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:38,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:38,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:38,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:38,620 INFO L87 Difference]: Start difference. First operand 16376 states and 24897 transitions. Second operand 4 states. [2019-09-10 06:12:38,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:38,757 INFO L93 Difference]: Finished difference Result 31264 states and 47327 transitions. [2019-09-10 06:12:38,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:38,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2019-09-10 06:12:38,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:38,807 INFO L225 Difference]: With dead ends: 31264 [2019-09-10 06:12:38,808 INFO L226 Difference]: Without dead ends: 31264 [2019-09-10 06:12:38,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:38,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31264 states. [2019-09-10 06:12:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31264 to 18969. [2019-09-10 06:12:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18969 states. [2019-09-10 06:12:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18969 states to 18969 states and 29177 transitions. [2019-09-10 06:12:39,174 INFO L78 Accepts]: Start accepts. Automaton has 18969 states and 29177 transitions. Word has length 300 [2019-09-10 06:12:39,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:39,174 INFO L475 AbstractCegarLoop]: Abstraction has 18969 states and 29177 transitions. [2019-09-10 06:12:39,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:39,175 INFO L276 IsEmpty]: Start isEmpty. Operand 18969 states and 29177 transitions. [2019-09-10 06:12:39,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-10 06:12:39,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:39,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:39,205 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:39,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:39,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1112064626, now seen corresponding path program 1 times [2019-09-10 06:12:39,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:39,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:39,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:39,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:39,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:39,980 INFO 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 06:12:39,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:39,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:39,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:39,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:39,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:39,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:39,982 INFO L87 Difference]: Start difference. First operand 18969 states and 29177 transitions. Second operand 3 states. [2019-09-10 06:12:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:40,094 INFO L93 Difference]: Finished difference Result 35051 states and 53327 transitions. [2019-09-10 06:12:40,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:40,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-09-10 06:12:40,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:40,139 INFO L225 Difference]: With dead ends: 35051 [2019-09-10 06:12:40,139 INFO L226 Difference]: Without dead ends: 35051 [2019-09-10 06:12:40,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:40,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35051 states. [2019-09-10 06:12:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35051 to 19553. [2019-09-10 06:12:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19553 states. [2019-09-10 06:12:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19553 states to 19553 states and 29853 transitions. [2019-09-10 06:12:40,502 INFO L78 Accepts]: Start accepts. Automaton has 19553 states and 29853 transitions. Word has length 301 [2019-09-10 06:12:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:40,502 INFO L475 AbstractCegarLoop]: Abstraction has 19553 states and 29853 transitions. [2019-09-10 06:12:40,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 19553 states and 29853 transitions. [2019-09-10 06:12:40,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 06:12:40,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:40,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:40,526 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:40,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:40,526 INFO L82 PathProgramCache]: Analyzing trace with hash -415895678, now seen corresponding path program 1 times [2019-09-10 06:12:40,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:40,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:40,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:40,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:40,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:40,841 INFO 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 06:12:40,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:40,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:40,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:40,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:40,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:40,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:40,844 INFO L87 Difference]: Start difference. First operand 19553 states and 29853 transitions. Second operand 4 states. [2019-09-10 06:12:41,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:41,014 INFO L93 Difference]: Finished difference Result 26162 states and 39753 transitions. [2019-09-10 06:12:41,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:41,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-10 06:12:41,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:41,056 INFO L225 Difference]: With dead ends: 26162 [2019-09-10 06:12:41,056 INFO L226 Difference]: Without dead ends: 26162 [2019-09-10 06:12:41,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:41,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26162 states. [2019-09-10 06:12:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26162 to 21113. [2019-09-10 06:12:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21113 states. [2019-09-10 06:12:41,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21113 states to 21113 states and 32361 transitions. [2019-09-10 06:12:41,509 INFO L78 Accepts]: Start accepts. Automaton has 21113 states and 32361 transitions. Word has length 302 [2019-09-10 06:12:41,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:41,509 INFO L475 AbstractCegarLoop]: Abstraction has 21113 states and 32361 transitions. [2019-09-10 06:12:41,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:41,509 INFO L276 IsEmpty]: Start isEmpty. Operand 21113 states and 32361 transitions. [2019-09-10 06:12:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 06:12:41,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:41,532 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:41,532 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:41,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1297132717, now seen corresponding path program 1 times [2019-09-10 06:12:41,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:41,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:41,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:42,018 INFO 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 06:12:42,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:42,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:42,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:42,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:42,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:42,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:42,021 INFO L87 Difference]: Start difference. First operand 21113 states and 32361 transitions. Second operand 4 states. [2019-09-10 06:12:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:42,266 INFO L93 Difference]: Finished difference Result 40785 states and 61819 transitions. [2019-09-10 06:12:42,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:42,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-10 06:12:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:42,320 INFO L225 Difference]: With dead ends: 40785 [2019-09-10 06:12:42,320 INFO L226 Difference]: Without dead ends: 40785 [2019-09-10 06:12:42,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40785 states. [2019-09-10 06:12:42,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40785 to 40688. [2019-09-10 06:12:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40688 states. [2019-09-10 06:12:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40688 states to 40688 states and 61695 transitions. [2019-09-10 06:12:42,847 INFO L78 Accepts]: Start accepts. Automaton has 40688 states and 61695 transitions. Word has length 302 [2019-09-10 06:12:42,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:42,847 INFO L475 AbstractCegarLoop]: Abstraction has 40688 states and 61695 transitions. [2019-09-10 06:12:42,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 40688 states and 61695 transitions. [2019-09-10 06:12:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-10 06:12:42,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:42,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:42,892 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:42,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:42,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1565661785, now seen corresponding path program 1 times [2019-09-10 06:12:42,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:42,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:42,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:42,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:42,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:43,047 INFO 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 06:12:43,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:43,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:43,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:43,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:43,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:43,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:43,050 INFO L87 Difference]: Start difference. First operand 40688 states and 61695 transitions. Second operand 3 states. [2019-09-10 06:12:43,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:43,478 INFO L93 Difference]: Finished difference Result 76881 states and 115893 transitions. [2019-09-10 06:12:43,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:43,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-10 06:12:43,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:43,566 INFO L225 Difference]: With dead ends: 76881 [2019-09-10 06:12:43,566 INFO L226 Difference]: Without dead ends: 76881 [2019-09-10 06:12:43,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76881 states. [2019-09-10 06:12:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76881 to 41450. [2019-09-10 06:12:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41450 states. [2019-09-10 06:12:44,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41450 states to 41450 states and 62741 transitions. [2019-09-10 06:12:44,113 INFO L78 Accepts]: Start accepts. Automaton has 41450 states and 62741 transitions. Word has length 304 [2019-09-10 06:12:44,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:44,113 INFO L475 AbstractCegarLoop]: Abstraction has 41450 states and 62741 transitions. [2019-09-10 06:12:44,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 41450 states and 62741 transitions. [2019-09-10 06:12:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-10 06:12:44,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:44,156 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:44,157 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:44,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:44,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1057740574, now seen corresponding path program 1 times [2019-09-10 06:12:44,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:44,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:44,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:44,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:44,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:44,399 INFO 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 06:12:44,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:44,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:44,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:44,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:44,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:44,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:44,401 INFO L87 Difference]: Start difference. First operand 41450 states and 62741 transitions. Second operand 3 states. [2019-09-10 06:12:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:44,669 INFO L93 Difference]: Finished difference Result 80945 states and 121747 transitions. [2019-09-10 06:12:44,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:44,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-10 06:12:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:44,759 INFO L225 Difference]: With dead ends: 80945 [2019-09-10 06:12:44,760 INFO L226 Difference]: Without dead ends: 80945 [2019-09-10 06:12:44,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80945 states. [2019-09-10 06:12:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80945 to 80848. [2019-09-10 06:12:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80848 states. [2019-09-10 06:12:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80848 states to 80848 states and 121623 transitions. [2019-09-10 06:12:46,535 INFO L78 Accepts]: Start accepts. Automaton has 80848 states and 121623 transitions. Word has length 304 [2019-09-10 06:12:46,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:46,536 INFO L475 AbstractCegarLoop]: Abstraction has 80848 states and 121623 transitions. [2019-09-10 06:12:46,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 80848 states and 121623 transitions. [2019-09-10 06:12:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-10 06:12:46,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:46,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:46,620 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:46,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:46,621 INFO L82 PathProgramCache]: Analyzing trace with hash -973318490, now seen corresponding path program 1 times [2019-09-10 06:12:46,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:46,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:46,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:46,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:46,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:46,780 INFO 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 06:12:46,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:46,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:46,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:46,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:46,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:46,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:46,783 INFO L87 Difference]: Start difference. First operand 80848 states and 121623 transitions. Second operand 3 states. [2019-09-10 06:12:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:47,221 INFO L93 Difference]: Finished difference Result 158065 states and 236793 transitions. [2019-09-10 06:12:47,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:47,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-09-10 06:12:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:47,388 INFO L225 Difference]: With dead ends: 158065 [2019-09-10 06:12:47,388 INFO L226 Difference]: Without dead ends: 158065 [2019-09-10 06:12:47,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:47,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158065 states. [2019-09-10 06:12:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158065 to 81964. [2019-09-10 06:12:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81964 states. [2019-09-10 06:12:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81964 states to 81964 states and 122925 transitions. [2019-09-10 06:12:50,413 INFO L78 Accepts]: Start accepts. Automaton has 81964 states and 122925 transitions. Word has length 305 [2019-09-10 06:12:50,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:50,413 INFO L475 AbstractCegarLoop]: Abstraction has 81964 states and 122925 transitions. [2019-09-10 06:12:50,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:50,414 INFO L276 IsEmpty]: Start isEmpty. Operand 81964 states and 122925 transitions. [2019-09-10 06:12:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:12:50,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:50,474 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:50,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:50,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1011642237, now seen corresponding path program 1 times [2019-09-10 06:12:50,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:50,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:50,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:50,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:50,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:50,698 INFO 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 06:12:50,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:50,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:50,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:50,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:50,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:50,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:50,700 INFO L87 Difference]: Start difference. First operand 81964 states and 122925 transitions. Second operand 3 states. [2019-09-10 06:12:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:51,520 INFO L93 Difference]: Finished difference Result 155805 states and 232691 transitions. [2019-09-10 06:12:51,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:51,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-10 06:12:51,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:51,694 INFO L225 Difference]: With dead ends: 155805 [2019-09-10 06:12:51,694 INFO L226 Difference]: Without dead ends: 155805 [2019-09-10 06:12:51,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:51,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155805 states. [2019-09-10 06:12:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155805 to 155708. [2019-09-10 06:12:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155708 states. [2019-09-10 06:12:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155708 states to 155708 states and 232567 transitions. [2019-09-10 06:12:56,414 INFO L78 Accepts]: Start accepts. Automaton has 155708 states and 232567 transitions. Word has length 306 [2019-09-10 06:12:56,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:56,414 INFO L475 AbstractCegarLoop]: Abstraction has 155708 states and 232567 transitions. [2019-09-10 06:12:56,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 155708 states and 232567 transitions. [2019-09-10 06:12:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:12:56,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:56,545 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:12:56,546 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:56,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:56,546 INFO L82 PathProgramCache]: Analyzing trace with hash -700324454, now seen corresponding path program 1 times [2019-09-10 06:12:56,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:56,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:56,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:56,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:56,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:56,851 INFO 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 06:12:56,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:56,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:56,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:56,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:56,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:56,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:56,853 INFO L87 Difference]: Start difference. First operand 155708 states and 232567 transitions. Second operand 4 states. [2019-09-10 06:12:57,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:57,608 INFO L93 Difference]: Finished difference Result 269927 states and 401470 transitions. [2019-09-10 06:12:57,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:57,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-09-10 06:12:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:57,936 INFO L225 Difference]: With dead ends: 269927 [2019-09-10 06:12:57,936 INFO L226 Difference]: Without dead ends: 269927 [2019-09-10 06:12:57,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:58,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269927 states. [2019-09-10 06:13:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269927 to 192822. [2019-09-10 06:13:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192822 states. [2019-09-10 06:13:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192822 states to 192822 states and 289762 transitions. [2019-09-10 06:13:00,567 INFO L78 Accepts]: Start accepts. Automaton has 192822 states and 289762 transitions. Word has length 306 [2019-09-10 06:13:00,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:00,567 INFO L475 AbstractCegarLoop]: Abstraction has 192822 states and 289762 transitions. [2019-09-10 06:13:00,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 192822 states and 289762 transitions. [2019-09-10 06:13:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:13:00,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:00,731 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:13:00,731 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:00,732 INFO L82 PathProgramCache]: Analyzing trace with hash 379502000, now seen corresponding path program 1 times [2019-09-10 06:13:00,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:00,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:00,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:00,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:00,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:00,866 INFO 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 06:13:00,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:00,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:00,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:00,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:00,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:00,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:00,868 INFO L87 Difference]: Start difference. First operand 192822 states and 289762 transitions. Second operand 3 states. [2019-09-10 06:13:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:01,972 INFO L93 Difference]: Finished difference Result 283159 states and 420318 transitions. [2019-09-10 06:13:01,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:01,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-10 06:13:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:02,255 INFO L225 Difference]: With dead ends: 283159 [2019-09-10 06:13:02,255 INFO L226 Difference]: Without dead ends: 283159 [2019-09-10 06:13:02,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:02,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283159 states. [2019-09-10 06:13:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283159 to 196150. [2019-09-10 06:13:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196150 states. [2019-09-10 06:13:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196150 states to 196150 states and 294338 transitions. [2019-09-10 06:13:05,563 INFO L78 Accepts]: Start accepts. Automaton has 196150 states and 294338 transitions. Word has length 308 [2019-09-10 06:13:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:05,563 INFO L475 AbstractCegarLoop]: Abstraction has 196150 states and 294338 transitions. [2019-09-10 06:13:05,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 196150 states and 294338 transitions. [2019-09-10 06:13:05,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-10 06:13:05,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:05,753 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:13:05,753 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:05,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash 86756029, now seen corresponding path program 1 times [2019-09-10 06:13:05,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:05,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:05,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:05,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:05,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:05,894 INFO 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 06:13:05,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:05,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:05,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:05,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:05,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:05,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:05,896 INFO L87 Difference]: Start difference. First operand 196150 states and 294338 transitions. Second operand 3 states. [2019-09-10 06:13:06,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:06,531 INFO L93 Difference]: Finished difference Result 287087 states and 424918 transitions. [2019-09-10 06:13:06,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:06,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-09-10 06:13:06,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:06,833 INFO L225 Difference]: With dead ends: 287087 [2019-09-10 06:13:06,833 INFO L226 Difference]: Without dead ends: 287087 [2019-09-10 06:13:06,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:07,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287087 states. [2019-09-10 06:13:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287087 to 200078. [2019-09-10 06:13:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200078 states. [2019-09-10 06:13:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200078 states to 200078 states and 298938 transitions. [2019-09-10 06:13:13,465 INFO L78 Accepts]: Start accepts. Automaton has 200078 states and 298938 transitions. Word has length 309 [2019-09-10 06:13:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:13,466 INFO L475 AbstractCegarLoop]: Abstraction has 200078 states and 298938 transitions. [2019-09-10 06:13:13,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 200078 states and 298938 transitions. [2019-09-10 06:13:13,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:13:13,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:13,624 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:13:13,625 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:13,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:13,625 INFO L82 PathProgramCache]: Analyzing trace with hash 816353955, now seen corresponding path program 1 times [2019-09-10 06:13:13,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:13,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:13,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:13,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:13,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:13,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:13,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:13:13,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:13,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:13:13,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:13:13,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:13:13,915 INFO L87 Difference]: Start difference. First operand 200078 states and 298938 transitions. Second operand 4 states. [2019-09-10 06:13:14,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:14,509 INFO L93 Difference]: Finished difference Result 262821 states and 388832 transitions. [2019-09-10 06:13:14,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:13:14,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-09-10 06:13:14,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:14,756 INFO L225 Difference]: With dead ends: 262821 [2019-09-10 06:13:14,756 INFO L226 Difference]: Without dead ends: 224689 [2019-09-10 06:13:14,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:13:14,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224689 states. [2019-09-10 06:13:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224689 to 224592. [2019-09-10 06:13:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224592 states. [2019-09-10 06:13:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224592 states to 224592 states and 332612 transitions. [2019-09-10 06:13:20,801 INFO L78 Accepts]: Start accepts. Automaton has 224592 states and 332612 transitions. Word has length 310 [2019-09-10 06:13:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:20,801 INFO L475 AbstractCegarLoop]: Abstraction has 224592 states and 332612 transitions. [2019-09-10 06:13:20,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 224592 states and 332612 transitions. [2019-09-10 06:13:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:13:21,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:21,748 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:13:21,748 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:21,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:21,748 INFO L82 PathProgramCache]: Analyzing trace with hash -404301481, now seen corresponding path program 1 times [2019-09-10 06:13:21,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:21,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:21,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:21,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:21,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:22,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:22,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:13:22,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:22,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:13:22,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:13:22,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:13:22,012 INFO L87 Difference]: Start difference. First operand 224592 states and 332612 transitions. Second operand 4 states. [2019-09-10 06:13:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:23,093 INFO L93 Difference]: Finished difference Result 403483 states and 593509 transitions. [2019-09-10 06:13:23,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:13:23,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-10 06:13:23,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:23,655 INFO L225 Difference]: With dead ends: 403483 [2019-09-10 06:13:23,655 INFO L226 Difference]: Without dead ends: 403483 [2019-09-10 06:13:23,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:13:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403483 states. [2019-09-10 06:13:32,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403483 to 297354. [2019-09-10 06:13:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297354 states. [2019-09-10 06:13:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297354 states to 297354 states and 441697 transitions. [2019-09-10 06:13:33,399 INFO L78 Accepts]: Start accepts. Automaton has 297354 states and 441697 transitions. Word has length 312 [2019-09-10 06:13:33,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:33,400 INFO L475 AbstractCegarLoop]: Abstraction has 297354 states and 441697 transitions. [2019-09-10 06:13:33,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:33,400 INFO L276 IsEmpty]: Start isEmpty. Operand 297354 states and 441697 transitions. [2019-09-10 06:13:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:13:33,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:33,718 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:13:33,718 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash -294170261, now seen corresponding path program 1 times [2019-09-10 06:13:33,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:33,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:33,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:33,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:33,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:34,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:34,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:34,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:34,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:34,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:34,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:34,737 INFO L87 Difference]: Start difference. First operand 297354 states and 441697 transitions. Second operand 3 states. [2019-09-10 06:13:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:35,560 INFO L93 Difference]: Finished difference Result 391499 states and 575485 transitions. [2019-09-10 06:13:35,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:35,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 06:13:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:36,023 INFO L225 Difference]: With dead ends: 391499 [2019-09-10 06:13:36,023 INFO L226 Difference]: Without dead ends: 391499 [2019-09-10 06:13:36,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391499 states. [2019-09-10 06:13:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391499 to 300042. [2019-09-10 06:13:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300042 states. [2019-09-10 06:13:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300042 states to 300042 states and 445345 transitions. [2019-09-10 06:13:45,956 INFO L78 Accepts]: Start accepts. Automaton has 300042 states and 445345 transitions. Word has length 314 [2019-09-10 06:13:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:45,956 INFO L475 AbstractCegarLoop]: Abstraction has 300042 states and 445345 transitions. [2019-09-10 06:13:45,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 300042 states and 445345 transitions. [2019-09-10 06:13:46,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:13:46,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:46,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:13:46,279 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:46,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:46,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2094927638, now seen corresponding path program 1 times [2019-09-10 06:13:46,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:46,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:46,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:46,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:46,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:46,447 INFO 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 06:13:46,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:46,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:46,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:46,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:46,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:46,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:46,449 INFO L87 Difference]: Start difference. First operand 300042 states and 445345 transitions. Second operand 3 states. [2019-09-10 06:13:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:47,946 INFO L93 Difference]: Finished difference Result 368555 states and 542509 transitions. [2019-09-10 06:13:47,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:47,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 06:13:47,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:49,852 INFO L225 Difference]: With dead ends: 368555 [2019-09-10 06:13:49,853 INFO L226 Difference]: Without dead ends: 368555 [2019-09-10 06:13:49,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:50,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368555 states. [2019-09-10 06:13:58,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368555 to 368458. [2019-09-10 06:13:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368458 states. [2019-09-10 06:13:59,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368458 states to 368458 states and 542385 transitions. [2019-09-10 06:13:59,936 INFO L78 Accepts]: Start accepts. Automaton has 368458 states and 542385 transitions. Word has length 314 [2019-09-10 06:13:59,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:59,937 INFO L475 AbstractCegarLoop]: Abstraction has 368458 states and 542385 transitions. [2019-09-10 06:13:59,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:59,937 INFO L276 IsEmpty]: Start isEmpty. Operand 368458 states and 542385 transitions. [2019-09-10 06:14:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:14:00,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:00,342 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:14:00,343 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:00,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:00,343 INFO L82 PathProgramCache]: Analyzing trace with hash -648955616, now seen corresponding path program 1 times [2019-09-10 06:14:00,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:00,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:00,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:00,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:00,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:00,933 INFO 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 06:14:00,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:00,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:14:00,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:00,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:14:00,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:14:00,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:14:00,935 INFO L87 Difference]: Start difference. First operand 368458 states and 542385 transitions. Second operand 8 states. [2019-09-10 06:14:07,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:07,559 INFO L93 Difference]: Finished difference Result 447148 states and 655634 transitions. [2019-09-10 06:14:07,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:14:07,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 314 [2019-09-10 06:14:07,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:08,085 INFO L225 Difference]: With dead ends: 447148 [2019-09-10 06:14:08,085 INFO L226 Difference]: Without dead ends: 447148 [2019-09-10 06:14:08,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:14:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447148 states. [2019-09-10 06:14:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447148 to 447146. [2019-09-10 06:14:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447146 states. [2019-09-10 06:14:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447146 states to 447146 states and 655633 transitions. [2019-09-10 06:14:14,542 INFO L78 Accepts]: Start accepts. Automaton has 447146 states and 655633 transitions. Word has length 314 [2019-09-10 06:14:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:14,542 INFO L475 AbstractCegarLoop]: Abstraction has 447146 states and 655633 transitions. [2019-09-10 06:14:14,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:14:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 447146 states and 655633 transitions. [2019-09-10 06:14:14,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:14:14,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:14,934 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:14:14,935 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:14,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:14,935 INFO L82 PathProgramCache]: Analyzing trace with hash -604099693, now seen corresponding path program 1 times [2019-09-10 06:14:14,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:14,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:14,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:14,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:14,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:15,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:15,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:15,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:15,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:15,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:15,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:15,142 INFO L87 Difference]: Start difference. First operand 447146 states and 655633 transitions. Second operand 3 states. [2019-09-10 06:14:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:17,730 INFO L93 Difference]: Finished difference Result 575701 states and 839279 transitions. [2019-09-10 06:14:17,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:17,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 06:14:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:25,906 INFO L225 Difference]: With dead ends: 575701 [2019-09-10 06:14:25,906 INFO L226 Difference]: Without dead ends: 575701 [2019-09-10 06:14:25,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:26,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575701 states. [2019-09-10 06:14:32,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575701 to 574487. [2019-09-10 06:14:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574487 states. [2019-09-10 06:14:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574487 states to 574487 states and 837746 transitions. [2019-09-10 06:14:33,745 INFO L78 Accepts]: Start accepts. Automaton has 574487 states and 837746 transitions. Word has length 314 [2019-09-10 06:14:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:33,746 INFO L475 AbstractCegarLoop]: Abstraction has 574487 states and 837746 transitions. [2019-09-10 06:14:33,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 574487 states and 837746 transitions. [2019-09-10 06:14:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:14:42,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:42,714 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:14:42,715 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:42,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:42,715 INFO L82 PathProgramCache]: Analyzing trace with hash 909000710, now seen corresponding path program 1 times [2019-09-10 06:14:42,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:42,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:42,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:42,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:42,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:43,851 INFO 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 06:14:43,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:43,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:14:43,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:43,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:14:43,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:14:43,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:14:43,862 INFO L87 Difference]: Start difference. First operand 574487 states and 837746 transitions. Second operand 15 states. [2019-09-10 06:14:48,190 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 06:14:48,428 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:14:49,592 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 06:14:50,307 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:14:50,456 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 06:14:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:53,500 INFO L93 Difference]: Finished difference Result 750513 states and 1102559 transitions. [2019-09-10 06:14:53,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 06:14:53,500 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 314 [2019-09-10 06:14:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:54,308 INFO L225 Difference]: With dead ends: 750513 [2019-09-10 06:14:54,309 INFO L226 Difference]: Without dead ends: 750513 [2019-09-10 06:14:54,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=698, Invalid=1752, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 06:14:54,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750513 states. [2019-09-10 06:15:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750513 to 595991. [2019-09-10 06:15:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595991 states. [2019-09-10 06:15:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595991 states to 595991 states and 865842 transitions. [2019-09-10 06:15:10,379 INFO L78 Accepts]: Start accepts. Automaton has 595991 states and 865842 transitions. Word has length 314 [2019-09-10 06:15:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:10,380 INFO L475 AbstractCegarLoop]: Abstraction has 595991 states and 865842 transitions. [2019-09-10 06:15:10,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:15:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 595991 states and 865842 transitions. [2019-09-10 06:15:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:15:10,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:15:10,937 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:10,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:10,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1117699188, now seen corresponding path program 1 times [2019-09-10 06:15:10,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:10,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:10,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:10,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:10,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:11,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:11,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:15:11,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:11,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:15:11,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:15:11,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:15:11,341 INFO L87 Difference]: Start difference. First operand 595991 states and 865842 transitions. Second operand 4 states. [2019-09-10 06:15:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:24,803 INFO L93 Difference]: Finished difference Result 1052570 states and 1504575 transitions. [2019-09-10 06:15:24,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:24,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-10 06:15:24,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:26,156 INFO L225 Difference]: With dead ends: 1052570 [2019-09-10 06:15:26,157 INFO L226 Difference]: Without dead ends: 1052570 [2019-09-10 06:15:26,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:15:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052570 states. [2019-09-10 06:15:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052570 to 1052483. [2019-09-10 06:15:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052483 states. [2019-09-10 06:16:04,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052483 states to 1052483 states and 1504469 transitions. [2019-09-10 06:16:04,116 INFO L78 Accepts]: Start accepts. Automaton has 1052483 states and 1504469 transitions. Word has length 314 [2019-09-10 06:16:04,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:04,116 INFO L475 AbstractCegarLoop]: Abstraction has 1052483 states and 1504469 transitions. [2019-09-10 06:16:04,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:16:04,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1052483 states and 1504469 transitions. [2019-09-10 06:16:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:16:04,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:04,984 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:04,984 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:04,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:04,985 INFO L82 PathProgramCache]: Analyzing trace with hash 522090607, now seen corresponding path program 1 times [2019-09-10 06:16:04,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:04,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:04,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:04,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:04,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:05,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:05,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:16:05,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:05,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:16:05,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:16:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:16:05,538 INFO L87 Difference]: Start difference. First operand 1052483 states and 1504469 transitions. Second operand 4 states. [2019-09-10 06:16:09,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:09,079 INFO L93 Difference]: Finished difference Result 1255440 states and 1773585 transitions. [2019-09-10 06:16:09,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:16:09,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-10 06:16:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:11,881 INFO L225 Difference]: With dead ends: 1255440 [2019-09-10 06:16:11,881 INFO L226 Difference]: Without dead ends: 1122412 [2019-09-10 06:16:11,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:16:12,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122412 states. [2019-09-10 06:16:34,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122412 to 1122299. [2019-09-10 06:16:34,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122299 states. [2019-09-10 06:16:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122299 states to 1122299 states and 1582277 transitions. [2019-09-10 06:16:50,995 INFO L78 Accepts]: Start accepts. Automaton has 1122299 states and 1582277 transitions. Word has length 314 [2019-09-10 06:16:50,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:50,996 INFO L475 AbstractCegarLoop]: Abstraction has 1122299 states and 1582277 transitions. [2019-09-10 06:16:50,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:16:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1122299 states and 1582277 transitions. [2019-09-10 06:16:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:16:54,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:54,449 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:54,449 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:54,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:54,449 INFO L82 PathProgramCache]: Analyzing trace with hash -764303373, now seen corresponding path program 1 times [2019-09-10 06:16:54,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:54,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:54,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:54,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:54,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:54,706 INFO 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 06:16:54,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:54,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:16:54,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:54,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:16:54,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:16:54,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:16:54,708 INFO L87 Difference]: Start difference. First operand 1122299 states and 1582277 transitions. Second operand 4 states. [2019-09-10 06:17:12,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:12,184 INFO L93 Difference]: Finished difference Result 2183257 states and 3074170 transitions. [2019-09-10 06:17:12,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:17:12,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-10 06:17:12,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:16,403 INFO L225 Difference]: With dead ends: 2183257 [2019-09-10 06:17:16,403 INFO L226 Difference]: Without dead ends: 2183257 [2019-09-10 06:17:16,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:17:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183257 states. [2019-09-10 06:17:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183257 to 1356838. [2019-09-10 06:17:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356838 states.