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.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:55:57,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:55:57,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:55:57,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:55:57,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:55:57,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:55:57,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:55:57,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:55:57,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:55:57,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:55:57,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:55:57,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:55:57,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:55:57,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:55:57,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:55:57,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:55:57,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:55:57,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:55:57,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:55:57,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:55:58,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:55:58,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:55:58,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:55:58,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:55:58,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:55:58,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:55:58,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:55:58,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:55:58,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:55:58,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:55:58,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:55:58,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:55:58,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:55:58,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:55:58,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:55:58,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:55:58,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:55:58,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:55:58,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:55:58,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:55:58,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:55:58,015 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 09:55:58,030 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:55:58,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:55:58,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:55:58,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:55:58,032 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:55:58,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:55:58,033 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:55:58,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:55:58,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:55:58,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:55:58,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:55:58,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:55:58,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:55:58,034 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:55:58,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:55:58,034 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:55:58,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:55:58,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:55:58,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:55:58,035 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:55:58,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:55:58,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:55:58,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:55:58,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:55:58,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:55:58,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:55:58,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:55:58,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:55:58,037 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:55:58,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:55:58,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:55:58,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:55:58,088 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:55:58,089 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:55:58,089 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 09:55:58,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b70487b1f/6620bbe62dde402ea8ef333409f45774/FLAG31660b008 [2019-09-08 09:55:58,824 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:55:58,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 09:55:58,844 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b70487b1f/6620bbe62dde402ea8ef333409f45774/FLAG31660b008 [2019-09-08 09:55:59,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b70487b1f/6620bbe62dde402ea8ef333409f45774 [2019-09-08 09:55:59,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:55:59,094 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:55:59,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:55:59,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:55:59,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:55:59,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:55:59" (1/1) ... [2019-09-08 09:55:59,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b08670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:55:59, skipping insertion in model container [2019-09-08 09:55:59,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:55:59" (1/1) ... [2019-09-08 09:55:59,114 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:55:59,227 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:56:00,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:56:00,135 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:56:00,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:56:00,727 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:56:00,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:56:00 WrapperNode [2019-09-08 09:56:00,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:56:00,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:56:00,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:56:00,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:56:00,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:56:00" (1/1) ... [2019-09-08 09:56:00,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:56:00" (1/1) ... [2019-09-08 09:56:00,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:56:00" (1/1) ... [2019-09-08 09:56:00,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:56:00" (1/1) ... [2019-09-08 09:56:00,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:56:00" (1/1) ... [2019-09-08 09:56:00,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:56:00" (1/1) ... [2019-09-08 09:56:00,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:56:00" (1/1) ... [2019-09-08 09:56:00,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:56:00,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:56:00,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:56:00,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:56:00,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:56:00" (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 09:56:01,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:56:01,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:56:01,021 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:56:01,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:56:01,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:56:01,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:56:01,023 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:56:01,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:56:01,023 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:56:01,023 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:56:01,024 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:56:01,024 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:56:01,025 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:56:01,025 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:56:01,026 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:56:01,026 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:56:01,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:56:01,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:56:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:56:03,700 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:56:03,700 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:56:03,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:56:03 BoogieIcfgContainer [2019-09-08 09:56:03,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:56:03,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:56:03,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:56:03,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:56:03,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:55:59" (1/3) ... [2019-09-08 09:56:03,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d8abca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:56:03, skipping insertion in model container [2019-09-08 09:56:03,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:56:00" (2/3) ... [2019-09-08 09:56:03,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d8abca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:56:03, skipping insertion in model container [2019-09-08 09:56:03,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:56:03" (3/3) ... [2019-09-08 09:56:03,711 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 09:56:03,721 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:56:03,731 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:56:03,750 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:56:03,788 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:56:03,789 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:56:03,789 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:56:03,790 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:56:03,790 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:56:03,790 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:56:03,790 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:56:03,790 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:56:03,791 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:56:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states. [2019-09-08 09:56:03,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 09:56:03,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:03,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:03,883 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:03,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:03,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1669548829, now seen corresponding path program 1 times [2019-09-08 09:56:03,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:03,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:03,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:03,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:05,499 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 09:56:05,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:05,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:56:05,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:56:05,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:56:05,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:56:05,533 INFO L87 Difference]: Start difference. First operand 708 states. Second operand 4 states. [2019-09-08 09:56:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:06,069 INFO L93 Difference]: Finished difference Result 2080 states and 3717 transitions. [2019-09-08 09:56:06,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:56:06,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-09-08 09:56:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:06,114 INFO L225 Difference]: With dead ends: 2080 [2019-09-08 09:56:06,114 INFO L226 Difference]: Without dead ends: 1379 [2019-09-08 09:56:06,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:56:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-09-08 09:56:06,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1377. [2019-09-08 09:56:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2019-09-08 09:56:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2128 transitions. [2019-09-08 09:56:06,314 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2128 transitions. Word has length 304 [2019-09-08 09:56:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:06,316 INFO L475 AbstractCegarLoop]: Abstraction has 1377 states and 2128 transitions. [2019-09-08 09:56:06,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:56:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2128 transitions. [2019-09-08 09:56:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:56:06,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:06,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:06,331 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:06,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:06,333 INFO L82 PathProgramCache]: Analyzing trace with hash 909274118, now seen corresponding path program 1 times [2019-09-08 09:56:06,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:06,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:06,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:06,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:06,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:06,774 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 09:56:06,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:06,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:56:06,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:56:06,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:56:06,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:06,788 INFO L87 Difference]: Start difference. First operand 1377 states and 2128 transitions. Second operand 3 states. [2019-09-08 09:56:07,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:07,039 INFO L93 Difference]: Finished difference Result 3948 states and 6072 transitions. [2019-09-08 09:56:07,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:56:07,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-08 09:56:07,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:07,057 INFO L225 Difference]: With dead ends: 3948 [2019-09-08 09:56:07,058 INFO L226 Difference]: Without dead ends: 2700 [2019-09-08 09:56:07,063 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 09:56:07,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2019-09-08 09:56:07,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2698. [2019-09-08 09:56:07,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2698 states. [2019-09-08 09:56:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 4149 transitions. [2019-09-08 09:56:07,207 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 4149 transitions. Word has length 306 [2019-09-08 09:56:07,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:07,211 INFO L475 AbstractCegarLoop]: Abstraction has 2698 states and 4149 transitions. [2019-09-08 09:56:07,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:56:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 4149 transitions. [2019-09-08 09:56:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:56:07,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:07,222 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:07,222 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:07,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:07,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1745611787, now seen corresponding path program 1 times [2019-09-08 09:56:07,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:07,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:07,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:07,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:07,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:07,434 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 09:56:07,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:07,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:56:07,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:56:07,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:56:07,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:07,437 INFO L87 Difference]: Start difference. First operand 2698 states and 4149 transitions. Second operand 3 states. [2019-09-08 09:56:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:07,682 INFO L93 Difference]: Finished difference Result 8019 states and 12323 transitions. [2019-09-08 09:56:07,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:56:07,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-08 09:56:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:07,711 INFO L225 Difference]: With dead ends: 8019 [2019-09-08 09:56:07,712 INFO L226 Difference]: Without dead ends: 5363 [2019-09-08 09:56:07,720 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 09:56:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2019-09-08 09:56:07,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 2717. [2019-09-08 09:56:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2717 states. [2019-09-08 09:56:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 4177 transitions. [2019-09-08 09:56:07,905 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 4177 transitions. Word has length 306 [2019-09-08 09:56:07,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:07,905 INFO L475 AbstractCegarLoop]: Abstraction has 2717 states and 4177 transitions. [2019-09-08 09:56:07,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:56:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 4177 transitions. [2019-09-08 09:56:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-08 09:56:07,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:07,915 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:07,915 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:07,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1586269519, now seen corresponding path program 1 times [2019-09-08 09:56:07,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:07,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:07,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:07,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:07,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:08,160 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 09:56:08,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:08,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:56:08,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:56:08,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:56:08,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:08,162 INFO L87 Difference]: Start difference. First operand 2717 states and 4177 transitions. Second operand 3 states. [2019-09-08 09:56:08,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:08,553 INFO L93 Difference]: Finished difference Result 8038 states and 12344 transitions. [2019-09-08 09:56:08,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:56:08,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-09-08 09:56:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:08,591 INFO L225 Difference]: With dead ends: 8038 [2019-09-08 09:56:08,592 INFO L226 Difference]: Without dead ends: 5381 [2019-09-08 09:56:08,601 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 09:56:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2019-09-08 09:56:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 2735. [2019-09-08 09:56:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2735 states. [2019-09-08 09:56:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 4198 transitions. [2019-09-08 09:56:08,809 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 4198 transitions. Word has length 307 [2019-09-08 09:56:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:08,810 INFO L475 AbstractCegarLoop]: Abstraction has 2735 states and 4198 transitions. [2019-09-08 09:56:08,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:56:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 4198 transitions. [2019-09-08 09:56:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:56:08,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:08,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:08,820 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:08,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:08,821 INFO L82 PathProgramCache]: Analyzing trace with hash -748890111, now seen corresponding path program 1 times [2019-09-08 09:56:08,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:08,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:08,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:08,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:08,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:09,175 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 09:56:09,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:09,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:56:09,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:56:09,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:56:09,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:09,177 INFO L87 Difference]: Start difference. First operand 2735 states and 4198 transitions. Second operand 3 states. [2019-09-08 09:56:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:09,530 INFO L93 Difference]: Finished difference Result 7762 states and 11851 transitions. [2019-09-08 09:56:09,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:56:09,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-08 09:56:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:09,558 INFO L225 Difference]: With dead ends: 7762 [2019-09-08 09:56:09,558 INFO L226 Difference]: Without dead ends: 5272 [2019-09-08 09:56:09,568 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 09:56:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5272 states. [2019-09-08 09:56:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5272 to 5270. [2019-09-08 09:56:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5270 states. [2019-09-08 09:56:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5270 states to 5270 states and 8028 transitions. [2019-09-08 09:56:10,096 INFO L78 Accepts]: Start accepts. Automaton has 5270 states and 8028 transitions. Word has length 308 [2019-09-08 09:56:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:10,099 INFO L475 AbstractCegarLoop]: Abstraction has 5270 states and 8028 transitions. [2019-09-08 09:56:10,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:56:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 5270 states and 8028 transitions. [2019-09-08 09:56:10,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:56:10,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:10,123 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:10,124 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:10,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:10,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1385769122, now seen corresponding path program 1 times [2019-09-08 09:56:10,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:10,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:10,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:10,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:10,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:10,752 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 09:56:10,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:10,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:56:10,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:56:10,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:56:10,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:56:10,754 INFO L87 Difference]: Start difference. First operand 5270 states and 8028 transitions. Second operand 4 states. [2019-09-08 09:56:11,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:11,676 INFO L93 Difference]: Finished difference Result 14332 states and 21645 transitions. [2019-09-08 09:56:11,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:56:11,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-08 09:56:11,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:11,716 INFO L225 Difference]: With dead ends: 14332 [2019-09-08 09:56:11,716 INFO L226 Difference]: Without dead ends: 9602 [2019-09-08 09:56:11,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:56:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9602 states. [2019-09-08 09:56:12,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9602 to 5505. [2019-09-08 09:56:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5505 states. [2019-09-08 09:56:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5505 states to 5505 states and 8416 transitions. [2019-09-08 09:56:12,156 INFO L78 Accepts]: Start accepts. Automaton has 5505 states and 8416 transitions. Word has length 308 [2019-09-08 09:56:12,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:12,157 INFO L475 AbstractCegarLoop]: Abstraction has 5505 states and 8416 transitions. [2019-09-08 09:56:12,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:56:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5505 states and 8416 transitions. [2019-09-08 09:56:12,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 09:56:12,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:12,178 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:12,178 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:12,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:12,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1826813858, now seen corresponding path program 1 times [2019-09-08 09:56:12,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:12,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:12,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:12,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:12,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:12,366 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 09:56:12,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:12,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:56:12,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:56:12,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:56:12,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:12,368 INFO L87 Difference]: Start difference. First operand 5505 states and 8416 transitions. Second operand 3 states. [2019-09-08 09:56:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:13,238 INFO L93 Difference]: Finished difference Result 14945 states and 22529 transitions. [2019-09-08 09:56:13,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:56:13,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-08 09:56:13,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:13,283 INFO L225 Difference]: With dead ends: 14945 [2019-09-08 09:56:13,283 INFO L226 Difference]: Without dead ends: 10243 [2019-09-08 09:56:13,299 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 09:56:13,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10243 states. [2019-09-08 09:56:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10243 to 5609. [2019-09-08 09:56:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5609 states. [2019-09-08 09:56:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5609 states to 5609 states and 8559 transitions. [2019-09-08 09:56:13,821 INFO L78 Accepts]: Start accepts. Automaton has 5609 states and 8559 transitions. Word has length 310 [2019-09-08 09:56:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:13,822 INFO L475 AbstractCegarLoop]: Abstraction has 5609 states and 8559 transitions. [2019-09-08 09:56:13,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:56:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5609 states and 8559 transitions. [2019-09-08 09:56:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 09:56:13,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:13,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:13,839 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:13,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1672338688, now seen corresponding path program 1 times [2019-09-08 09:56:13,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:13,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:13,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:13,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:13,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:13,989 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 09:56:13,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:13,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:56:13,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:56:13,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:56:13,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:13,991 INFO L87 Difference]: Start difference. First operand 5609 states and 8559 transitions. Second operand 3 states. [2019-09-08 09:56:14,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:14,710 INFO L93 Difference]: Finished difference Result 15077 states and 22695 transitions. [2019-09-08 09:56:14,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:56:14,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-08 09:56:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:14,735 INFO L225 Difference]: With dead ends: 15077 [2019-09-08 09:56:14,735 INFO L226 Difference]: Without dead ends: 10368 [2019-09-08 09:56:14,747 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 09:56:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10368 states. [2019-09-08 09:56:15,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10368 to 5734. [2019-09-08 09:56:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5734 states. [2019-09-08 09:56:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 8705 transitions. [2019-09-08 09:56:15,191 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 8705 transitions. Word has length 311 [2019-09-08 09:56:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:15,191 INFO L475 AbstractCegarLoop]: Abstraction has 5734 states and 8705 transitions. [2019-09-08 09:56:15,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:56:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 8705 transitions. [2019-09-08 09:56:15,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 09:56:15,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:15,207 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:15,208 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:15,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:15,208 INFO L82 PathProgramCache]: Analyzing trace with hash -651694283, now seen corresponding path program 1 times [2019-09-08 09:56:15,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:15,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:15,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:15,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:15,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:15,556 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 09:56:15,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:15,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:56:15,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:56:15,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:56:15,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:56:15,558 INFO L87 Difference]: Start difference. First operand 5734 states and 8705 transitions. Second operand 4 states. [2019-09-08 09:56:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:15,988 INFO L93 Difference]: Finished difference Result 9916 states and 14937 transitions. [2019-09-08 09:56:15,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:56:15,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-08 09:56:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:16,001 INFO L225 Difference]: With dead ends: 9916 [2019-09-08 09:56:16,001 INFO L226 Difference]: Without dead ends: 5045 [2019-09-08 09:56:16,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:56:16,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states. [2019-09-08 09:56:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 5025. [2019-09-08 09:56:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5025 states. [2019-09-08 09:56:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 5025 states and 7649 transitions. [2019-09-08 09:56:16,308 INFO L78 Accepts]: Start accepts. Automaton has 5025 states and 7649 transitions. Word has length 312 [2019-09-08 09:56:16,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:16,308 INFO L475 AbstractCegarLoop]: Abstraction has 5025 states and 7649 transitions. [2019-09-08 09:56:16,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:56:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 5025 states and 7649 transitions. [2019-09-08 09:56:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 09:56:16,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:16,322 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:16,323 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:16,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:16,323 INFO L82 PathProgramCache]: Analyzing trace with hash 175091509, now seen corresponding path program 1 times [2019-09-08 09:56:16,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:16,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:16,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:16,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:16,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:16,678 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 09:56:16,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:16,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:56:16,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:56:16,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:56:16,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:56:16,680 INFO L87 Difference]: Start difference. First operand 5025 states and 7649 transitions. Second operand 5 states. [2019-09-08 09:56:17,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:17,876 INFO L93 Difference]: Finished difference Result 11187 states and 16959 transitions. [2019-09-08 09:56:17,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:56:17,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 313 [2019-09-08 09:56:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:17,896 INFO L225 Difference]: With dead ends: 11187 [2019-09-08 09:56:17,896 INFO L226 Difference]: Without dead ends: 7835 [2019-09-08 09:56:17,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:56:17,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7835 states. [2019-09-08 09:56:18,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7835 to 7833. [2019-09-08 09:56:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7833 states. [2019-09-08 09:56:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7833 states to 7833 states and 11856 transitions. [2019-09-08 09:56:18,401 INFO L78 Accepts]: Start accepts. Automaton has 7833 states and 11856 transitions. Word has length 313 [2019-09-08 09:56:18,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:18,401 INFO L475 AbstractCegarLoop]: Abstraction has 7833 states and 11856 transitions. [2019-09-08 09:56:18,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:56:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 7833 states and 11856 transitions. [2019-09-08 09:56:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 09:56:18,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:18,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:18,421 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:18,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:18,422 INFO L82 PathProgramCache]: Analyzing trace with hash 34938943, now seen corresponding path program 1 times [2019-09-08 09:56:18,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:18,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:18,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:18,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:18,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:18,949 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 09:56:18,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:18,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 09:56:18,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:56:18,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:56:18,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:56:18,953 INFO L87 Difference]: Start difference. First operand 7833 states and 11856 transitions. Second operand 8 states. [2019-09-08 09:56:21,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:21,213 INFO L93 Difference]: Finished difference Result 19032 states and 29485 transitions. [2019-09-08 09:56:21,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 09:56:21,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 313 [2019-09-08 09:56:21,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:21,254 INFO L225 Difference]: With dead ends: 19032 [2019-09-08 09:56:21,254 INFO L226 Difference]: Without dead ends: 12983 [2019-09-08 09:56:21,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:56:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12983 states. [2019-09-08 09:56:22,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12983 to 8877. [2019-09-08 09:56:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8877 states. [2019-09-08 09:56:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8877 states to 8877 states and 13385 transitions. [2019-09-08 09:56:22,442 INFO L78 Accepts]: Start accepts. Automaton has 8877 states and 13385 transitions. Word has length 313 [2019-09-08 09:56:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:22,443 INFO L475 AbstractCegarLoop]: Abstraction has 8877 states and 13385 transitions. [2019-09-08 09:56:22,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:56:22,444 INFO L276 IsEmpty]: Start isEmpty. Operand 8877 states and 13385 transitions. [2019-09-08 09:56:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 09:56:22,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:22,459 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:22,459 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:22,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:22,460 INFO L82 PathProgramCache]: Analyzing trace with hash 498317091, now seen corresponding path program 1 times [2019-09-08 09:56:22,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:22,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:22,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:22,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:22,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:23,273 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 09:56:23,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:23,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:56:23,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:56:23,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:56:23,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:56:23,276 INFO L87 Difference]: Start difference. First operand 8877 states and 13385 transitions. Second operand 4 states. [2019-09-08 09:56:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:24,427 INFO L93 Difference]: Finished difference Result 26013 states and 39165 transitions. [2019-09-08 09:56:24,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:56:24,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 313 [2019-09-08 09:56:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:24,469 INFO L225 Difference]: With dead ends: 26013 [2019-09-08 09:56:24,469 INFO L226 Difference]: Without dead ends: 17208 [2019-09-08 09:56:24,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:56:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17208 states. [2019-09-08 09:56:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17208 to 17206. [2019-09-08 09:56:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17206 states. [2019-09-08 09:56:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17206 states to 17206 states and 25739 transitions. [2019-09-08 09:56:25,429 INFO L78 Accepts]: Start accepts. Automaton has 17206 states and 25739 transitions. Word has length 313 [2019-09-08 09:56:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:25,430 INFO L475 AbstractCegarLoop]: Abstraction has 17206 states and 25739 transitions. [2019-09-08 09:56:25,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:56:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 17206 states and 25739 transitions. [2019-09-08 09:56:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-08 09:56:25,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:25,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:25,459 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash 421614595, now seen corresponding path program 1 times [2019-09-08 09:56:25,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:25,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:25,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:25,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:25,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:25,770 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 09:56:25,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:25,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:56:25,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:56:25,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:56:25,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:25,772 INFO L87 Difference]: Start difference. First operand 17206 states and 25739 transitions. Second operand 3 states. [2019-09-08 09:56:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:27,553 INFO L93 Difference]: Finished difference Result 49214 states and 73291 transitions. [2019-09-08 09:56:27,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:56:27,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-08 09:56:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:27,619 INFO L225 Difference]: With dead ends: 49214 [2019-09-08 09:56:27,619 INFO L226 Difference]: Without dead ends: 33257 [2019-09-08 09:56:27,654 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 09:56:27,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33257 states. [2019-09-08 09:56:30,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33257 to 33255. [2019-09-08 09:56:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33255 states. [2019-09-08 09:56:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33255 states to 33255 states and 49376 transitions. [2019-09-08 09:56:30,727 INFO L78 Accepts]: Start accepts. Automaton has 33255 states and 49376 transitions. Word has length 315 [2019-09-08 09:56:30,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:30,727 INFO L475 AbstractCegarLoop]: Abstraction has 33255 states and 49376 transitions. [2019-09-08 09:56:30,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:56:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 33255 states and 49376 transitions. [2019-09-08 09:56:30,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 09:56:30,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:30,764 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:30,765 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:30,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:30,765 INFO L82 PathProgramCache]: Analyzing trace with hash -225211608, now seen corresponding path program 1 times [2019-09-08 09:56:30,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:30,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:30,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:30,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:30,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:56:31,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:31,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:56:31,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:56:31,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:56:31,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:31,052 INFO L87 Difference]: Start difference. First operand 33255 states and 49376 transitions. Second operand 3 states. [2019-09-08 09:56:34,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:34,505 INFO L93 Difference]: Finished difference Result 96848 states and 143344 transitions. [2019-09-08 09:56:34,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:56:34,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-09-08 09:56:34,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:34,598 INFO L225 Difference]: With dead ends: 96848 [2019-09-08 09:56:34,599 INFO L226 Difference]: Without dead ends: 64940 [2019-09-08 09:56:34,655 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 09:56:34,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64940 states. [2019-09-08 09:56:39,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64940 to 64938. [2019-09-08 09:56:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64938 states. [2019-09-08 09:56:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64938 states to 64938 states and 95639 transitions. [2019-09-08 09:56:39,485 INFO L78 Accepts]: Start accepts. Automaton has 64938 states and 95639 transitions. Word has length 317 [2019-09-08 09:56:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:39,486 INFO L475 AbstractCegarLoop]: Abstraction has 64938 states and 95639 transitions. [2019-09-08 09:56:39,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:56:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 64938 states and 95639 transitions. [2019-09-08 09:56:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 09:56:39,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:39,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:39,535 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:39,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:39,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1961490731, now seen corresponding path program 1 times [2019-09-08 09:56:39,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:39,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:39,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:39,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:39,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:39,880 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 09:56:39,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:39,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:56:39,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:56:39,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:56:39,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:56:39,883 INFO L87 Difference]: Start difference. First operand 64938 states and 95639 transitions. Second operand 4 states. [2019-09-08 09:56:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:47,305 INFO L93 Difference]: Finished difference Result 171091 states and 251082 transitions. [2019-09-08 09:56:47,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:56:47,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2019-09-08 09:56:47,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:47,481 INFO L225 Difference]: With dead ends: 171091 [2019-09-08 09:56:47,482 INFO L226 Difference]: Without dead ends: 109445 [2019-09-08 09:56:47,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:56:47,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109445 states. [2019-09-08 09:56:51,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109445 to 63581. [2019-09-08 09:56:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63581 states. [2019-09-08 09:56:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63581 states to 63581 states and 93709 transitions. [2019-09-08 09:56:51,878 INFO L78 Accepts]: Start accepts. Automaton has 63581 states and 93709 transitions. Word has length 317 [2019-09-08 09:56:51,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:51,878 INFO L475 AbstractCegarLoop]: Abstraction has 63581 states and 93709 transitions. [2019-09-08 09:56:51,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:56:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 63581 states and 93709 transitions. [2019-09-08 09:56:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 09:56:51,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:51,924 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:51,924 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:51,924 INFO L82 PathProgramCache]: Analyzing trace with hash 283149039, now seen corresponding path program 1 times [2019-09-08 09:56:51,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:51,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:51,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:51,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:51,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:52,069 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 09:56:52,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:52,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:56:52,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:56:52,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:56:52,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:52,074 INFO L87 Difference]: Start difference. First operand 63581 states and 93709 transitions. Second operand 3 states. [2019-09-08 09:56:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:59,508 INFO L93 Difference]: Finished difference Result 167660 states and 245936 transitions. [2019-09-08 09:56:59,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:56:59,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 09:56:59,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:59,666 INFO L225 Difference]: With dead ends: 167660 [2019-09-08 09:56:59,666 INFO L226 Difference]: Without dead ends: 110530 [2019-09-08 09:56:59,751 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 09:56:59,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110530 states. [2019-09-08 09:57:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110530 to 64062. [2019-09-08 09:57:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64062 states. [2019-09-08 09:57:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64062 states to 64062 states and 94307 transitions. [2019-09-08 09:57:04,508 INFO L78 Accepts]: Start accepts. Automaton has 64062 states and 94307 transitions. Word has length 320 [2019-09-08 09:57:04,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:04,508 INFO L475 AbstractCegarLoop]: Abstraction has 64062 states and 94307 transitions. [2019-09-08 09:57:04,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:57:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 64062 states and 94307 transitions. [2019-09-08 09:57:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 09:57:04,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:04,550 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:04,550 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:04,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:04,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1767642583, now seen corresponding path program 1 times [2019-09-08 09:57:04,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:04,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:04,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:04,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:04,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:04,908 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 09:57:04,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:04,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:57:04,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:57:04,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:57:04,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:57:04,911 INFO L87 Difference]: Start difference. First operand 64062 states and 94307 transitions. Second operand 4 states. [2019-09-08 09:57:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:09,111 INFO L93 Difference]: Finished difference Result 116147 states and 170297 transitions. [2019-09-08 09:57:09,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:57:09,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2019-09-08 09:57:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:09,175 INFO L225 Difference]: With dead ends: 116147 [2019-09-08 09:57:09,175 INFO L226 Difference]: Without dead ends: 57397 [2019-09-08 09:57:09,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:57:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57397 states. [2019-09-08 09:57:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57397 to 57070. [2019-09-08 09:57:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57070 states. [2019-09-08 09:57:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57070 states to 57070 states and 83929 transitions. [2019-09-08 09:57:14,586 INFO L78 Accepts]: Start accepts. Automaton has 57070 states and 83929 transitions. Word has length 321 [2019-09-08 09:57:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:14,586 INFO L475 AbstractCegarLoop]: Abstraction has 57070 states and 83929 transitions. [2019-09-08 09:57:14,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:57:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 57070 states and 83929 transitions. [2019-09-08 09:57:14,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 09:57:14,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:14,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:14,620 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:14,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:14,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1761143674, now seen corresponding path program 1 times [2019-09-08 09:57:14,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:14,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:14,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:14,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:14,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:15,080 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 09:57:15,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:15,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 09:57:15,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:57:15,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:57:15,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:57:15,082 INFO L87 Difference]: Start difference. First operand 57070 states and 83929 transitions. Second operand 9 states. [2019-09-08 09:57:17,494 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-09-08 09:57:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:29,205 INFO L93 Difference]: Finished difference Result 204324 states and 306825 transitions. [2019-09-08 09:57:29,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 09:57:29,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 322 [2019-09-08 09:57:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:29,404 INFO L225 Difference]: With dead ends: 204324 [2019-09-08 09:57:29,405 INFO L226 Difference]: Without dead ends: 158630 [2019-09-08 09:57:29,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-09-08 09:57:29,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158630 states. [2019-09-08 09:57:41,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158630 to 119256. [2019-09-08 09:57:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119256 states. [2019-09-08 09:57:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119256 states to 119256 states and 176012 transitions. [2019-09-08 09:57:41,721 INFO L78 Accepts]: Start accepts. Automaton has 119256 states and 176012 transitions. Word has length 322 [2019-09-08 09:57:41,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:41,722 INFO L475 AbstractCegarLoop]: Abstraction has 119256 states and 176012 transitions. [2019-09-08 09:57:41,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 09:57:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 119256 states and 176012 transitions. [2019-09-08 09:57:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 09:57:41,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:41,780 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:41,780 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:41,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:41,781 INFO L82 PathProgramCache]: Analyzing trace with hash -245477294, now seen corresponding path program 1 times [2019-09-08 09:57:41,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:41,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:41,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:41,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:41,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:42,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:42,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:57:42,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:57:42,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:57:42,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:57:42,401 INFO L87 Difference]: Start difference. First operand 119256 states and 176012 transitions. Second operand 4 states. [2019-09-08 09:57:55,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:55,658 INFO L93 Difference]: Finished difference Result 196662 states and 299150 transitions. [2019-09-08 09:57:55,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:57:55,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-08 09:57:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:55,817 INFO L225 Difference]: With dead ends: 196662 [2019-09-08 09:57:55,817 INFO L226 Difference]: Without dead ends: 139302 [2019-09-08 09:57:55,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 09:57:55,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139302 states. [2019-09-08 09:58:06,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139302 to 139300. [2019-09-08 09:58:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139300 states. [2019-09-08 09:58:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139300 states to 139300 states and 207232 transitions. [2019-09-08 09:58:06,949 INFO L78 Accepts]: Start accepts. Automaton has 139300 states and 207232 transitions. Word has length 322 [2019-09-08 09:58:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:58:06,950 INFO L475 AbstractCegarLoop]: Abstraction has 139300 states and 207232 transitions. [2019-09-08 09:58:06,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:58:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 139300 states and 207232 transitions. [2019-09-08 09:58:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 09:58:07,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:58:07,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:58:07,013 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:58:07,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:58:07,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1093279294, now seen corresponding path program 1 times [2019-09-08 09:58:07,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:58:07,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:58:07,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:58:07,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:58:07,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:58:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:58:07,483 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 09:58:07,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:58:07,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:58:07,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:58:07,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:58:07,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:58:07,486 INFO L87 Difference]: Start difference. First operand 139300 states and 207232 transitions. Second operand 4 states. [2019-09-08 09:58:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:58:31,626 INFO L93 Difference]: Finished difference Result 403096 states and 599290 transitions. [2019-09-08 09:58:31,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:58:31,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-08 09:58:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:58:32,092 INFO L225 Difference]: With dead ends: 403096 [2019-09-08 09:58:32,093 INFO L226 Difference]: Without dead ends: 264014 [2019-09-08 09:58:32,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:58:32,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264014 states. [2019-09-08 09:59:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264014 to 264012. [2019-09-08 09:59:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264012 states. [2019-09-08 09:59:00,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264012 states to 264012 states and 390000 transitions. [2019-09-08 09:59:00,684 INFO L78 Accepts]: Start accepts. Automaton has 264012 states and 390000 transitions. Word has length 322 [2019-09-08 09:59:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:00,684 INFO L475 AbstractCegarLoop]: Abstraction has 264012 states and 390000 transitions. [2019-09-08 09:59:00,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:59:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand 264012 states and 390000 transitions. [2019-09-08 09:59:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 09:59:00,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:00,802 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:59:00,802 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:00,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:00,803 INFO L82 PathProgramCache]: Analyzing trace with hash 376563355, now seen corresponding path program 1 times [2019-09-08 09:59:00,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:00,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:00,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:00,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:00,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:01,014 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 09:59:01,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:01,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:59:01,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:59:01,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:59:01,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:01,016 INFO L87 Difference]: Start difference. First operand 264012 states and 390000 transitions. Second operand 3 states. [2019-09-08 09:59:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:52,160 INFO L93 Difference]: Finished difference Result 775068 states and 1144545 transitions. [2019-09-08 09:59:52,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:59:52,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 09:59:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:52,975 INFO L225 Difference]: With dead ends: 775068 [2019-09-08 09:59:52,976 INFO L226 Difference]: Without dead ends: 515733 [2019-09-08 09:59:53,207 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 09:59:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515733 states. [2019-09-08 10:00:53,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515733 to 515479. [2019-09-08 10:00:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515479 states. [2019-09-08 10:00:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515479 states to 515479 states and 756760 transitions. [2019-09-08 10:00:54,259 INFO L78 Accepts]: Start accepts. Automaton has 515479 states and 756760 transitions. Word has length 324 [2019-09-08 10:00:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:00:54,260 INFO L475 AbstractCegarLoop]: Abstraction has 515479 states and 756760 transitions. [2019-09-08 10:00:54,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:00:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 515479 states and 756760 transitions. [2019-09-08 10:00:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 10:00:54,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:00:54,512 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:00:54,512 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:00:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:00:54,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1317458006, now seen corresponding path program 1 times [2019-09-08 10:00:54,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:00:54,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:00:54,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:54,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:00:54,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:00:54,724 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:00:54,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:00:54,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:00:54,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:00:54,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:00:54,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:00:54,726 INFO L87 Difference]: Start difference. First operand 515479 states and 756760 transitions. Second operand 3 states. [2019-09-08 10:02:38,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:38,081 INFO L93 Difference]: Finished difference Result 1514539 states and 2222477 transitions. [2019-09-08 10:02:38,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:38,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 10:02:38,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:39,684 INFO L225 Difference]: With dead ends: 1514539 [2019-09-08 10:02:39,684 INFO L226 Difference]: Without dead ends: 1009913 [2019-09-08 10:02:40,097 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:02:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009913 states. [2019-09-08 10:04:50,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009913 to 1009911. [2019-09-08 10:04:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009911 states. [2019-09-08 10:04:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009911 states to 1009911 states and 1473457 transitions. [2019-09-08 10:04:53,224 INFO L78 Accepts]: Start accepts. Automaton has 1009911 states and 1473457 transitions. Word has length 326 [2019-09-08 10:04:53,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:53,225 INFO L475 AbstractCegarLoop]: Abstraction has 1009911 states and 1473457 transitions. [2019-09-08 10:04:53,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:04:53,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1009911 states and 1473457 transitions. [2019-09-08 10:04:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 10:04:53,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:53,708 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:04:53,708 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:53,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:53,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1738790669, now seen corresponding path program 1 times [2019-09-08 10:04:53,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:53,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:53,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:53,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:53,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:54,075 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:04:54,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:54,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:04:54,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:04:54,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:04:54,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:04:54,080 INFO L87 Difference]: Start difference. First operand 1009911 states and 1473457 transitions. Second operand 4 states.