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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:32:20,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:32:20,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:32:20,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:32:20,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:32:20,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:32:20,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:32:20,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:32:20,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:32:20,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:32:20,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:32:20,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:32:20,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:32:20,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:32:20,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:32:20,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:32:20,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:32:20,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:32:20,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:32:20,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:32:20,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:32:20,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:32:20,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:32:20,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:32:20,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:32:20,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:32:20,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:32:20,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:32:20,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:32:20,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:32:20,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:32:20,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:32:20,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:32:20,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:32:20,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:32:20,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:32:20,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:32:20,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:32:20,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:32:20,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:32:20,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:32:20,624 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:20,649 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:32:20,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:32:20,651 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:32:20,651 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:32:20,652 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:32:20,652 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:32:20,652 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:32:20,652 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:32:20,652 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:32:20,653 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:32:20,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:32:20,655 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:32:20,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:32:20,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:32:20,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:32:20,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:32:20,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:32:20,657 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:32:20,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:32:20,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:32:20,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:32:20,658 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:32:20,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:32:20,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:32:20,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:32:20,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:32:20,659 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:32:20,660 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:32:20,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:32:20,660 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:32:20,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:32:20,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:32:20,727 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:32:20,728 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:32:20,729 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:32:20,730 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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:32:20,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18bf09bdc/4cb99273bc5045e18a764b023aaac7f9/FLAG8235724b6 [2019-09-10 06:32:21,562 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:32:21,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:32:21,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18bf09bdc/4cb99273bc5045e18a764b023aaac7f9/FLAG8235724b6 [2019-09-10 06:32:21,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18bf09bdc/4cb99273bc5045e18a764b023aaac7f9 [2019-09-10 06:32:21,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:32:21,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:32:21,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:32:21,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:32:21,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:32:21,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:32:21" (1/1) ... [2019-09-10 06:32:21,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8dee914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:32:21, skipping insertion in model container [2019-09-10 06:32:21,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:32:21" (1/1) ... [2019-09-10 06:32:21,698 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:32:21,879 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:32:23,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:32:23,469 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:32:24,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:32:24,793 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:32:24,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:32:24 WrapperNode [2019-09-10 06:32:24,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:32:24,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:32:24,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:32:24,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:32:24,819 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:24" (1/1) ... [2019-09-10 06:32:24,822 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:24" (1/1) ... [2019-09-10 06:32:24,895 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:24" (1/1) ... [2019-09-10 06:32:24,896 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:24" (1/1) ... [2019-09-10 06:32:24,987 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:24" (1/1) ... [2019-09-10 06:32:25,047 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:24" (1/1) ... [2019-09-10 06:32:25,064 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:24" (1/1) ... [2019-09-10 06:32:25,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:32:25,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:32:25,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:32:25,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:32:25,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:32:24" (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:25,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:32:25,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:32:25,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:32:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:32:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:32:25,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:32:25,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:32:25,190 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:32:25,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:32:25,191 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:32:25,191 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:32:25,191 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:32:25,192 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:32:25,192 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:32:25,192 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:32:25,192 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 06:32:25,193 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:32:25,193 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:32:25,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:32:25,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:32:25,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:32:29,197 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:32:29,198 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:32:29,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:32:29 BoogieIcfgContainer [2019-09-10 06:32:29,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:32:29,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:32:29,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:32:29,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:32:29,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:32:21" (1/3) ... [2019-09-10 06:32:29,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9a7b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:32:29, skipping insertion in model container [2019-09-10 06:32:29,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:32:24" (2/3) ... [2019-09-10 06:32:29,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9a7b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:32:29, skipping insertion in model container [2019-09-10 06:32:29,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:32:29" (3/3) ... [2019-09-10 06:32:29,213 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:32:29,224 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:32:29,250 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:32:29,272 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:32:29,303 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:32:29,304 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:32:29,304 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:32:29,304 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:32:29,304 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:32:29,304 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:32:29,304 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:32:29,305 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:32:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states. [2019-09-10 06:32:29,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-10 06:32:29,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:29,409 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,412 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:29,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:29,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1569501097, now seen corresponding path program 1 times [2019-09-10 06:32:29,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:29,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:29,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:29,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:29,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:30,808 INFO 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:30,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:30,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:30,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:30,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:30,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:30,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:30,839 INFO L87 Difference]: Start difference. First operand 1340 states. Second operand 3 states. [2019-09-10 06:32:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:31,226 INFO L93 Difference]: Finished difference Result 2001 states and 3573 transitions. [2019-09-10 06:32:31,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:31,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 476 [2019-09-10 06:32:31,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:31,279 INFO L225 Difference]: With dead ends: 2001 [2019-09-10 06:32:31,280 INFO L226 Difference]: Without dead ends: 1993 [2019-09-10 06:32:31,284 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:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2019-09-10 06:32:31,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1991. [2019-09-10 06:32:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2019-09-10 06:32:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 3230 transitions. [2019-09-10 06:32:31,440 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 3230 transitions. Word has length 476 [2019-09-10 06:32:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:31,446 INFO L475 AbstractCegarLoop]: Abstraction has 1991 states and 3230 transitions. [2019-09-10 06:32:31,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 3230 transitions. [2019-09-10 06:32:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-10 06:32:31,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:31,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,461 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:31,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:31,463 INFO L82 PathProgramCache]: Analyzing trace with hash -534642427, now seen corresponding path program 1 times [2019-09-10 06:32:31,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:31,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:31,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:31,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:31,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:33,543 INFO 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:33,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:33,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:32:33,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:33,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:32:33,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:32:33,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:32:33,549 INFO L87 Difference]: Start difference. First operand 1991 states and 3230 transitions. Second operand 4 states. [2019-09-10 06:32:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:33,796 INFO L93 Difference]: Finished difference Result 3930 states and 6349 transitions. [2019-09-10 06:32:33,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:32:33,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 476 [2019-09-10 06:32:33,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:33,823 INFO L225 Difference]: With dead ends: 3930 [2019-09-10 06:32:33,823 INFO L226 Difference]: Without dead ends: 3930 [2019-09-10 06:32:33,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:32:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2019-09-10 06:32:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 3928. [2019-09-10 06:32:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2019-09-10 06:32:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 6348 transitions. [2019-09-10 06:32:33,958 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 6348 transitions. Word has length 476 [2019-09-10 06:32:33,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:33,960 INFO L475 AbstractCegarLoop]: Abstraction has 3928 states and 6348 transitions. [2019-09-10 06:32:33,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:32:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 6348 transitions. [2019-09-10 06:32:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-09-10 06:32:33,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:33,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,983 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:33,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:33,984 INFO L82 PathProgramCache]: Analyzing trace with hash 107997406, now seen corresponding path program 1 times [2019-09-10 06:32:33,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:33,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:33,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:33,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:33,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:32:34,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:34,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:34,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:34,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:34,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:34,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:34,803 INFO L87 Difference]: Start difference. First operand 3928 states and 6348 transitions. Second operand 3 states. [2019-09-10 06:32:34,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:34,996 INFO L93 Difference]: Finished difference Result 7768 states and 12510 transitions. [2019-09-10 06:32:34,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:34,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 478 [2019-09-10 06:32:34,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:35,035 INFO L225 Difference]: With dead ends: 7768 [2019-09-10 06:32:35,035 INFO L226 Difference]: Without dead ends: 7768 [2019-09-10 06:32:35,036 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:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7768 states. [2019-09-10 06:32:35,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7768 to 7766. [2019-09-10 06:32:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7766 states. [2019-09-10 06:32:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7766 states to 7766 states and 12509 transitions. [2019-09-10 06:32:35,290 INFO L78 Accepts]: Start accepts. Automaton has 7766 states and 12509 transitions. Word has length 478 [2019-09-10 06:32:35,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:35,291 INFO L475 AbstractCegarLoop]: Abstraction has 7766 states and 12509 transitions. [2019-09-10 06:32:35,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:35,291 INFO L276 IsEmpty]: Start isEmpty. Operand 7766 states and 12509 transitions. [2019-09-10 06:32:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-10 06:32:35,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:35,320 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,321 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:35,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:35,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2062931718, now seen corresponding path program 1 times [2019-09-10 06:32:35,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:35,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:35,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:35,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:35,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:35,632 INFO 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:35,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:35,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:35,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:35,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:35,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:35,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:35,634 INFO L87 Difference]: Start difference. First operand 7766 states and 12509 transitions. Second operand 3 states. [2019-09-10 06:32:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:35,775 INFO L93 Difference]: Finished difference Result 15487 states and 24930 transitions. [2019-09-10 06:32:35,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:35,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 479 [2019-09-10 06:32:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:35,841 INFO L225 Difference]: With dead ends: 15487 [2019-09-10 06:32:35,841 INFO L226 Difference]: Without dead ends: 15487 [2019-09-10 06:32:35,842 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:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15487 states. [2019-09-10 06:32:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15487 to 7813. [2019-09-10 06:32:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7813 states. [2019-09-10 06:32:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7813 states to 7813 states and 12583 transitions. [2019-09-10 06:32:36,191 INFO L78 Accepts]: Start accepts. Automaton has 7813 states and 12583 transitions. Word has length 479 [2019-09-10 06:32:36,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:36,192 INFO L475 AbstractCegarLoop]: Abstraction has 7813 states and 12583 transitions. [2019-09-10 06:32:36,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:36,193 INFO L276 IsEmpty]: Start isEmpty. Operand 7813 states and 12583 transitions. [2019-09-10 06:32:36,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-09-10 06:32:36,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:36,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,220 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:36,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:36,221 INFO L82 PathProgramCache]: Analyzing trace with hash -766778663, now seen corresponding path program 1 times [2019-09-10 06:32:36,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:36,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:36,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:36,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:36,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:37,584 INFO 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:37,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:37,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:37,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:37,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:37,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:37,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:37,588 INFO L87 Difference]: Start difference. First operand 7813 states and 12583 transitions. Second operand 3 states. [2019-09-10 06:32:37,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:37,878 INFO L93 Difference]: Finished difference Result 15302 states and 24522 transitions. [2019-09-10 06:32:37,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:37,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 480 [2019-09-10 06:32:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:37,929 INFO L225 Difference]: With dead ends: 15302 [2019-09-10 06:32:37,929 INFO L226 Difference]: Without dead ends: 15302 [2019-09-10 06:32:37,930 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:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15302 states. [2019-09-10 06:32:38,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15302 to 15300. [2019-09-10 06:32:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15300 states. [2019-09-10 06:32:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15300 states to 15300 states and 24521 transitions. [2019-09-10 06:32:38,395 INFO L78 Accepts]: Start accepts. Automaton has 15300 states and 24521 transitions. Word has length 480 [2019-09-10 06:32:38,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:38,396 INFO L475 AbstractCegarLoop]: Abstraction has 15300 states and 24521 transitions. [2019-09-10 06:32:38,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 15300 states and 24521 transitions. [2019-09-10 06:32:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-09-10 06:32:38,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:38,431 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,431 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:38,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:38,432 INFO L82 PathProgramCache]: Analyzing trace with hash -92545186, now seen corresponding path program 1 times [2019-09-10 06:32:38,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:38,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:38,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:38,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:38,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:38,697 INFO 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:38,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:38,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:38,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:38,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:38,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:38,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:38,699 INFO L87 Difference]: Start difference. First operand 15300 states and 24521 transitions. Second operand 3 states. [2019-09-10 06:32:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:38,869 INFO L93 Difference]: Finished difference Result 30488 states and 48832 transitions. [2019-09-10 06:32:38,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:38,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 480 [2019-09-10 06:32:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:38,938 INFO L225 Difference]: With dead ends: 30488 [2019-09-10 06:32:38,938 INFO L226 Difference]: Without dead ends: 30488 [2019-09-10 06:32:38,938 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:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30488 states. [2019-09-10 06:32:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30488 to 15398. [2019-09-10 06:32:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15398 states. [2019-09-10 06:32:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15398 states to 15398 states and 24672 transitions. [2019-09-10 06:32:39,349 INFO L78 Accepts]: Start accepts. Automaton has 15398 states and 24672 transitions. Word has length 480 [2019-09-10 06:32:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:39,350 INFO L475 AbstractCegarLoop]: Abstraction has 15398 states and 24672 transitions. [2019-09-10 06:32:39,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 15398 states and 24672 transitions. [2019-09-10 06:32:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-09-10 06:32:39,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:39,388 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,388 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:39,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:39,389 INFO L82 PathProgramCache]: Analyzing trace with hash 229871095, now seen corresponding path program 1 times [2019-09-10 06:32:39,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:39,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:39,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:39,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:39,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:39,786 INFO 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:39,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:39,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:39,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:39,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:39,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:39,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:39,789 INFO L87 Difference]: Start difference. First operand 15398 states and 24672 transitions. Second operand 3 states. [2019-09-10 06:32:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:39,914 INFO L93 Difference]: Finished difference Result 30605 states and 48978 transitions. [2019-09-10 06:32:39,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:39,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 481 [2019-09-10 06:32:39,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:39,986 INFO L225 Difference]: With dead ends: 30605 [2019-09-10 06:32:39,986 INFO L226 Difference]: Without dead ends: 30605 [2019-09-10 06:32:39,987 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:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30605 states. [2019-09-10 06:32:40,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30605 to 15515. [2019-09-10 06:32:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15515 states. [2019-09-10 06:32:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15515 states to 15515 states and 24818 transitions. [2019-09-10 06:32:40,442 INFO L78 Accepts]: Start accepts. Automaton has 15515 states and 24818 transitions. Word has length 481 [2019-09-10 06:32:40,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:40,443 INFO L475 AbstractCegarLoop]: Abstraction has 15515 states and 24818 transitions. [2019-09-10 06:32:40,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 15515 states and 24818 transitions. [2019-09-10 06:32:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2019-09-10 06:32:40,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:40,473 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,473 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:40,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:40,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1332057297, now seen corresponding path program 1 times [2019-09-10 06:32:40,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:40,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:40,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:40,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:40,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:41,315 INFO 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:41,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:41,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:32:41,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:41,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:32:41,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:32:41,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:32:41,318 INFO L87 Difference]: Start difference. First operand 15515 states and 24818 transitions. Second operand 4 states. [2019-09-10 06:32:41,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:41,473 INFO L93 Difference]: Finished difference Result 30388 states and 48503 transitions. [2019-09-10 06:32:41,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:32:41,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 482 [2019-09-10 06:32:41,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:41,550 INFO L225 Difference]: With dead ends: 30388 [2019-09-10 06:32:41,550 INFO L226 Difference]: Without dead ends: 30388 [2019-09-10 06:32:41,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:32:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30388 states. [2019-09-10 06:32:41,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30388 to 16450. [2019-09-10 06:32:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16450 states. [2019-09-10 06:32:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16450 states to 16450 states and 26466 transitions. [2019-09-10 06:32:41,973 INFO L78 Accepts]: Start accepts. Automaton has 16450 states and 26466 transitions. Word has length 482 [2019-09-10 06:32:41,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:41,974 INFO L475 AbstractCegarLoop]: Abstraction has 16450 states and 26466 transitions. [2019-09-10 06:32:41,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:32:41,974 INFO L276 IsEmpty]: Start isEmpty. Operand 16450 states and 26466 transitions. [2019-09-10 06:32:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2019-09-10 06:32:42,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:42,030 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,031 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:42,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:42,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2119318772, now seen corresponding path program 1 times [2019-09-10 06:32:42,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:42,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:42,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:42,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:42,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:43,413 INFO 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:43,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:43,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:43,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:43,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:43,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:43,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:43,416 INFO L87 Difference]: Start difference. First operand 16450 states and 26466 transitions. Second operand 3 states. [2019-09-10 06:32:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:43,607 INFO L93 Difference]: Finished difference Result 31481 states and 50339 transitions. [2019-09-10 06:32:43,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:43,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 482 [2019-09-10 06:32:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:43,671 INFO L225 Difference]: With dead ends: 31481 [2019-09-10 06:32:43,672 INFO L226 Difference]: Without dead ends: 31481 [2019-09-10 06:32:43,672 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:43,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31481 states. [2019-09-10 06:32:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31481 to 31479. [2019-09-10 06:32:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31479 states. [2019-09-10 06:32:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31479 states to 31479 states and 50338 transitions. [2019-09-10 06:32:44,218 INFO L78 Accepts]: Start accepts. Automaton has 31479 states and 50338 transitions. Word has length 482 [2019-09-10 06:32:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:44,219 INFO L475 AbstractCegarLoop]: Abstraction has 31479 states and 50338 transitions. [2019-09-10 06:32:44,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 31479 states and 50338 transitions. [2019-09-10 06:32:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-09-10 06:32:44,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:44,255 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,255 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:44,256 INFO L82 PathProgramCache]: Analyzing trace with hash -668491437, now seen corresponding path program 1 times [2019-09-10 06:32:44,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:44,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:44,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:44,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:44,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:44,521 INFO 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:44,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:44,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:44,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:44,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:44,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:44,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:44,525 INFO L87 Difference]: Start difference. First operand 31479 states and 50338 transitions. Second operand 3 states. [2019-09-10 06:32:44,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:44,897 INFO L93 Difference]: Finished difference Result 59480 states and 94398 transitions. [2019-09-10 06:32:44,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:44,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 485 [2019-09-10 06:32:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:44,976 INFO L225 Difference]: With dead ends: 59480 [2019-09-10 06:32:44,976 INFO L226 Difference]: Without dead ends: 59480 [2019-09-10 06:32:44,977 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:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59480 states. [2019-09-10 06:32:45,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59480 to 31926. [2019-09-10 06:32:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31926 states. [2019-09-10 06:32:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31926 states to 31926 states and 51013 transitions. [2019-09-10 06:32:45,682 INFO L78 Accepts]: Start accepts. Automaton has 31926 states and 51013 transitions. Word has length 485 [2019-09-10 06:32:45,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:45,682 INFO L475 AbstractCegarLoop]: Abstraction has 31926 states and 51013 transitions. [2019-09-10 06:32:45,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 31926 states and 51013 transitions. [2019-09-10 06:32:45,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2019-09-10 06:32:45,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:45,718 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,718 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:45,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:45,719 INFO L82 PathProgramCache]: Analyzing trace with hash -454285750, now seen corresponding path program 1 times [2019-09-10 06:32:45,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:45,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:45,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:45,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:45,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:45,997 INFO 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:45,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:45,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:45,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:45,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:45,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:45,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:45,999 INFO L87 Difference]: Start difference. First operand 31926 states and 51013 transitions. Second operand 3 states. [2019-09-10 06:32:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:46,186 INFO L93 Difference]: Finished difference Result 60095 states and 95274 transitions. [2019-09-10 06:32:46,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:46,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 486 [2019-09-10 06:32:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:46,282 INFO L225 Difference]: With dead ends: 60095 [2019-09-10 06:32:46,282 INFO L226 Difference]: Without dead ends: 60095 [2019-09-10 06:32:46,284 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,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60095 states. [2019-09-10 06:32:47,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60095 to 32573. [2019-09-10 06:32:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32573 states. [2019-09-10 06:32:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32573 states to 32573 states and 51953 transitions. [2019-09-10 06:32:48,053 INFO L78 Accepts]: Start accepts. Automaton has 32573 states and 51953 transitions. Word has length 486 [2019-09-10 06:32:48,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:48,053 INFO L475 AbstractCegarLoop]: Abstraction has 32573 states and 51953 transitions. [2019-09-10 06:32:48,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 32573 states and 51953 transitions. [2019-09-10 06:32:48,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-10 06:32:48,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:48,092 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,092 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:48,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:48,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1125221313, now seen corresponding path program 1 times [2019-09-10 06:32:48,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:48,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:48,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:48,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:48,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:32:48,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:48,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:48,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:48,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:48,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:48,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:48,395 INFO L87 Difference]: Start difference. First operand 32573 states and 51953 transitions. Second operand 3 states. [2019-09-10 06:32:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:48,607 INFO L93 Difference]: Finished difference Result 60949 states and 96336 transitions. [2019-09-10 06:32:48,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:48,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 487 [2019-09-10 06:32:48,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:48,710 INFO L225 Difference]: With dead ends: 60949 [2019-09-10 06:32:48,710 INFO L226 Difference]: Without dead ends: 60949 [2019-09-10 06:32:48,711 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,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60949 states. [2019-09-10 06:32:49,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60949 to 33427. [2019-09-10 06:32:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33427 states. [2019-09-10 06:32:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33427 states to 33427 states and 53015 transitions. [2019-09-10 06:32:49,383 INFO L78 Accepts]: Start accepts. Automaton has 33427 states and 53015 transitions. Word has length 487 [2019-09-10 06:32:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:49,384 INFO L475 AbstractCegarLoop]: Abstraction has 33427 states and 53015 transitions. [2019-09-10 06:32:49,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 33427 states and 53015 transitions. [2019-09-10 06:32:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2019-09-10 06:32:49,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:49,644 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,645 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:49,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:49,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1133489197, now seen corresponding path program 1 times [2019-09-10 06:32:49,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:49,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:49,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:49,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:49,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:50,050 INFO 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,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:50,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:50,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:50,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:50,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:50,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:50,052 INFO L87 Difference]: Start difference. First operand 33427 states and 53015 transitions. Second operand 3 states. [2019-09-10 06:32:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:51,138 INFO L93 Difference]: Finished difference Result 53821 states and 83984 transitions. [2019-09-10 06:32:51,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:51,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 488 [2019-09-10 06:32:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:51,213 INFO L225 Difference]: With dead ends: 53821 [2019-09-10 06:32:51,213 INFO L226 Difference]: Without dead ends: 53821 [2019-09-10 06:32:51,213 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:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53821 states. [2019-09-10 06:32:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53821 to 53819. [2019-09-10 06:32:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53819 states. [2019-09-10 06:32:51,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53819 states to 53819 states and 83983 transitions. [2019-09-10 06:32:51,756 INFO L78 Accepts]: Start accepts. Automaton has 53819 states and 83983 transitions. Word has length 488 [2019-09-10 06:32:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:51,757 INFO L475 AbstractCegarLoop]: Abstraction has 53819 states and 83983 transitions. [2019-09-10 06:32:51,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:51,757 INFO L276 IsEmpty]: Start isEmpty. Operand 53819 states and 83983 transitions. [2019-09-10 06:32:51,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2019-09-10 06:32:51,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:51,795 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,796 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:51,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:51,796 INFO L82 PathProgramCache]: Analyzing trace with hash -907527363, now seen corresponding path program 1 times [2019-09-10 06:32:51,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:51,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:51,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:51,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:51,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:54,321 INFO 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,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:54,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:32:54,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:54,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:32:54,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:32:54,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:32:54,323 INFO L87 Difference]: Start difference. First operand 53819 states and 83983 transitions. Second operand 4 states. [2019-09-10 06:32:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:54,738 INFO L93 Difference]: Finished difference Result 105515 states and 164028 transitions. [2019-09-10 06:32:54,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:32:54,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 488 [2019-09-10 06:32:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:54,861 INFO L225 Difference]: With dead ends: 105515 [2019-09-10 06:32:54,862 INFO L226 Difference]: Without dead ends: 105515 [2019-09-10 06:32:54,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:32:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105515 states. [2019-09-10 06:32:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105515 to 105513. [2019-09-10 06:32:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105513 states. [2019-09-10 06:32:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105513 states to 105513 states and 164027 transitions. [2019-09-10 06:32:56,321 INFO L78 Accepts]: Start accepts. Automaton has 105513 states and 164027 transitions. Word has length 488 [2019-09-10 06:32:56,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:56,321 INFO L475 AbstractCegarLoop]: Abstraction has 105513 states and 164027 transitions. [2019-09-10 06:32:56,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:32:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 105513 states and 164027 transitions. [2019-09-10 06:32:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-10 06:32:56,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:56,386 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,386 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:56,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:56,387 INFO L82 PathProgramCache]: Analyzing trace with hash -699201506, now seen corresponding path program 1 times [2019-09-10 06:32:56,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:56,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:56,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:56,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:56,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:56,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:32:56,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:56,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:56,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:56,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:56,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:56,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:56,805 INFO L87 Difference]: Start difference. First operand 105513 states and 164027 transitions. Second operand 3 states. [2019-09-10 06:32:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:57,295 INFO L93 Difference]: Finished difference Result 207058 states and 320158 transitions. [2019-09-10 06:32:57,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:57,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 490 [2019-09-10 06:32:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:57,492 INFO L225 Difference]: With dead ends: 207058 [2019-09-10 06:32:57,492 INFO L226 Difference]: Without dead ends: 207058 [2019-09-10 06:32:57,493 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:57,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207058 states. [2019-09-10 06:33:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207058 to 207056. [2019-09-10 06:33:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207056 states. [2019-09-10 06:33:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207056 states to 207056 states and 320157 transitions. [2019-09-10 06:33:02,216 INFO L78 Accepts]: Start accepts. Automaton has 207056 states and 320157 transitions. Word has length 490 [2019-09-10 06:33:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:02,216 INFO L475 AbstractCegarLoop]: Abstraction has 207056 states and 320157 transitions. [2019-09-10 06:33:02,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 207056 states and 320157 transitions. [2019-09-10 06:33:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-10 06:33:02,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:02,361 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,361 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:02,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:02,362 INFO L82 PathProgramCache]: Analyzing trace with hash 9730554, now seen corresponding path program 1 times [2019-09-10 06:33:02,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:02,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:02,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:02,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:02,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:03,545 INFO 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:03,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:03,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:03,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:03,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:03,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:03,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:03,550 INFO L87 Difference]: Start difference. First operand 207056 states and 320157 transitions. Second operand 3 states. [2019-09-10 06:33:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:04,562 INFO L93 Difference]: Finished difference Result 407830 states and 627704 transitions. [2019-09-10 06:33:04,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:04,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 490 [2019-09-10 06:33:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:05,235 INFO L225 Difference]: With dead ends: 407830 [2019-09-10 06:33:05,235 INFO L226 Difference]: Without dead ends: 407830 [2019-09-10 06:33:05,236 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:33:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407830 states. [2019-09-10 06:33:14,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407830 to 407828. [2019-09-10 06:33:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407828 states. [2019-09-10 06:33:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407828 states to 407828 states and 627703 transitions. [2019-09-10 06:33:14,863 INFO L78 Accepts]: Start accepts. Automaton has 407828 states and 627703 transitions. Word has length 490 [2019-09-10 06:33:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:14,863 INFO L475 AbstractCegarLoop]: Abstraction has 407828 states and 627703 transitions. [2019-09-10 06:33:14,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 407828 states and 627703 transitions. [2019-09-10 06:33:15,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-09-10 06:33:15,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:15,178 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,179 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:15,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:15,179 INFO L82 PathProgramCache]: Analyzing trace with hash 681267829, now seen corresponding path program 1 times [2019-09-10 06:33:15,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:15,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:15,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:15,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:15,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:15,653 INFO 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:15,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:15,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:15,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:15,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:15,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:15,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:15,656 INFO L87 Difference]: Start difference. First operand 407828 states and 627703 transitions. Second operand 3 states. [2019-09-10 06:33:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:23,459 INFO L93 Difference]: Finished difference Result 802571 states and 1229043 transitions. [2019-09-10 06:33:23,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:23,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 492 [2019-09-10 06:33:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:24,511 INFO L225 Difference]: With dead ends: 802571 [2019-09-10 06:33:24,512 INFO L226 Difference]: Without dead ends: 802571 [2019-09-10 06:33:24,512 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:33:25,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802571 states. [2019-09-10 06:33:39,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802571 to 802569. [2019-09-10 06:33:39,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802569 states. [2019-09-10 06:33:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802569 states to 802569 states and 1229042 transitions. [2019-09-10 06:33:53,160 INFO L78 Accepts]: Start accepts. Automaton has 802569 states and 1229042 transitions. Word has length 492 [2019-09-10 06:33:53,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:53,161 INFO L475 AbstractCegarLoop]: Abstraction has 802569 states and 1229042 transitions. [2019-09-10 06:33:53,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 802569 states and 1229042 transitions. [2019-09-10 06:33:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-09-10 06:33:53,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:53,766 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,766 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:53,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:53,767 INFO L82 PathProgramCache]: Analyzing trace with hash 240481234, now seen corresponding path program 1 times [2019-09-10 06:33:53,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:53,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:53,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:53,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:53,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:54,287 INFO 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:54,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:54,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:33:54,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:54,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:33:54,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:33:54,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:33:54,291 INFO L87 Difference]: Start difference. First operand 802569 states and 1229042 transitions. Second operand 4 states. [2019-09-10 06:34:09,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:09,907 INFO L93 Difference]: Finished difference Result 1505765 states and 2300664 transitions. [2019-09-10 06:34:09,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:34:09,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 492 [2019-09-10 06:34:09,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:11,608 INFO L225 Difference]: With dead ends: 1505765 [2019-09-10 06:34:11,609 INFO L226 Difference]: Without dead ends: 1505765 [2019-09-10 06:34:11,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:34:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505765 states. [2019-09-10 06:34:35,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505765 to 816933. [2019-09-10 06:34:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816933 states. [2019-09-10 06:34:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816933 states to 816933 states and 1254603 transitions. [2019-09-10 06:34:49,512 INFO L78 Accepts]: Start accepts. Automaton has 816933 states and 1254603 transitions. Word has length 492 [2019-09-10 06:34:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:49,513 INFO L475 AbstractCegarLoop]: Abstraction has 816933 states and 1254603 transitions. [2019-09-10 06:34:49,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:34:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 816933 states and 1254603 transitions. [2019-09-10 06:34:52,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-10 06:34:52,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:52,545 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,545 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:52,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:52,546 INFO L82 PathProgramCache]: Analyzing trace with hash -676001913, now seen corresponding path program 1 times [2019-09-10 06:34:52,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:52,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:52,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:52,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:52,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:34:53,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:53,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:34:53,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:53,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:34:53,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:34:53,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:34:53,112 INFO L87 Difference]: Start difference. First operand 816933 states and 1254603 transitions. Second operand 4 states. [2019-09-10 06:34:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:59,365 INFO L93 Difference]: Finished difference Result 1508391 states and 2305833 transitions. [2019-09-10 06:34:59,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:34:59,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 496 [2019-09-10 06:34:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:14,713 INFO L225 Difference]: With dead ends: 1508391 [2019-09-10 06:35:14,713 INFO L226 Difference]: Without dead ends: 1508391 [2019-09-10 06:35:14,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:35:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508391 states. [2019-09-10 06:35:42,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508391 to 863322. [2019-09-10 06:35:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863322 states. [2019-09-10 06:35:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863322 states to 863322 states and 1332705 transitions. [2019-09-10 06:35:45,793 INFO L78 Accepts]: Start accepts. Automaton has 863322 states and 1332705 transitions. Word has length 496 [2019-09-10 06:35:45,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:45,794 INFO L475 AbstractCegarLoop]: Abstraction has 863322 states and 1332705 transitions. [2019-09-10 06:35:45,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:35:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand 863322 states and 1332705 transitions. [2019-09-10 06:35:46,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-10 06:35:46,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:46,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,468 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:46,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:46,469 INFO L82 PathProgramCache]: Analyzing trace with hash 609221687, now seen corresponding path program 1 times [2019-09-10 06:35:46,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:46,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:46,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:46,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:46,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:35:46,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:46,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:35:46,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:46,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:35:46,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:35:46,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:35:46,712 INFO L87 Difference]: Start difference. First operand 863322 states and 1332705 transitions. Second operand 3 states. [2019-09-10 06:35:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:58,914 INFO L93 Difference]: Finished difference Result 1578170 states and 2426740 transitions. [2019-09-10 06:35:58,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:35:58,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-09-10 06:35:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:00,958 INFO L225 Difference]: With dead ends: 1578170 [2019-09-10 06:36:00,958 INFO L226 Difference]: Without dead ends: 1578170 [2019-09-10 06:36:00,958 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:36:02,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578170 states. [2019-09-10 06:36:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578170 to 876861. [2019-09-10 06:36:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876861 states. [2019-09-10 06:36:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876861 states to 876861 states and 1350296 transitions. [2019-09-10 06:36:44,308 INFO L78 Accepts]: Start accepts. Automaton has 876861 states and 1350296 transitions. Word has length 499 [2019-09-10 06:36:44,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:44,309 INFO L475 AbstractCegarLoop]: Abstraction has 876861 states and 1350296 transitions. [2019-09-10 06:36:44,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:44,309 INFO L276 IsEmpty]: Start isEmpty. Operand 876861 states and 1350296 transitions. [2019-09-10 06:36:45,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-10 06:36:45,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:45,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:45,096 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:45,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:45,096 INFO L82 PathProgramCache]: Analyzing trace with hash -778775567, now seen corresponding path program 1 times [2019-09-10 06:36:45,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:45,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:45,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:45,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:45,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:47,044 INFO 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:36:47,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:47,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:47,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:47,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:47,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:47,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:47,046 INFO L87 Difference]: Start difference. First operand 876861 states and 1350296 transitions. Second operand 3 states. [2019-09-10 06:36:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:53,782 INFO L93 Difference]: Finished difference Result 1574549 states and 2403615 transitions. [2019-09-10 06:36:53,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:53,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-09-10 06:36:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:55,462 INFO L225 Difference]: With dead ends: 1574549 [2019-09-10 06:36:55,463 INFO L226 Difference]: Without dead ends: 1574549 [2019-09-10 06:36:55,463 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:36:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574549 states.