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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:08:10,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:08:10,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:08:10,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:08:10,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:08:10,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:08:10,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:08:10,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:08:10,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:08:10,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:08:10,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:08:10,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:08:10,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:08:10,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:08:10,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:08:10,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:08:10,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:08:10,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:08:10,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:08:10,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:08:10,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:08:10,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:08:10,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:08:10,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:08:10,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:08:10,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:08:10,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:08:10,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:08:10,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:08:10,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:08:10,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:08:10,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:08:10,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:08:10,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:08:10,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:08:10,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:08:10,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:08:10,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:08:10,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:08:10,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:08:10,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:08:10,051 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:08:10,071 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:08:10,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:08:10,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:08:10,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:08:10,074 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:08:10,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:08:10,075 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:08:10,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:08:10,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:08:10,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:08:10,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:08:10,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:08:10,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:08:10,077 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:08:10,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:08:10,078 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:08:10,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:08:10,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:08:10,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:08:10,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:08:10,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:08:10,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:08:10,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:08:10,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:08:10,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:08:10,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:08:10,081 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:08:10,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:08:10,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:08:10,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:08:10,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:08:10,152 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:08:10,153 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:08:10,154 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:08:10,155 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+cfa-reducer.c [2019-09-08 10:08:10,230 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58c24b268/4bb801389e174f6f9cf37fad6f58fbed/FLAGc7b44f338 [2019-09-08 10:08:10,900 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:08:10,901 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 10:08:10,926 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58c24b268/4bb801389e174f6f9cf37fad6f58fbed/FLAGc7b44f338 [2019-09-08 10:08:11,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58c24b268/4bb801389e174f6f9cf37fad6f58fbed [2019-09-08 10:08:11,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:08:11,109 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:08:11,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:08:11,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:08:11,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:08:11,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:08:11" (1/1) ... [2019-09-08 10:08:11,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c848f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:08:11, skipping insertion in model container [2019-09-08 10:08:11,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:08:11" (1/1) ... [2019-09-08 10:08:11,123 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:08:11,213 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:08:11,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:08:11,899 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:08:12,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:08:12,357 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:08:12,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:08:12 WrapperNode [2019-09-08 10:08:12,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:08:12,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:08:12,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:08:12,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:08:12,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:08:12" (1/1) ... [2019-09-08 10:08:12,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:08:12" (1/1) ... [2019-09-08 10:08:12,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:08:12" (1/1) ... [2019-09-08 10:08:12,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:08:12" (1/1) ... [2019-09-08 10:08:12,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:08:12" (1/1) ... [2019-09-08 10:08:12,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:08:12" (1/1) ... [2019-09-08 10:08:12,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:08:12" (1/1) ... [2019-09-08 10:08:12,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:08:12,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:08:12,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:08:12,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:08:12,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:08:12" (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-08 10:08:12,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:08:12,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:08:12,656 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:08:12,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:08:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:08:12,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:08:12,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:08:12,658 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:08:12,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:08:12,658 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:08:12,659 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:08:12,659 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:08:12,660 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:08:12,660 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:08:12,661 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:08:12,661 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 10:08:12,663 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:08:12,663 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:08:12,663 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:08:12,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:08:12,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:08:15,130 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:08:15,130 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:08:15,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:08:15 BoogieIcfgContainer [2019-09-08 10:08:15,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:08:15,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:08:15,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:08:15,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:08:15,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:08:11" (1/3) ... [2019-09-08 10:08:15,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffb76e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:08:15, skipping insertion in model container [2019-09-08 10:08:15,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:08:12" (2/3) ... [2019-09-08 10:08:15,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffb76e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:08:15, skipping insertion in model container [2019-09-08 10:08:15,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:08:15" (3/3) ... [2019-09-08 10:08:15,140 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 10:08:15,150 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:08:15,162 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:08:15,179 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:08:15,218 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:08:15,219 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:08:15,219 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:08:15,219 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:08:15,219 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:08:15,219 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:08:15,220 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:08:15,220 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:08:15,220 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:08:15,254 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2019-09-08 10:08:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 10:08:15,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:15,283 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] [2019-09-08 10:08:15,285 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:15,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:15,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1282836936, now seen corresponding path program 1 times [2019-09-08 10:08:15,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:15,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:15,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:15,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:15,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:16,102 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-08 10:08:16,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:16,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:16,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:16,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:16,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:16,127 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 3 states. [2019-09-08 10:08:16,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:16,315 INFO L93 Difference]: Finished difference Result 1143 states and 2029 transitions. [2019-09-08 10:08:16,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:08:16,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-09-08 10:08:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:16,342 INFO L225 Difference]: With dead ends: 1143 [2019-09-08 10:08:16,342 INFO L226 Difference]: Without dead ends: 932 [2019-09-08 10:08:16,348 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-08 10:08:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2019-09-08 10:08:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 929. [2019-09-08 10:08:16,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-09-08 10:08:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1610 transitions. [2019-09-08 10:08:16,481 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1610 transitions. Word has length 207 [2019-09-08 10:08:16,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:16,482 INFO L475 AbstractCegarLoop]: Abstraction has 929 states and 1610 transitions. [2019-09-08 10:08:16,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:08:16,482 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1610 transitions. [2019-09-08 10:08:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 10:08:16,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:16,489 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] [2019-09-08 10:08:16,489 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:16,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:16,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1286222293, now seen corresponding path program 1 times [2019-09-08 10:08:16,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:16,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:16,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:16,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:16,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:16,896 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-08 10:08:16,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:16,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:16,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:16,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:16,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:16,902 INFO L87 Difference]: Start difference. First operand 929 states and 1610 transitions. Second operand 3 states. [2019-09-08 10:08:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:16,975 INFO L93 Difference]: Finished difference Result 1671 states and 2854 transitions. [2019-09-08 10:08:16,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:08:16,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-09-08 10:08:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:16,985 INFO L225 Difference]: With dead ends: 1671 [2019-09-08 10:08:16,986 INFO L226 Difference]: Without dead ends: 1289 [2019-09-08 10:08:16,990 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-08 10:08:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2019-09-08 10:08:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1285. [2019-09-08 10:08:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1285 states. [2019-09-08 10:08:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 2204 transitions. [2019-09-08 10:08:17,046 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 2204 transitions. Word has length 211 [2019-09-08 10:08:17,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:17,047 INFO L475 AbstractCegarLoop]: Abstraction has 1285 states and 2204 transitions. [2019-09-08 10:08:17,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:08:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 2204 transitions. [2019-09-08 10:08:17,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-08 10:08:17,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:17,053 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:08:17,053 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:17,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:17,053 INFO L82 PathProgramCache]: Analyzing trace with hash -868029736, now seen corresponding path program 1 times [2019-09-08 10:08:17,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:17,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:17,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:17,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:17,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:17,328 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-08 10:08:17,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:17,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:17,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:17,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:17,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:17,332 INFO L87 Difference]: Start difference. First operand 1285 states and 2204 transitions. Second operand 3 states. [2019-09-08 10:08:17,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:17,435 INFO L93 Difference]: Finished difference Result 2717 states and 4594 transitions. [2019-09-08 10:08:17,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:08:17,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-09-08 10:08:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:17,451 INFO L225 Difference]: With dead ends: 2717 [2019-09-08 10:08:17,460 INFO L226 Difference]: Without dead ends: 1979 [2019-09-08 10:08:17,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-08 10:08:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-09-08 10:08:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1973. [2019-09-08 10:08:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1973 states. [2019-09-08 10:08:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 3344 transitions. [2019-09-08 10:08:17,545 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 3344 transitions. Word has length 215 [2019-09-08 10:08:17,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:17,545 INFO L475 AbstractCegarLoop]: Abstraction has 1973 states and 3344 transitions. [2019-09-08 10:08:17,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:08:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 3344 transitions. [2019-09-08 10:08:17,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 10:08:17,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:17,552 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] [2019-09-08 10:08:17,552 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:17,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:17,553 INFO L82 PathProgramCache]: Analyzing trace with hash 737497141, now seen corresponding path program 1 times [2019-09-08 10:08:17,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:17,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:17,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:17,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:17,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:17,937 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-08 10:08:17,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:17,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:17,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:17,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:17,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:17,941 INFO L87 Difference]: Start difference. First operand 1973 states and 3344 transitions. Second operand 3 states. [2019-09-08 10:08:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:18,091 INFO L93 Difference]: Finished difference Result 4737 states and 7930 transitions. [2019-09-08 10:08:18,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:08:18,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-08 10:08:18,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:18,108 INFO L225 Difference]: With dead ends: 4737 [2019-09-08 10:08:18,108 INFO L226 Difference]: Without dead ends: 3311 [2019-09-08 10:08:18,113 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-08 10:08:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3311 states. [2019-09-08 10:08:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3311 to 3301. [2019-09-08 10:08:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3301 states. [2019-09-08 10:08:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 5528 transitions. [2019-09-08 10:08:18,280 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 5528 transitions. Word has length 219 [2019-09-08 10:08:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:18,281 INFO L475 AbstractCegarLoop]: Abstraction has 3301 states and 5528 transitions. [2019-09-08 10:08:18,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:08:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 5528 transitions. [2019-09-08 10:08:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-08 10:08:18,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:18,288 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:08:18,288 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:18,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:18,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1131624312, now seen corresponding path program 1 times [2019-09-08 10:08:18,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:18,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:18,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:18,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:18,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:18,554 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-08 10:08:18,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:18,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:18,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:18,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:18,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:18,557 INFO L87 Difference]: Start difference. First operand 3301 states and 5528 transitions. Second operand 3 states. [2019-09-08 10:08:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:18,790 INFO L93 Difference]: Finished difference Result 8633 states and 14314 transitions. [2019-09-08 10:08:18,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:08:18,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-09-08 10:08:18,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:18,820 INFO L225 Difference]: With dead ends: 8633 [2019-09-08 10:08:18,820 INFO L226 Difference]: Without dead ends: 5879 [2019-09-08 10:08:18,829 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-08 10:08:18,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5879 states. [2019-09-08 10:08:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5879 to 5861. [2019-09-08 10:08:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5861 states. [2019-09-08 10:08:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5861 states to 5861 states and 9704 transitions. [2019-09-08 10:08:19,159 INFO L78 Accepts]: Start accepts. Automaton has 5861 states and 9704 transitions. Word has length 223 [2019-09-08 10:08:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:19,160 INFO L475 AbstractCegarLoop]: Abstraction has 5861 states and 9704 transitions. [2019-09-08 10:08:19,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:08:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5861 states and 9704 transitions. [2019-09-08 10:08:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 10:08:19,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:19,167 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] [2019-09-08 10:08:19,167 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:19,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:19,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1933153941, now seen corresponding path program 1 times [2019-09-08 10:08:19,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:19,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:19,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:19,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:19,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:19,571 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-08 10:08:19,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:19,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:08:19,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:08:19,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:08:19,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:08:19,573 INFO L87 Difference]: Start difference. First operand 5861 states and 9704 transitions. Second operand 7 states. [2019-09-08 10:08:21,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:21,508 INFO L93 Difference]: Finished difference Result 35568 states and 58904 transitions. [2019-09-08 10:08:21,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:08:21,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 227 [2019-09-08 10:08:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:21,627 INFO L225 Difference]: With dead ends: 35568 [2019-09-08 10:08:21,627 INFO L226 Difference]: Without dead ends: 30254 [2019-09-08 10:08:21,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:08:21,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30254 states. [2019-09-08 10:08:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30254 to 11038. [2019-09-08 10:08:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11038 states. [2019-09-08 10:08:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11038 states to 11038 states and 18183 transitions. [2019-09-08 10:08:23,237 INFO L78 Accepts]: Start accepts. Automaton has 11038 states and 18183 transitions. Word has length 227 [2019-09-08 10:08:23,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:23,239 INFO L475 AbstractCegarLoop]: Abstraction has 11038 states and 18183 transitions. [2019-09-08 10:08:23,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:08:23,239 INFO L276 IsEmpty]: Start isEmpty. Operand 11038 states and 18183 transitions. [2019-09-08 10:08:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 10:08:23,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:23,250 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:23,251 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:23,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:23,256 INFO L82 PathProgramCache]: Analyzing trace with hash -272495972, now seen corresponding path program 1 times [2019-09-08 10:08:23,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:23,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:23,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:23,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:23,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:23,486 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-08 10:08:23,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:23,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:08:23,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:08:23,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:08:23,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:08:23,488 INFO L87 Difference]: Start difference. First operand 11038 states and 18183 transitions. Second operand 4 states. [2019-09-08 10:08:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:24,623 INFO L93 Difference]: Finished difference Result 29539 states and 48759 transitions. [2019-09-08 10:08:24,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:08:24,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-09-08 10:08:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:24,675 INFO L225 Difference]: With dead ends: 29539 [2019-09-08 10:08:24,675 INFO L226 Difference]: Without dead ends: 19048 [2019-09-08 10:08:24,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:08:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19048 states. [2019-09-08 10:08:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19048 to 16394. [2019-09-08 10:08:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16394 states. [2019-09-08 10:08:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16394 states to 16394 states and 27034 transitions. [2019-09-08 10:08:25,743 INFO L78 Accepts]: Start accepts. Automaton has 16394 states and 27034 transitions. Word has length 228 [2019-09-08 10:08:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:25,744 INFO L475 AbstractCegarLoop]: Abstraction has 16394 states and 27034 transitions. [2019-09-08 10:08:25,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:08:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 16394 states and 27034 transitions. [2019-09-08 10:08:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 10:08:25,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:25,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:25,757 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:25,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:25,757 INFO L82 PathProgramCache]: Analyzing trace with hash 76391484, now seen corresponding path program 1 times [2019-09-08 10:08:25,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:25,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:25,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:25,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:25,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:25,964 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-08 10:08:25,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:25,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:08:25,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:08:25,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:08:25,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:08:25,967 INFO L87 Difference]: Start difference. First operand 16394 states and 27034 transitions. Second operand 4 states. [2019-09-08 10:08:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:27,731 INFO L93 Difference]: Finished difference Result 44159 states and 72883 transitions. [2019-09-08 10:08:27,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:08:27,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-09-08 10:08:27,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:27,825 INFO L225 Difference]: With dead ends: 44159 [2019-09-08 10:08:27,826 INFO L226 Difference]: Without dead ends: 28312 [2019-09-08 10:08:27,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:08:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28312 states. [2019-09-08 10:08:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28312 to 24393. [2019-09-08 10:08:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24393 states. [2019-09-08 10:08:29,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24393 states to 24393 states and 40188 transitions. [2019-09-08 10:08:29,124 INFO L78 Accepts]: Start accepts. Automaton has 24393 states and 40188 transitions. Word has length 229 [2019-09-08 10:08:29,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:29,124 INFO L475 AbstractCegarLoop]: Abstraction has 24393 states and 40188 transitions. [2019-09-08 10:08:29,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:08:29,125 INFO L276 IsEmpty]: Start isEmpty. Operand 24393 states and 40188 transitions. [2019-09-08 10:08:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 10:08:29,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:29,140 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:29,140 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:29,141 INFO L82 PathProgramCache]: Analyzing trace with hash -206478650, now seen corresponding path program 1 times [2019-09-08 10:08:29,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:29,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:29,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:29,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:29,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:29,302 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-08 10:08:29,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:29,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:29,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:29,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:29,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:29,304 INFO L87 Difference]: Start difference. First operand 24393 states and 40188 transitions. Second operand 3 states. [2019-09-08 10:08:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:31,123 INFO L93 Difference]: Finished difference Result 53981 states and 89267 transitions. [2019-09-08 10:08:31,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:08:31,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-09-08 10:08:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:31,212 INFO L225 Difference]: With dead ends: 53981 [2019-09-08 10:08:31,212 INFO L226 Difference]: Without dead ends: 37565 [2019-09-08 10:08:31,251 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-08 10:08:31,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37565 states. [2019-09-08 10:08:33,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37565 to 37563. [2019-09-08 10:08:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37563 states. [2019-09-08 10:08:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37563 states to 37563 states and 61905 transitions. [2019-09-08 10:08:33,868 INFO L78 Accepts]: Start accepts. Automaton has 37563 states and 61905 transitions. Word has length 230 [2019-09-08 10:08:33,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:33,869 INFO L475 AbstractCegarLoop]: Abstraction has 37563 states and 61905 transitions. [2019-09-08 10:08:33,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:08:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 37563 states and 61905 transitions. [2019-09-08 10:08:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 10:08:33,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:33,877 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:33,877 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:33,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:33,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1531075737, now seen corresponding path program 1 times [2019-09-08 10:08:33,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:33,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:33,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:33,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:33,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:34,053 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-08 10:08:34,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:34,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:34,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:34,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:34,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:34,055 INFO L87 Difference]: Start difference. First operand 37563 states and 61905 transitions. Second operand 3 states. [2019-09-08 10:08:36,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:36,303 INFO L93 Difference]: Finished difference Result 82993 states and 136961 transitions. [2019-09-08 10:08:36,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:08:36,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-09-08 10:08:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:36,440 INFO L225 Difference]: With dead ends: 82993 [2019-09-08 10:08:36,440 INFO L226 Difference]: Without dead ends: 57580 [2019-09-08 10:08:36,487 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-08 10:08:36,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57580 states. [2019-09-08 10:08:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57580 to 57578. [2019-09-08 10:08:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57578 states. [2019-09-08 10:08:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57578 states to 57578 states and 94737 transitions. [2019-09-08 10:08:39,963 INFO L78 Accepts]: Start accepts. Automaton has 57578 states and 94737 transitions. Word has length 230 [2019-09-08 10:08:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:39,963 INFO L475 AbstractCegarLoop]: Abstraction has 57578 states and 94737 transitions. [2019-09-08 10:08:39,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:08:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 57578 states and 94737 transitions. [2019-09-08 10:08:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 10:08:39,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:39,968 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:39,968 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:39,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:39,969 INFO L82 PathProgramCache]: Analyzing trace with hash -727220740, now seen corresponding path program 1 times [2019-09-08 10:08:39,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:39,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:39,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:39,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:39,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:40,151 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-08 10:08:40,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:40,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:40,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:40,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:40,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:40,153 INFO L87 Difference]: Start difference. First operand 57578 states and 94737 transitions. Second operand 3 states. [2019-09-08 10:08:44,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:44,658 INFO L93 Difference]: Finished difference Result 111166 states and 183336 transitions. [2019-09-08 10:08:44,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:08:44,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-09-08 10:08:44,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:44,773 INFO L225 Difference]: With dead ends: 111166 [2019-09-08 10:08:44,773 INFO L226 Difference]: Without dead ends: 80883 [2019-09-08 10:08:44,819 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-08 10:08:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80883 states. [2019-09-08 10:08:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80883 to 80881. [2019-09-08 10:08:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80881 states. [2019-09-08 10:08:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80881 states to 80881 states and 132952 transitions. [2019-09-08 10:08:48,245 INFO L78 Accepts]: Start accepts. Automaton has 80881 states and 132952 transitions. Word has length 230 [2019-09-08 10:08:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:48,245 INFO L475 AbstractCegarLoop]: Abstraction has 80881 states and 132952 transitions. [2019-09-08 10:08:48,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:08:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 80881 states and 132952 transitions. [2019-09-08 10:08:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 10:08:48,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:48,247 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:48,247 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:48,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:48,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1521949134, now seen corresponding path program 1 times [2019-09-08 10:08:48,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:48,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:48,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:48,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:48,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:48,468 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-08 10:08:48,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:48,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:48,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:48,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:48,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:48,470 INFO L87 Difference]: Start difference. First operand 80881 states and 132952 transitions. Second operand 3 states. [2019-09-08 10:08:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:54,836 INFO L93 Difference]: Finished difference Result 155490 states and 256297 transitions. [2019-09-08 10:08:54,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:08:54,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-09-08 10:08:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:54,999 INFO L225 Difference]: With dead ends: 155490 [2019-09-08 10:08:54,999 INFO L226 Difference]: Without dead ends: 112965 [2019-09-08 10:08:55,052 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-08 10:08:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112965 states. [2019-09-08 10:08:59,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112965 to 112963. [2019-09-08 10:08:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112963 states. [2019-09-08 10:08:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112963 states to 112963 states and 185519 transitions. [2019-09-08 10:08:59,550 INFO L78 Accepts]: Start accepts. Automaton has 112963 states and 185519 transitions. Word has length 230 [2019-09-08 10:08:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:59,550 INFO L475 AbstractCegarLoop]: Abstraction has 112963 states and 185519 transitions. [2019-09-08 10:08:59,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:08:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 112963 states and 185519 transitions. [2019-09-08 10:08:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 10:08:59,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:59,552 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:59,552 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:59,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:59,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1988441245, now seen corresponding path program 1 times [2019-09-08 10:08:59,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:59,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:59,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:59,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:59,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:59,733 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-08 10:08:59,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:59,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:08:59,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:08:59,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:08:59,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:08:59,735 INFO L87 Difference]: Start difference. First operand 112963 states and 185519 transitions. Second operand 4 states. [2019-09-08 10:09:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:09:10,946 INFO L93 Difference]: Finished difference Result 332662 states and 547493 transitions. [2019-09-08 10:09:10,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:09:10,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-09-08 10:09:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:09:11,304 INFO L225 Difference]: With dead ends: 332662 [2019-09-08 10:09:11,304 INFO L226 Difference]: Without dead ends: 220355 [2019-09-08 10:09:11,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:09:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220355 states. [2019-09-08 10:09:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220355 to 185001. [2019-09-08 10:09:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185001 states. [2019-09-08 10:09:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185001 states to 185001 states and 303458 transitions. [2019-09-08 10:09:24,520 INFO L78 Accepts]: Start accepts. Automaton has 185001 states and 303458 transitions. Word has length 230 [2019-09-08 10:09:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:09:24,521 INFO L475 AbstractCegarLoop]: Abstraction has 185001 states and 303458 transitions. [2019-09-08 10:09:24,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:09:24,521 INFO L276 IsEmpty]: Start isEmpty. Operand 185001 states and 303458 transitions. [2019-09-08 10:09:24,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 10:09:24,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:09:24,523 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:09:24,523 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:09:24,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:09:24,523 INFO L82 PathProgramCache]: Analyzing trace with hash 382821809, now seen corresponding path program 1 times [2019-09-08 10:09:24,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:09:24,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:09:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:09:24,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:09:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:09:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:09:24,691 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-08 10:09:24,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:09:24,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:09:24,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:09:24,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:09:24,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:09:24,693 INFO L87 Difference]: Start difference. First operand 185001 states and 303458 transitions. Second operand 3 states. [2019-09-08 10:09:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:09:38,467 INFO L93 Difference]: Finished difference Result 355455 states and 584860 transitions. [2019-09-08 10:09:38,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:09:38,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-09-08 10:09:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:09:38,923 INFO L225 Difference]: With dead ends: 355455 [2019-09-08 10:09:38,923 INFO L226 Difference]: Without dead ends: 257087 [2019-09-08 10:09:39,033 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-08 10:09:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257087 states. [2019-09-08 10:09:56,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257087 to 257085. [2019-09-08 10:09:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257085 states. [2019-09-08 10:09:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257085 states to 257085 states and 421256 transitions. [2019-09-08 10:09:57,407 INFO L78 Accepts]: Start accepts. Automaton has 257085 states and 421256 transitions. Word has length 230 [2019-09-08 10:09:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:09:57,407 INFO L475 AbstractCegarLoop]: Abstraction has 257085 states and 421256 transitions. [2019-09-08 10:09:57,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:09:57,408 INFO L276 IsEmpty]: Start isEmpty. Operand 257085 states and 421256 transitions. [2019-09-08 10:09:57,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 10:09:57,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:09:57,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:09:57,410 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:09:57,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:09:57,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1569188381, now seen corresponding path program 1 times [2019-09-08 10:09:57,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:09:57,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:09:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:09:57,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:09:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:09:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:09:57,741 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-08 10:09:57,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:09:57,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:09:57,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:09:57,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:09:57,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:09:57,743 INFO L87 Difference]: Start difference. First operand 257085 states and 421256 transitions. Second operand 4 states. [2019-09-08 10:10:27,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:10:27,203 INFO L93 Difference]: Finished difference Result 762792 states and 1252724 transitions. [2019-09-08 10:10:27,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:10:27,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-09-08 10:10:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:10:28,131 INFO L225 Difference]: With dead ends: 762792 [2019-09-08 10:10:28,131 INFO L226 Difference]: Without dead ends: 506347 [2019-09-08 10:10:28,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:10:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506347 states. [2019-09-08 10:11:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506347 to 420395. [2019-09-08 10:11:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420395 states. [2019-09-08 10:11:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420395 states to 420395 states and 687959 transitions. [2019-09-08 10:11:05,738 INFO L78 Accepts]: Start accepts. Automaton has 420395 states and 687959 transitions. Word has length 231 [2019-09-08 10:11:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:05,738 INFO L475 AbstractCegarLoop]: Abstraction has 420395 states and 687959 transitions. [2019-09-08 10:11:05,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:11:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 420395 states and 687959 transitions. [2019-09-08 10:11:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 10:11:05,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:05,740 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:11:05,740 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:05,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1452693462, now seen corresponding path program 1 times [2019-09-08 10:11:05,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:05,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:05,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:05,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:05,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:06,042 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-08 10:11:06,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:06,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:11:06,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:11:06,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:11:06,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:11:06,044 INFO L87 Difference]: Start difference. First operand 420395 states and 687959 transitions. Second operand 8 states. [2019-09-08 10:13:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:45,351 INFO L93 Difference]: Finished difference Result 2321401 states and 3813911 transitions. [2019-09-08 10:13:45,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 10:13:45,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 232 [2019-09-08 10:13:45,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:49,122 INFO L225 Difference]: With dead ends: 2321401 [2019-09-08 10:13:49,123 INFO L226 Difference]: Without dead ends: 1901646 [2019-09-08 10:13:49,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-08 10:13:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901646 states. [2019-09-08 10:16:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901646 to 1152273. [2019-09-08 10:16:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152273 states. [2019-09-08 10:16:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152273 states to 1152273 states and 1878846 transitions. [2019-09-08 10:16:06,745 INFO L78 Accepts]: Start accepts. Automaton has 1152273 states and 1878846 transitions. Word has length 232 [2019-09-08 10:16:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:06,745 INFO L475 AbstractCegarLoop]: Abstraction has 1152273 states and 1878846 transitions. [2019-09-08 10:16:06,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:16:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1152273 states and 1878846 transitions. [2019-09-08 10:16:06,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-08 10:16:06,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:06,747 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] [2019-09-08 10:16:06,748 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:06,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:06,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1663665062, now seen corresponding path program 1 times [2019-09-08 10:16:06,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:06,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:06,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:06,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:06,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:07,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-08 10:16:07,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:07,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:16:07,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:16:07,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:16:07,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:16:07,289 INFO L87 Difference]: Start difference. First operand 1152273 states and 1878846 transitions. Second operand 7 states.