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/pals_opt-floodmax.5.4.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 05:04:46,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 05:04:46,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 05:04:46,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 05:04:46,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 05:04:46,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 05:04:46,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 05:04:46,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 05:04:46,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 05:04:46,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 05:04:46,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 05:04:46,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 05:04:46,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 05:04:46,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 05:04:46,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 05:04:46,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 05:04:46,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 05:04:46,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 05:04:46,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 05:04:46,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 05:04:46,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 05:04:46,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 05:04:46,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 05:04:46,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 05:04:46,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 05:04:46,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 05:04:46,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 05:04:46,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 05:04:46,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 05:04:46,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 05:04:46,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 05:04:46,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 05:04:46,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 05:04:46,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 05:04:46,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 05:04:46,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 05:04:46,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 05:04:46,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 05:04:46,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 05:04:46,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 05:04:46,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 05:04:46,639 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 05:04:46,654 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 05:04:46,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 05:04:46,655 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 05:04:46,655 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 05:04:46,656 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 05:04:46,656 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 05:04:46,656 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 05:04:46,656 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 05:04:46,657 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 05:04:46,657 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 05:04:46,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 05:04:46,658 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 05:04:46,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 05:04:46,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 05:04:46,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 05:04:46,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 05:04:46,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 05:04:46,659 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 05:04:46,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 05:04:46,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 05:04:46,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 05:04:46,660 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 05:04:46,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 05:04:46,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 05:04:46,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 05:04:46,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 05:04:46,661 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 05:04:46,661 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 05:04:46,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 05:04:46,661 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 05:04:46,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 05:04:46,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 05:04:46,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 05:04:46,708 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 05:04:46,708 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 05:04:46,709 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.4.ufo.UNBOUNDED.pals.c [2019-09-10 05:04:46,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511d26b0a/9b4e087d144a4c13ba796ddc27e3db07/FLAG45dc3b71c [2019-09-10 05:04:47,375 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 05:04:47,377 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.4.ufo.UNBOUNDED.pals.c [2019-09-10 05:04:47,406 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511d26b0a/9b4e087d144a4c13ba796ddc27e3db07/FLAG45dc3b71c [2019-09-10 05:04:47,628 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511d26b0a/9b4e087d144a4c13ba796ddc27e3db07 [2019-09-10 05:04:47,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 05:04:47,639 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 05:04:47,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 05:04:47,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 05:04:47,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 05:04:47,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 05:04:47" (1/1) ... [2019-09-10 05:04:47,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f483d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:47, skipping insertion in model container [2019-09-10 05:04:47,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 05:04:47" (1/1) ... [2019-09-10 05:04:47,655 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 05:04:47,735 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 05:04:48,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 05:04:48,418 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 05:04:48,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 05:04:48,600 INFO L192 MainTranslator]: Completed translation [2019-09-10 05:04:48,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:48 WrapperNode [2019-09-10 05:04:48,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 05:04:48,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 05:04:48,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 05:04:48,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 05:04:48,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:48" (1/1) ... [2019-09-10 05:04:48,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:48" (1/1) ... [2019-09-10 05:04:48,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:48" (1/1) ... [2019-09-10 05:04:48,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:48" (1/1) ... [2019-09-10 05:04:48,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:48" (1/1) ... [2019-09-10 05:04:48,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:48" (1/1) ... [2019-09-10 05:04:48,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:48" (1/1) ... [2019-09-10 05:04:48,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 05:04:48,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 05:04:48,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 05:04:48,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 05:04:48,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:48" (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 05:04:48,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 05:04:48,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 05:04:48,867 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 05:04:48,867 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 05:04:48,867 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 05:04:48,868 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 05:04:48,868 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 05:04:48,868 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 05:04:48,868 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 05:04:48,868 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 05:04:48,869 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 05:04:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 05:04:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 05:04:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 05:04:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 05:04:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 05:04:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 05:04:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 05:04:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 05:04:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 05:04:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 05:04:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 05:04:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 05:04:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 05:04:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 05:04:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 05:04:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 05:04:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 05:04:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 05:04:51,269 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 05:04:51,272 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 05:04:51,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 05:04:51 BoogieIcfgContainer [2019-09-10 05:04:51,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 05:04:51,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 05:04:51,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 05:04:51,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 05:04:51,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 05:04:47" (1/3) ... [2019-09-10 05:04:51,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df9e292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 05:04:51, skipping insertion in model container [2019-09-10 05:04:51,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:48" (2/3) ... [2019-09-10 05:04:51,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df9e292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 05:04:51, skipping insertion in model container [2019-09-10 05:04:51,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 05:04:51" (3/3) ... [2019-09-10 05:04:51,281 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.4.ufo.UNBOUNDED.pals.c [2019-09-10 05:04:51,291 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 05:04:51,300 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 05:04:51,314 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 05:04:51,335 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 05:04:51,335 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 05:04:51,336 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 05:04:51,336 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 05:04:51,336 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 05:04:51,336 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 05:04:51,336 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 05:04:51,336 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 05:04:51,369 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states. [2019-09-10 05:04:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 05:04:51,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:04:51,402 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] [2019-09-10 05:04:51,405 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:04:51,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:04:51,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1090629948, now seen corresponding path program 1 times [2019-09-10 05:04:51,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:04:51,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:51,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:04:51,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:51,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:04:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:04:52,153 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 05:04:52,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:04:52,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:04:52,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:04:52,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:04:52,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:04:52,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:04:52,180 INFO L87 Difference]: Start difference. First operand 776 states. Second operand 5 states. [2019-09-10 05:04:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:04:52,431 INFO L93 Difference]: Finished difference Result 775 states and 1398 transitions. [2019-09-10 05:04:52,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 05:04:52,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-09-10 05:04:52,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:04:52,464 INFO L225 Difference]: With dead ends: 775 [2019-09-10 05:04:52,465 INFO L226 Difference]: Without dead ends: 771 [2019-09-10 05:04:52,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:04:52,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-09-10 05:04:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771. [2019-09-10 05:04:52,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-09-10 05:04:52,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1330 transitions. [2019-09-10 05:04:52,575 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1330 transitions. Word has length 181 [2019-09-10 05:04:52,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:04:52,576 INFO L475 AbstractCegarLoop]: Abstraction has 771 states and 1330 transitions. [2019-09-10 05:04:52,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:04:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1330 transitions. [2019-09-10 05:04:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 05:04:52,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:04:52,591 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] [2019-09-10 05:04:52,591 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:04:52,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:04:52,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1965304482, now seen corresponding path program 1 times [2019-09-10 05:04:52,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:04:52,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:52,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:04:52,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:52,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:04:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:04:53,275 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 05:04:53,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:04:53,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 05:04:53,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:04:53,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 05:04:53,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 05:04:53,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-10 05:04:53,279 INFO L87 Difference]: Start difference. First operand 771 states and 1330 transitions. Second operand 13 states. [2019-09-10 05:05:09,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:05:09,124 INFO L93 Difference]: Finished difference Result 3368 states and 5629 transitions. [2019-09-10 05:05:09,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 05:05:09,125 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 245 [2019-09-10 05:05:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:05:09,148 INFO L225 Difference]: With dead ends: 3368 [2019-09-10 05:05:09,149 INFO L226 Difference]: Without dead ends: 3368 [2019-09-10 05:05:09,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 05:05:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2019-09-10 05:05:09,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 1845. [2019-09-10 05:05:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-10 05:05:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 3108 transitions. [2019-09-10 05:05:09,244 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 3108 transitions. Word has length 245 [2019-09-10 05:05:09,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:05:09,245 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 3108 transitions. [2019-09-10 05:05:09,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 05:05:09,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 3108 transitions. [2019-09-10 05:05:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 05:05:09,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:05:09,253 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] [2019-09-10 05:05:09,253 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:05:09,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:05:09,254 INFO L82 PathProgramCache]: Analyzing trace with hash -274859823, now seen corresponding path program 1 times [2019-09-10 05:05:09,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:05:09,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:09,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:05:09,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:09,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:05:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:05:09,605 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 05:05:09,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:05:09,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:05:09,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:05:09,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:05:09,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:05:09,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:05:09,607 INFO L87 Difference]: Start difference. First operand 1845 states and 3108 transitions. Second operand 6 states. [2019-09-10 05:05:14,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:05:14,108 INFO L93 Difference]: Finished difference Result 3155 states and 5262 transitions. [2019-09-10 05:05:14,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 05:05:14,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 246 [2019-09-10 05:05:14,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:05:14,140 INFO L225 Difference]: With dead ends: 3155 [2019-09-10 05:05:14,140 INFO L226 Difference]: Without dead ends: 3155 [2019-09-10 05:05:14,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 05:05:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2019-09-10 05:05:14,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 2934. [2019-09-10 05:05:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2934 states. [2019-09-10 05:05:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 4901 transitions. [2019-09-10 05:05:14,257 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 4901 transitions. Word has length 246 [2019-09-10 05:05:14,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:05:14,258 INFO L475 AbstractCegarLoop]: Abstraction has 2934 states and 4901 transitions. [2019-09-10 05:05:14,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:05:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 4901 transitions. [2019-09-10 05:05:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 05:05:14,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:05:14,267 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] [2019-09-10 05:05:14,267 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:05:14,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:05:14,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1052161479, now seen corresponding path program 1 times [2019-09-10 05:05:14,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:05:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:14,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:05:14,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:14,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:05:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:05:14,551 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 05:05:14,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:05:14,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:05:14,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:05:14,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:05:14,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:05:14,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:05:14,553 INFO L87 Difference]: Start difference. First operand 2934 states and 4901 transitions. Second operand 6 states. [2019-09-10 05:05:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:05:17,888 INFO L93 Difference]: Finished difference Result 4695 states and 7775 transitions. [2019-09-10 05:05:17,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 05:05:17,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 247 [2019-09-10 05:05:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:05:17,914 INFO L225 Difference]: With dead ends: 4695 [2019-09-10 05:05:17,914 INFO L226 Difference]: Without dead ends: 4695 [2019-09-10 05:05:17,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-10 05:05:17,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4695 states. [2019-09-10 05:05:18,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 4672. [2019-09-10 05:05:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4672 states. [2019-09-10 05:05:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4672 states to 4672 states and 7747 transitions. [2019-09-10 05:05:18,053 INFO L78 Accepts]: Start accepts. Automaton has 4672 states and 7747 transitions. Word has length 247 [2019-09-10 05:05:18,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:05:18,054 INFO L475 AbstractCegarLoop]: Abstraction has 4672 states and 7747 transitions. [2019-09-10 05:05:18,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:05:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 4672 states and 7747 transitions. [2019-09-10 05:05:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 05:05:18,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:05:18,062 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] [2019-09-10 05:05:18,063 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:05:18,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:05:18,063 INFO L82 PathProgramCache]: Analyzing trace with hash 569606024, now seen corresponding path program 1 times [2019-09-10 05:05:18,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:05:18,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:18,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:05:18,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:18,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:05:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:05:18,390 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 05:05:18,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:05:18,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:05:18,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:05:18,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:05:18,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:05:18,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:05:18,393 INFO L87 Difference]: Start difference. First operand 4672 states and 7747 transitions. Second operand 6 states. [2019-09-10 05:05:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:05:23,934 INFO L93 Difference]: Finished difference Result 20901 states and 34362 transitions. [2019-09-10 05:05:23,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:05:23,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-09-10 05:05:23,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:05:24,023 INFO L225 Difference]: With dead ends: 20901 [2019-09-10 05:05:24,024 INFO L226 Difference]: Without dead ends: 20901 [2019-09-10 05:05:24,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:05:24,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20901 states. [2019-09-10 05:05:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20901 to 20855. [2019-09-10 05:05:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20855 states. [2019-09-10 05:05:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20855 states to 20855 states and 34282 transitions. [2019-09-10 05:05:24,677 INFO L78 Accepts]: Start accepts. Automaton has 20855 states and 34282 transitions. Word has length 248 [2019-09-10 05:05:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:05:24,678 INFO L475 AbstractCegarLoop]: Abstraction has 20855 states and 34282 transitions. [2019-09-10 05:05:24,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:05:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 20855 states and 34282 transitions. [2019-09-10 05:05:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 05:05:24,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:05:24,692 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] [2019-09-10 05:05:24,692 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:05:24,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:05:24,693 INFO L82 PathProgramCache]: Analyzing trace with hash -746893872, now seen corresponding path program 1 times [2019-09-10 05:05:24,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:05:24,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:24,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:05:24,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:24,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:05:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:05:25,058 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 05:05:25,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:05:25,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:05:25,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:05:25,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:05:25,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:05:25,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:05:25,060 INFO L87 Difference]: Start difference. First operand 20855 states and 34282 transitions. Second operand 6 states. [2019-09-10 05:05:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:05:30,494 INFO L93 Difference]: Finished difference Result 101582 states and 166587 transitions. [2019-09-10 05:05:30,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:05:30,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-10 05:05:30,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:05:30,903 INFO L225 Difference]: With dead ends: 101582 [2019-09-10 05:05:30,903 INFO L226 Difference]: Without dead ends: 101582 [2019-09-10 05:05:30,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:05:31,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101582 states. [2019-09-10 05:05:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101582 to 101384. [2019-09-10 05:05:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101384 states. [2019-09-10 05:05:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101384 states to 101384 states and 166203 transitions. [2019-09-10 05:05:36,327 INFO L78 Accepts]: Start accepts. Automaton has 101384 states and 166203 transitions. Word has length 249 [2019-09-10 05:05:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:05:36,329 INFO L475 AbstractCegarLoop]: Abstraction has 101384 states and 166203 transitions. [2019-09-10 05:05:36,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:05:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 101384 states and 166203 transitions. [2019-09-10 05:05:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-10 05:05:36,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:05:36,345 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] [2019-09-10 05:05:36,346 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:05:36,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:05:36,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1339597375, now seen corresponding path program 1 times [2019-09-10 05:05:36,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:05:36,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:36,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:05:36,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:36,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:05:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:05:36,593 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 05:05:36,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:05:36,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:05:36,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:05:36,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:05:36,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:05:36,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:05:36,595 INFO L87 Difference]: Start difference. First operand 101384 states and 166203 transitions. Second operand 6 states. [2019-09-10 05:05:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:05:46,024 INFO L93 Difference]: Finished difference Result 447821 states and 733079 transitions. [2019-09-10 05:05:46,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:05:46,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 250 [2019-09-10 05:05:46,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:05:47,459 INFO L225 Difference]: With dead ends: 447821 [2019-09-10 05:05:47,459 INFO L226 Difference]: Without dead ends: 447821 [2019-09-10 05:05:47,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:05:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447821 states. [2019-09-10 05:05:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447821 to 446872. [2019-09-10 05:05:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446872 states. [2019-09-10 05:06:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446872 states to 446872 states and 731274 transitions. [2019-09-10 05:06:01,016 INFO L78 Accepts]: Start accepts. Automaton has 446872 states and 731274 transitions. Word has length 250 [2019-09-10 05:06:01,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:06:01,017 INFO L475 AbstractCegarLoop]: Abstraction has 446872 states and 731274 transitions. [2019-09-10 05:06:01,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:06:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 446872 states and 731274 transitions. [2019-09-10 05:06:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-10 05:06:01,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:06:01,029 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:06:01,029 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:06:01,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:06:01,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2033618999, now seen corresponding path program 1 times [2019-09-10 05:06:01,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:06:01,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:06:01,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:06:01,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:06:01,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:06:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:06:01,408 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 05:06:01,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:06:01,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:06:01,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:06:01,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:06:01,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:06:01,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:06:01,411 INFO L87 Difference]: Start difference. First operand 446872 states and 731274 transitions. Second operand 6 states. [2019-09-10 05:06:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:06:21,234 INFO L93 Difference]: Finished difference Result 1022099 states and 1657423 transitions. [2019-09-10 05:06:21,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 05:06:21,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 252 [2019-09-10 05:06:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:06:24,406 INFO L225 Difference]: With dead ends: 1022099 [2019-09-10 05:06:24,406 INFO L226 Difference]: Without dead ends: 1022099 [2019-09-10 05:06:24,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 05:06:25,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022099 states. [2019-09-10 05:06:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022099 to 1017066. [2019-09-10 05:06:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017066 states. [2019-09-10 05:07:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017066 states to 1017066 states and 1652392 transitions. [2019-09-10 05:07:01,310 INFO L78 Accepts]: Start accepts. Automaton has 1017066 states and 1652392 transitions. Word has length 252 [2019-09-10 05:07:01,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:07:01,310 INFO L475 AbstractCegarLoop]: Abstraction has 1017066 states and 1652392 transitions. [2019-09-10 05:07:01,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:07:01,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1017066 states and 1652392 transitions. [2019-09-10 05:07:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 05:07:01,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:07:01,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:07:01,319 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:07:01,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:07:01,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1046742769, now seen corresponding path program 1 times [2019-09-10 05:07:01,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:07:01,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:07:01,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:07:01,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:07:01,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:07:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:07:14,345 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 05:07:14,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:07:14,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:07:14,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:07:14,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:07:14,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:07:14,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:07:14,347 INFO L87 Difference]: Start difference. First operand 1017066 states and 1652392 transitions. Second operand 5 states. [2019-09-10 05:07:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:07:35,309 INFO L93 Difference]: Finished difference Result 2020129 states and 3263642 transitions. [2019-09-10 05:07:35,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 05:07:35,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 256 [2019-09-10 05:07:35,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:07:53,834 INFO L225 Difference]: With dead ends: 2020129 [2019-09-10 05:07:53,834 INFO L226 Difference]: Without dead ends: 2020129 [2019-09-10 05:07:53,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:07:55,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020129 states.