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.5.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:32:40,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:32:40,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:32:40,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:32:40,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:32:40,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:32:40,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:32:40,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:32:40,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:32:40,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:32:40,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:32:40,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:32:40,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:32:40,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:32:40,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:32:40,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:32:40,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:32:40,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:32:40,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:32:40,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:32:40,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:32:40,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:32:40,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:32:40,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:32:40,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:32:40,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:32:40,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:32:40,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:32:40,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:32:40,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:32:40,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:32:40,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:32:40,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:32:40,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:32:40,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:32:40,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:32:40,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:32:40,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:32:40,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:32:40,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:32:40,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:32:40,135 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:32:40,150 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:32:40,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:32:40,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:32:40,151 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:32:40,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:32:40,152 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:32:40,152 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:32:40,152 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:32:40,152 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:32:40,152 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:32:40,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:32:40,153 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:32:40,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:32:40,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:32:40,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:32:40,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:32:40,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:32:40,154 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:32:40,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:32:40,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:32:40,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:32:40,155 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:32:40,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:32:40,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:32:40,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:32:40,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:32:40,156 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:32:40,156 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:32:40,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:32:40,157 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:32:40,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:32:40,201 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:32:40,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:32:40,206 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:32:40,206 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:32:40,207 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 06:32:40,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2900b6c/142c6076a16d41c294a02748928cec46/FLAG94ce2718f [2019-09-10 06:32:40,910 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:32:40,911 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 06:32:40,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2900b6c/142c6076a16d41c294a02748928cec46/FLAG94ce2718f [2019-09-10 06:32:41,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2900b6c/142c6076a16d41c294a02748928cec46 [2019-09-10 06:32:41,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:32:41,100 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:32:41,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:32:41,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:32:41,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:32:41,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:32:41" (1/1) ... [2019-09-10 06:32:41,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbeadb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:32:41, skipping insertion in model container [2019-09-10 06:32:41,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:32:41" (1/1) ... [2019-09-10 06:32:41,116 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:32:41,205 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:32:41,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:32:41,916 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:32:42,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:32:42,372 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:32:42,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:32:42 WrapperNode [2019-09-10 06:32:42,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:32:42,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:32:42,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:32:42,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:32:42,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:32:42" (1/1) ... [2019-09-10 06:32:42,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:32:42" (1/1) ... [2019-09-10 06:32:42,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:32:42" (1/1) ... [2019-09-10 06:32:42,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:32:42" (1/1) ... [2019-09-10 06:32:42,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:32:42" (1/1) ... [2019-09-10 06:32:42,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:32:42" (1/1) ... [2019-09-10 06:32:42,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:32:42" (1/1) ... [2019-09-10 06:32:42,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:32:42,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:32:42,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:32:42,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:32:42,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:32:42" (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:32:42,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:32:42,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:32:42,598 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:32:42,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:32:42,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:32:42,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:32:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:32:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:32:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:32:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:32:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:32:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:32:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:32:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:32:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 06:32:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:32:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:32:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:32:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:32:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:32:45,106 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:32:45,107 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:32:45,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:32:45 BoogieIcfgContainer [2019-09-10 06:32:45,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:32:45,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:32:45,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:32:45,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:32:45,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:32:41" (1/3) ... [2019-09-10 06:32:45,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a46d24e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:32:45, skipping insertion in model container [2019-09-10 06:32:45,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:32:42" (2/3) ... [2019-09-10 06:32:45,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a46d24e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:32:45, skipping insertion in model container [2019-09-10 06:32:45,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:32:45" (3/3) ... [2019-09-10 06:32:45,116 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 06:32:45,126 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:32:45,135 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:32:45,153 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:32:45,178 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:32:45,178 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:32:45,178 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:32:45,178 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:32:45,179 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:32:45,179 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:32:45,179 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:32:45,179 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:32:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-09-10 06:32:45,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 06:32:45,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:45,250 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:45,253 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:45,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:45,259 INFO L82 PathProgramCache]: Analyzing trace with hash 326812692, now seen corresponding path program 1 times [2019-09-10 06:32:45,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:45,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:45,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:45,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:45,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:46,073 INFO 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:32:46,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:46,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:46,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:46,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:46,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:46,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:46,101 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 3 states. [2019-09-10 06:32:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:46,316 INFO L93 Difference]: Finished difference Result 922 states and 1654 transitions. [2019-09-10 06:32:46,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:46,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-10 06:32:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:46,377 INFO L225 Difference]: With dead ends: 922 [2019-09-10 06:32:46,378 INFO L226 Difference]: Without dead ends: 914 [2019-09-10 06:32:46,381 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:32:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-10 06:32:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 912. [2019-09-10 06:32:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-09-10 06:32:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1584 transitions. [2019-09-10 06:32:46,496 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1584 transitions. Word has length 208 [2019-09-10 06:32:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:46,497 INFO L475 AbstractCegarLoop]: Abstraction has 912 states and 1584 transitions. [2019-09-10 06:32:46,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1584 transitions. [2019-09-10 06:32:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 06:32:46,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:46,507 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:46,508 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:46,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:46,508 INFO L82 PathProgramCache]: Analyzing trace with hash -749134671, now seen corresponding path program 1 times [2019-09-10 06:32:46,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:46,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:46,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:46,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:46,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:32:46,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:46,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:46,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:46,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:46,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:46,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:46,894 INFO L87 Difference]: Start difference. First operand 912 states and 1584 transitions. Second operand 3 states. [2019-09-10 06:32:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:46,992 INFO L93 Difference]: Finished difference Result 1255 states and 2157 transitions. [2019-09-10 06:32:46,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:46,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-10 06:32:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:47,004 INFO L225 Difference]: With dead ends: 1255 [2019-09-10 06:32:47,005 INFO L226 Difference]: Without dead ends: 1255 [2019-09-10 06:32:47,008 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:32:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-09-10 06:32:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1253. [2019-09-10 06:32:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2019-09-10 06:32:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2156 transitions. [2019-09-10 06:32:47,088 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2156 transitions. Word has length 212 [2019-09-10 06:32:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:47,090 INFO L475 AbstractCegarLoop]: Abstraction has 1253 states and 2156 transitions. [2019-09-10 06:32:47,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2156 transitions. [2019-09-10 06:32:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 06:32:47,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:47,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:47,100 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:47,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:47,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1492476271, now seen corresponding path program 1 times [2019-09-10 06:32:47,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:47,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:47,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:47,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:47,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:32:47,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:47,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:47,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:47,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:47,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:47,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:47,361 INFO L87 Difference]: Start difference. First operand 1253 states and 2156 transitions. Second operand 3 states. [2019-09-10 06:32:47,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:47,405 INFO L93 Difference]: Finished difference Result 1589 states and 2719 transitions. [2019-09-10 06:32:47,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:47,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-10 06:32:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:47,416 INFO L225 Difference]: With dead ends: 1589 [2019-09-10 06:32:47,417 INFO L226 Difference]: Without dead ends: 1589 [2019-09-10 06:32:47,417 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:32:47,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2019-09-10 06:32:47,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1587. [2019-09-10 06:32:47,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2019-09-10 06:32:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2718 transitions. [2019-09-10 06:32:47,462 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2718 transitions. Word has length 216 [2019-09-10 06:32:47,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:47,463 INFO L475 AbstractCegarLoop]: Abstraction has 1587 states and 2718 transitions. [2019-09-10 06:32:47,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2718 transitions. [2019-09-10 06:32:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 06:32:47,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:47,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] [2019-09-10 06:32:47,473 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:47,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:47,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2071522764, now seen corresponding path program 1 times [2019-09-10 06:32:47,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:47,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:47,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:47,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:47,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:47,936 INFO 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:32:47,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:47,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:47,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:47,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:47,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:47,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:47,939 INFO L87 Difference]: Start difference. First operand 1587 states and 2718 transitions. Second operand 3 states. [2019-09-10 06:32:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:48,007 INFO L93 Difference]: Finished difference Result 2524 states and 4277 transitions. [2019-09-10 06:32:48,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:48,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-10 06:32:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:48,027 INFO L225 Difference]: With dead ends: 2524 [2019-09-10 06:32:48,027 INFO L226 Difference]: Without dead ends: 2524 [2019-09-10 06:32:48,028 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:32:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2019-09-10 06:32:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 2522. [2019-09-10 06:32:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2522 states. [2019-09-10 06:32:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 4276 transitions. [2019-09-10 06:32:48,118 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 4276 transitions. Word has length 216 [2019-09-10 06:32:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:48,119 INFO L475 AbstractCegarLoop]: Abstraction has 2522 states and 4276 transitions. [2019-09-10 06:32:48,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:48,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 4276 transitions. [2019-09-10 06:32:48,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-10 06:32:48,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:48,124 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:48,124 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:48,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:48,125 INFO L82 PathProgramCache]: Analyzing trace with hash -108508146, now seen corresponding path program 1 times [2019-09-10 06:32:48,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:48,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:48,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:48,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:48,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:32:48,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:48,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:48,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:48,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:48,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:48,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:48,313 INFO L87 Difference]: Start difference. First operand 2522 states and 4276 transitions. Second operand 3 states. [2019-09-10 06:32:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:48,368 INFO L93 Difference]: Finished difference Result 3373 states and 5695 transitions. [2019-09-10 06:32:48,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:48,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-09-10 06:32:48,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:48,480 INFO L225 Difference]: With dead ends: 3373 [2019-09-10 06:32:48,481 INFO L226 Difference]: Without dead ends: 3373 [2019-09-10 06:32:48,482 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:32:48,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2019-09-10 06:32:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3371. [2019-09-10 06:32:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3371 states. [2019-09-10 06:32:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3371 states to 3371 states and 5694 transitions. [2019-09-10 06:32:48,572 INFO L78 Accepts]: Start accepts. Automaton has 3371 states and 5694 transitions. Word has length 220 [2019-09-10 06:32:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:48,572 INFO L475 AbstractCegarLoop]: Abstraction has 3371 states and 5694 transitions. [2019-09-10 06:32:48,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3371 states and 5694 transitions. [2019-09-10 06:32:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-10 06:32:48,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:48,577 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:48,578 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:48,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:48,578 INFO L82 PathProgramCache]: Analyzing trace with hash 959349905, now seen corresponding path program 1 times [2019-09-10 06:32:48,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:48,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:48,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:48,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:48,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:48,809 INFO 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:32:48,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:48,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:48,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:48,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:48,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:48,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:48,811 INFO L87 Difference]: Start difference. First operand 3371 states and 5694 transitions. Second operand 3 states. [2019-09-10 06:32:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:48,887 INFO L93 Difference]: Finished difference Result 5914 states and 9895 transitions. [2019-09-10 06:32:48,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:48,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-09-10 06:32:48,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:48,919 INFO L225 Difference]: With dead ends: 5914 [2019-09-10 06:32:48,920 INFO L226 Difference]: Without dead ends: 5914 [2019-09-10 06:32:48,921 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:32:48,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5914 states. [2019-09-10 06:32:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5914 to 5912. [2019-09-10 06:32:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2019-09-10 06:32:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 9894 transitions. [2019-09-10 06:32:49,078 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 9894 transitions. Word has length 220 [2019-09-10 06:32:49,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:49,079 INFO L475 AbstractCegarLoop]: Abstraction has 5912 states and 9894 transitions. [2019-09-10 06:32:49,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 9894 transitions. [2019-09-10 06:32:49,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 06:32:49,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:49,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:49,090 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:49,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:49,098 INFO L82 PathProgramCache]: Analyzing trace with hash 792658975, now seen corresponding path program 1 times [2019-09-10 06:32:49,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:49,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:49,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:49,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:49,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:49,416 INFO 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:32:49,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:49,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:49,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:49,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:49,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:49,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:49,419 INFO L87 Difference]: Start difference. First operand 5912 states and 9894 transitions. Second operand 3 states. [2019-09-10 06:32:49,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:49,490 INFO L93 Difference]: Finished difference Result 8105 states and 13535 transitions. [2019-09-10 06:32:49,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:49,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-09-10 06:32:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:49,565 INFO L225 Difference]: With dead ends: 8105 [2019-09-10 06:32:49,566 INFO L226 Difference]: Without dead ends: 8105 [2019-09-10 06:32:49,566 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:32:49,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8105 states. [2019-09-10 06:32:49,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8105 to 8103. [2019-09-10 06:32:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8103 states. [2019-09-10 06:32:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13534 transitions. [2019-09-10 06:32:49,805 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13534 transitions. Word has length 224 [2019-09-10 06:32:49,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:49,806 INFO L475 AbstractCegarLoop]: Abstraction has 8103 states and 13534 transitions. [2019-09-10 06:32:49,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13534 transitions. [2019-09-10 06:32:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 06:32:49,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:49,811 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:49,811 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:49,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:49,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1043249236, now seen corresponding path program 1 times [2019-09-10 06:32:49,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:49,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:49,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:49,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:49,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:50,071 INFO 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:32:50,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:50,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:50,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:50,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:50,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:50,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:50,074 INFO L87 Difference]: Start difference. First operand 8103 states and 13534 transitions. Second operand 3 states. [2019-09-10 06:32:50,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:50,159 INFO L93 Difference]: Finished difference Result 14936 states and 24713 transitions. [2019-09-10 06:32:50,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:50,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-09-10 06:32:50,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:50,199 INFO L225 Difference]: With dead ends: 14936 [2019-09-10 06:32:50,199 INFO L226 Difference]: Without dead ends: 14936 [2019-09-10 06:32:50,200 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:32:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14936 states. [2019-09-10 06:32:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14936 to 14934. [2019-09-10 06:32:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14934 states. [2019-09-10 06:32:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14934 states to 14934 states and 24712 transitions. [2019-09-10 06:32:50,566 INFO L78 Accepts]: Start accepts. Automaton has 14934 states and 24712 transitions. Word has length 224 [2019-09-10 06:32:50,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:50,567 INFO L475 AbstractCegarLoop]: Abstraction has 14934 states and 24712 transitions. [2019-09-10 06:32:50,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:50,567 INFO L276 IsEmpty]: Start isEmpty. Operand 14934 states and 24712 transitions. [2019-09-10 06:32:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 06:32:50,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:50,572 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:50,572 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:50,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:50,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1254462577, now seen corresponding path program 1 times [2019-09-10 06:32:50,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:50,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:50,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:50,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:50,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:50,983 INFO 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:32:50,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:50,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:32:50,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:50,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:32:50,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:32:50,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:32:50,986 INFO L87 Difference]: Start difference. First operand 14934 states and 24712 transitions. Second operand 7 states. [2019-09-10 06:32:52,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:52,073 INFO L93 Difference]: Finished difference Result 90509 states and 150293 transitions. [2019-09-10 06:32:52,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:32:52,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2019-09-10 06:32:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:52,324 INFO L225 Difference]: With dead ends: 90509 [2019-09-10 06:32:52,324 INFO L226 Difference]: Without dead ends: 90509 [2019-09-10 06:32:52,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:32:52,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90509 states. [2019-09-10 06:32:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90509 to 29107. [2019-09-10 06:32:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29107 states. [2019-09-10 06:32:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29107 states to 29107 states and 47961 transitions. [2019-09-10 06:32:54,438 INFO L78 Accepts]: Start accepts. Automaton has 29107 states and 47961 transitions. Word has length 228 [2019-09-10 06:32:54,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:54,439 INFO L475 AbstractCegarLoop]: Abstraction has 29107 states and 47961 transitions. [2019-09-10 06:32:54,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:32:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 29107 states and 47961 transitions. [2019-09-10 06:32:54,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 06:32:54,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:54,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:54,444 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:54,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:54,445 INFO L82 PathProgramCache]: Analyzing trace with hash 162908202, now seen corresponding path program 1 times [2019-09-10 06:32:54,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:54,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:54,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:54,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:54,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:32:54,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:54,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:32:54,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:54,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:32:54,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:32:54,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:32:54,632 INFO L87 Difference]: Start difference. First operand 29107 states and 47961 transitions. Second operand 4 states. [2019-09-10 06:32:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:54,907 INFO L93 Difference]: Finished difference Result 51308 states and 84989 transitions. [2019-09-10 06:32:54,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:32:54,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-09-10 06:32:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:55,003 INFO L225 Difference]: With dead ends: 51308 [2019-09-10 06:32:55,003 INFO L226 Difference]: Without dead ends: 51308 [2019-09-10 06:32:55,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:32:55,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51308 states. [2019-09-10 06:32:55,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51308 to 43862. [2019-09-10 06:32:55,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43862 states. [2019-09-10 06:32:55,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43862 states to 43862 states and 72426 transitions. [2019-09-10 06:32:55,989 INFO L78 Accepts]: Start accepts. Automaton has 43862 states and 72426 transitions. Word has length 229 [2019-09-10 06:32:55,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:55,989 INFO L475 AbstractCegarLoop]: Abstraction has 43862 states and 72426 transitions. [2019-09-10 06:32:55,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:32:55,989 INFO L276 IsEmpty]: Start isEmpty. Operand 43862 states and 72426 transitions. [2019-09-10 06:32:55,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 06:32:55,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:55,994 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:55,995 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:55,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:55,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1006966476, now seen corresponding path program 1 times [2019-09-10 06:32:55,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:55,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:55,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:56,184 INFO 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:32:56,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:56,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:56,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:56,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:56,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:56,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:56,186 INFO L87 Difference]: Start difference. First operand 43862 states and 72426 transitions. Second operand 3 states. [2019-09-10 06:32:56,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:56,392 INFO L93 Difference]: Finished difference Result 61182 states and 100890 transitions. [2019-09-10 06:32:56,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:56,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-10 06:32:56,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:56,484 INFO L225 Difference]: With dead ends: 61182 [2019-09-10 06:32:56,484 INFO L226 Difference]: Without dead ends: 61182 [2019-09-10 06:32:56,485 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:32:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61182 states. [2019-09-10 06:32:58,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61182 to 61180. [2019-09-10 06:32:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61180 states. [2019-09-10 06:32:58,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61180 states to 61180 states and 100889 transitions. [2019-09-10 06:32:58,348 INFO L78 Accepts]: Start accepts. Automaton has 61180 states and 100889 transitions. Word has length 229 [2019-09-10 06:32:58,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:58,349 INFO L475 AbstractCegarLoop]: Abstraction has 61180 states and 100889 transitions. [2019-09-10 06:32:58,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 61180 states and 100889 transitions. [2019-09-10 06:32:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 06:32:58,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:58,354 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:58,354 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:58,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:58,355 INFO L82 PathProgramCache]: Analyzing trace with hash -791244133, now seen corresponding path program 1 times [2019-09-10 06:32:58,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:58,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:58,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:58,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:58,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:58,517 INFO 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:32:58,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:58,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:58,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:58,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:58,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:58,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:58,520 INFO L87 Difference]: Start difference. First operand 61180 states and 100889 transitions. Second operand 3 states. [2019-09-10 06:32:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:58,771 INFO L93 Difference]: Finished difference Result 92060 states and 151941 transitions. [2019-09-10 06:32:58,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:58,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-10 06:32:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:58,901 INFO L225 Difference]: With dead ends: 92060 [2019-09-10 06:32:58,901 INFO L226 Difference]: Without dead ends: 92060 [2019-09-10 06:32:58,902 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:32:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92060 states. [2019-09-10 06:33:00,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92060 to 92058. [2019-09-10 06:33:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92058 states. [2019-09-10 06:33:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92058 states to 92058 states and 151940 transitions. [2019-09-10 06:33:00,137 INFO L78 Accepts]: Start accepts. Automaton has 92058 states and 151940 transitions. Word has length 229 [2019-09-10 06:33:00,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:00,137 INFO L475 AbstractCegarLoop]: Abstraction has 92058 states and 151940 transitions. [2019-09-10 06:33:00,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 92058 states and 151940 transitions. [2019-09-10 06:33:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 06:33:00,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:00,142 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:00,142 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:00,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:00,142 INFO L82 PathProgramCache]: Analyzing trace with hash 689018968, now seen corresponding path program 1 times [2019-09-10 06:33:00,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:00,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:00,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:00,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:00,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:00,314 INFO 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:33:00,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:00,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:33:00,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:00,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:33:00,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:33:00,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:33:00,316 INFO L87 Difference]: Start difference. First operand 92058 states and 151940 transitions. Second operand 4 states. [2019-09-10 06:33:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:02,658 INFO L93 Difference]: Finished difference Result 180903 states and 298698 transitions. [2019-09-10 06:33:02,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:33:02,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-09-10 06:33:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:02,891 INFO L225 Difference]: With dead ends: 180903 [2019-09-10 06:33:02,891 INFO L226 Difference]: Without dead ends: 180903 [2019-09-10 06:33:02,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:33:03,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180903 states. [2019-09-10 06:33:04,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180903 to 151264. [2019-09-10 06:33:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151264 states. [2019-09-10 06:33:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151264 states to 151264 states and 249210 transitions. [2019-09-10 06:33:04,610 INFO L78 Accepts]: Start accepts. Automaton has 151264 states and 249210 transitions. Word has length 230 [2019-09-10 06:33:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:04,611 INFO L475 AbstractCegarLoop]: Abstraction has 151264 states and 249210 transitions. [2019-09-10 06:33:04,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:33:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 151264 states and 249210 transitions. [2019-09-10 06:33:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 06:33:04,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:04,614 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:04,614 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:04,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:04,615 INFO L82 PathProgramCache]: Analyzing trace with hash -176858447, now seen corresponding path program 1 times [2019-09-10 06:33:04,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:04,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:04,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:04,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:04,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:04,799 INFO 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:33:04,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:04,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:33:04,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:04,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:33:04,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:33:04,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:33:04,802 INFO L87 Difference]: Start difference. First operand 151264 states and 249210 transitions. Second operand 4 states. [2019-09-10 06:33:06,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:06,187 INFO L93 Difference]: Finished difference Result 296255 states and 488348 transitions. [2019-09-10 06:33:06,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:33:06,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-09-10 06:33:06,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:06,643 INFO L225 Difference]: With dead ends: 296255 [2019-09-10 06:33:06,643 INFO L226 Difference]: Without dead ends: 296255 [2019-09-10 06:33:06,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:33:06,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296255 states. [2019-09-10 06:33:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296255 to 248194. [2019-09-10 06:33:12,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248194 states. [2019-09-10 06:33:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248194 states to 248194 states and 408192 transitions. [2019-09-10 06:33:13,030 INFO L78 Accepts]: Start accepts. Automaton has 248194 states and 408192 transitions. Word has length 231 [2019-09-10 06:33:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:13,030 INFO L475 AbstractCegarLoop]: Abstraction has 248194 states and 408192 transitions. [2019-09-10 06:33:13,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:33:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 248194 states and 408192 transitions. [2019-09-10 06:33:13,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 06:33:13,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:13,033 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:13,033 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:13,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:13,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1244696513, now seen corresponding path program 1 times [2019-09-10 06:33:13,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:13,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:13,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:13,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:13,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:13,331 INFO 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:33:13,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:13,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:33:13,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:13,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:33:13,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:33:13,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:33:13,333 INFO L87 Difference]: Start difference. First operand 248194 states and 408192 transitions. Second operand 4 states. [2019-09-10 06:33:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:17,972 INFO L93 Difference]: Finished difference Result 488672 states and 804065 transitions. [2019-09-10 06:33:17,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:33:17,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-10 06:33:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:18,607 INFO L225 Difference]: With dead ends: 488672 [2019-09-10 06:33:18,608 INFO L226 Difference]: Without dead ends: 488672 [2019-09-10 06:33:18,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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:33:18,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488672 states. [2019-09-10 06:33:22,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488672 to 405720. [2019-09-10 06:33:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405720 states. [2019-09-10 06:33:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405720 states to 405720 states and 666142 transitions. [2019-09-10 06:33:31,840 INFO L78 Accepts]: Start accepts. Automaton has 405720 states and 666142 transitions. Word has length 232 [2019-09-10 06:33:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:31,840 INFO L475 AbstractCegarLoop]: Abstraction has 405720 states and 666142 transitions. [2019-09-10 06:33:31,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:33:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 405720 states and 666142 transitions. [2019-09-10 06:33:31,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-10 06:33:31,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:31,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:31,843 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:31,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:31,843 INFO L82 PathProgramCache]: Analyzing trace with hash 16619832, now seen corresponding path program 1 times [2019-09-10 06:33:31,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:31,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:31,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:31,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:31,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:32,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:32,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:33:32,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:32,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:33:32,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:33:32,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:33:32,136 INFO L87 Difference]: Start difference. First operand 405720 states and 666142 transitions. Second operand 8 states. [2019-09-10 06:33:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:45,588 INFO L93 Difference]: Finished difference Result 1832147 states and 3010961 transitions. [2019-09-10 06:33:45,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:33:45,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 233 [2019-09-10 06:33:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:48,356 INFO L225 Difference]: With dead ends: 1832147 [2019-09-10 06:33:48,356 INFO L226 Difference]: Without dead ends: 1832147 [2019-09-10 06:33:48,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:33:49,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832147 states. [2019-09-10 06:34:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832147 to 1110422. [2019-09-10 06:34:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110422 states. [2019-09-10 06:34:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110422 states to 1110422 states and 1815836 transitions. [2019-09-10 06:34:31,297 INFO L78 Accepts]: Start accepts. Automaton has 1110422 states and 1815836 transitions. Word has length 233 [2019-09-10 06:34:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:31,298 INFO L475 AbstractCegarLoop]: Abstraction has 1110422 states and 1815836 transitions. [2019-09-10 06:34:31,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:34:31,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1110422 states and 1815836 transitions. [2019-09-10 06:34:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-10 06:34:31,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:31,300 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:31,301 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:31,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:31,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1597136680, now seen corresponding path program 1 times [2019-09-10 06:34:31,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:31,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:31,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:31,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:31,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:34:31,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:31,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:34:31,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:31,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:34:31,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:34:31,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:34:31,803 INFO L87 Difference]: Start difference. First operand 1110422 states and 1815836 transitions. Second operand 7 states. [2019-09-10 06:34:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:45,722 INFO L93 Difference]: Finished difference Result 1576882 states and 2580621 transitions. [2019-09-10 06:34:45,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:34:45,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-09-10 06:34:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:49,535 INFO L225 Difference]: With dead ends: 1576882 [2019-09-10 06:34:49,535 INFO L226 Difference]: Without dead ends: 1576882 [2019-09-10 06:34:49,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:34:50,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576882 states. [2019-09-10 06:35:30,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576882 to 1110422. [2019-09-10 06:35:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110422 states. [2019-09-10 06:35:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110422 states to 1110422 states and 1812711 transitions. [2019-09-10 06:35:46,313 INFO L78 Accepts]: Start accepts. Automaton has 1110422 states and 1812711 transitions. Word has length 235 [2019-09-10 06:35:46,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:46,313 INFO L475 AbstractCegarLoop]: Abstraction has 1110422 states and 1812711 transitions. [2019-09-10 06:35:46,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:35:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1110422 states and 1812711 transitions. [2019-09-10 06:35:46,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 06:35:46,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:46,315 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:46,315 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:46,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:46,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1397893136, now seen corresponding path program 1 times [2019-09-10 06:35:46,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:46,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:46,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:46,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:46,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:35:46,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:46,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:35:46,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:46,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:35:46,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:35:46,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:35:46,770 INFO L87 Difference]: Start difference. First operand 1110422 states and 1812711 transitions. Second operand 7 states. [2019-09-10 06:36:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:11,237 INFO L93 Difference]: Finished difference Result 2691953 states and 4398360 transitions. [2019-09-10 06:36:11,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:36:11,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 238 [2019-09-10 06:36:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:15,081 INFO L225 Difference]: With dead ends: 2691953 [2019-09-10 06:36:15,081 INFO L226 Difference]: Without dead ends: 2691953 [2019-09-10 06:36:15,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:36:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691953 states.