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/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:22:04,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:22:04,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:22:04,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:22:04,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:22:04,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:22:04,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:22:04,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:22:04,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:22:04,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:22:04,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:22:04,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:22:04,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:22:04,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:22:04,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:22:04,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:22:04,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:22:04,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:22:04,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:22:04,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:22:04,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:22:04,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:22:04,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:22:04,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:22:04,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:22:04,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:22:04,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:22:04,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:22:04,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:22:04,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:22:04,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:22:04,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:22:04,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:22:04,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:22:04,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:22:04,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:22:04,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:22:04,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:22:04,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:22:04,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:22:04,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:22:04,977 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 08:22:04,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:22:04,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:22:04,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:22:04,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:22:04,993 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:22:04,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:22:04,993 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:22:04,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:22:04,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:22:04,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:22:04,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:22:04,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:22:04,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:22:04,994 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:22:04,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:22:04,995 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:22:04,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:22:04,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:22:04,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:22:04,996 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:22:04,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:22:04,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:22:04,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:22:04,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:22:04,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:22:04,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:22:04,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:22:04,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:22:04,997 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:22:05,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:22:05,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:22:05,042 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:22:05,044 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:22:05,044 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:22:05,045 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c [2019-09-08 08:22:05,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e950ce516/78b074bf2ad04b1a8315b3701e52bc8e/FLAG6f8986678 [2019-09-08 08:22:05,750 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:22:05,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c [2019-09-08 08:22:05,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e950ce516/78b074bf2ad04b1a8315b3701e52bc8e/FLAG6f8986678 [2019-09-08 08:22:05,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e950ce516/78b074bf2ad04b1a8315b3701e52bc8e [2019-09-08 08:22:05,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:22:05,960 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:22:05,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:22:05,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:22:05,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:22:05,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:22:05" (1/1) ... [2019-09-08 08:22:05,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386a8cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:22:05, skipping insertion in model container [2019-09-08 08:22:05,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:22:05" (1/1) ... [2019-09-08 08:22:05,975 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:22:06,040 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:22:06,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:22:06,610 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:22:06,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:22:06,769 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:22:06,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:22:06 WrapperNode [2019-09-08 08:22:06,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:22:06,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:22:06,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:22:06,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:22:06,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:22:06" (1/1) ... [2019-09-08 08:22:06,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:22:06" (1/1) ... [2019-09-08 08:22:06,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:22:06" (1/1) ... [2019-09-08 08:22:06,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:22:06" (1/1) ... [2019-09-08 08:22:06,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:22:06" (1/1) ... [2019-09-08 08:22:06,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:22:06" (1/1) ... [2019-09-08 08:22:06,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:22:06" (1/1) ... [2019-09-08 08:22:06,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:22:06,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:22:06,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:22:06,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:22:06,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:22:06" (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 08:22:07,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:22:07,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:22:07,033 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:22:07,033 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:22:07,034 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:22:07,034 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 08:22:07,034 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-08 08:22:07,035 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:22:07,036 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:22:07,036 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:22:07,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:22:07,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:22:07,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:22:07,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:22:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:22:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:22:07,040 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:22:07,041 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:22:07,041 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:22:07,041 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:22:07,041 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:22:07,041 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 08:22:07,041 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 08:22:07,042 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:22:07,042 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:22:07,042 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:22:07,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:22:07,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:22:09,359 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:22:09,360 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:22:09,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:22:09 BoogieIcfgContainer [2019-09-08 08:22:09,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:22:09,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:22:09,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:22:09,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:22:09,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:22:05" (1/3) ... [2019-09-08 08:22:09,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446d5037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:22:09, skipping insertion in model container [2019-09-08 08:22:09,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:22:06" (2/3) ... [2019-09-08 08:22:09,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446d5037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:22:09, skipping insertion in model container [2019-09-08 08:22:09,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:22:09" (3/3) ... [2019-09-08 08:22:09,370 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c [2019-09-08 08:22:09,379 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:22:09,388 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:22:09,405 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:22:09,441 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:22:09,442 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:22:09,442 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:22:09,442 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:22:09,443 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:22:09,443 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:22:09,443 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:22:09,443 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:22:09,443 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:22:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states. [2019-09-08 08:22:09,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 08:22:09,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:09,504 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:22:09,506 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:09,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:09,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1836203499, now seen corresponding path program 1 times [2019-09-08 08:22:09,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:09,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:09,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:09,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:09,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:10,233 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 08:22:10,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:10,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:22:10,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:22:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:22:10,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:22:10,266 INFO L87 Difference]: Start difference. First operand 767 states. Second operand 5 states. [2019-09-08 08:22:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:10,676 INFO L93 Difference]: Finished difference Result 981 states and 1739 transitions. [2019-09-08 08:22:10,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:22:10,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-09-08 08:22:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:10,702 INFO L225 Difference]: With dead ends: 981 [2019-09-08 08:22:10,703 INFO L226 Difference]: Without dead ends: 762 [2019-09-08 08:22:10,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:22:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-08 08:22:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2019-09-08 08:22:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-09-08 08:22:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1316 transitions. [2019-09-08 08:22:10,804 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1316 transitions. Word has length 181 [2019-09-08 08:22:10,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:10,805 INFO L475 AbstractCegarLoop]: Abstraction has 762 states and 1316 transitions. [2019-09-08 08:22:10,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:22:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1316 transitions. [2019-09-08 08:22:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 08:22:10,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:10,811 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:22:10,811 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:10,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:10,811 INFO L82 PathProgramCache]: Analyzing trace with hash 453327305, now seen corresponding path program 1 times [2019-09-08 08:22:10,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:10,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:10,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:10,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:10,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:11,172 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 08:22:11,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:11,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:22:11,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:22:11,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:22:11,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:22:11,178 INFO L87 Difference]: Start difference. First operand 762 states and 1316 transitions. Second operand 5 states. [2019-09-08 08:22:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:14,118 INFO L93 Difference]: Finished difference Result 1170 states and 1987 transitions. [2019-09-08 08:22:14,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:22:14,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 08:22:14,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:14,131 INFO L225 Difference]: With dead ends: 1170 [2019-09-08 08:22:14,132 INFO L226 Difference]: Without dead ends: 965 [2019-09-08 08:22:14,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:22:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-09-08 08:22:14,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 953. [2019-09-08 08:22:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-09-08 08:22:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1626 transitions. [2019-09-08 08:22:14,189 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1626 transitions. Word has length 245 [2019-09-08 08:22:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:14,190 INFO L475 AbstractCegarLoop]: Abstraction has 953 states and 1626 transitions. [2019-09-08 08:22:14,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:22:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1626 transitions. [2019-09-08 08:22:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 08:22:14,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:14,195 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:22:14,196 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:14,196 INFO L82 PathProgramCache]: Analyzing trace with hash 976666609, now seen corresponding path program 1 times [2019-09-08 08:22:14,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:14,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:14,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:14,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:14,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:14,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 08:22:14,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:14,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:22:14,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:22:14,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:22:14,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:22:14,501 INFO L87 Difference]: Start difference. First operand 953 states and 1626 transitions. Second operand 5 states. [2019-09-08 08:22:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:17,348 INFO L93 Difference]: Finished difference Result 1731 states and 2894 transitions. [2019-09-08 08:22:17,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:22:17,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2019-09-08 08:22:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:17,357 INFO L225 Difference]: With dead ends: 1731 [2019-09-08 08:22:17,357 INFO L226 Difference]: Without dead ends: 1335 [2019-09-08 08:22:17,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:22:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-09-08 08:22:17,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1327. [2019-09-08 08:22:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1327 states. [2019-09-08 08:22:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 2234 transitions. [2019-09-08 08:22:17,414 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 2234 transitions. Word has length 249 [2019-09-08 08:22:17,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:17,414 INFO L475 AbstractCegarLoop]: Abstraction has 1327 states and 2234 transitions. [2019-09-08 08:22:17,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:22:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 2234 transitions. [2019-09-08 08:22:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 08:22:17,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:17,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] [2019-09-08 08:22:17,421 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:17,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:17,421 INFO L82 PathProgramCache]: Analyzing trace with hash -806730487, now seen corresponding path program 1 times [2019-09-08 08:22:17,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:17,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:17,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:17,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:17,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:17,600 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 08:22:17,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:17,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:22:17,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:22:17,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:22:17,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:22:17,602 INFO L87 Difference]: Start difference. First operand 1327 states and 2234 transitions. Second operand 5 states. [2019-09-08 08:22:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:20,567 INFO L93 Difference]: Finished difference Result 2839 states and 4688 transitions. [2019-09-08 08:22:20,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:22:20,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 253 [2019-09-08 08:22:20,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:20,583 INFO L225 Difference]: With dead ends: 2839 [2019-09-08 08:22:20,583 INFO L226 Difference]: Without dead ends: 2069 [2019-09-08 08:22:20,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:22:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-09-08 08:22:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 2055. [2019-09-08 08:22:20,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2019-09-08 08:22:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3410 transitions. [2019-09-08 08:22:20,719 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3410 transitions. Word has length 253 [2019-09-08 08:22:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:20,720 INFO L475 AbstractCegarLoop]: Abstraction has 2055 states and 3410 transitions. [2019-09-08 08:22:20,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:22:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3410 transitions. [2019-09-08 08:22:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 08:22:20,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:20,727 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] [2019-09-08 08:22:20,727 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:20,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:20,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1656053041, now seen corresponding path program 1 times [2019-09-08 08:22:20,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:20,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:20,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:20,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:20,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:20,924 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 08:22:20,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:20,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:22:20,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:22:20,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:22:20,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:22:20,926 INFO L87 Difference]: Start difference. First operand 2055 states and 3410 transitions. Second operand 5 states. [2019-09-08 08:22:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:23,757 INFO L93 Difference]: Finished difference Result 4995 states and 8156 transitions. [2019-09-08 08:22:23,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:22:23,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 257 [2019-09-08 08:22:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:23,779 INFO L225 Difference]: With dead ends: 4995 [2019-09-08 08:22:23,779 INFO L226 Difference]: Without dead ends: 3497 [2019-09-08 08:22:23,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:22:23,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2019-09-08 08:22:23,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 3471. [2019-09-08 08:22:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3471 states. [2019-09-08 08:22:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 5682 transitions. [2019-09-08 08:22:23,937 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 5682 transitions. Word has length 257 [2019-09-08 08:22:23,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:23,938 INFO L475 AbstractCegarLoop]: Abstraction has 3471 states and 5682 transitions. [2019-09-08 08:22:23,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:22:23,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 5682 transitions. [2019-09-08 08:22:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 08:22:23,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:23,946 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] [2019-09-08 08:22:23,946 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:23,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:23,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1073111479, now seen corresponding path program 1 times [2019-09-08 08:22:23,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:23,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:23,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:23,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:23,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:24,204 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 08:22:24,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:24,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:22:24,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:22:24,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:22:24,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:22:24,206 INFO L87 Difference]: Start difference. First operand 3471 states and 5682 transitions. Second operand 5 states. [2019-09-08 08:22:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:26,947 INFO L93 Difference]: Finished difference Result 9187 states and 14852 transitions. [2019-09-08 08:22:26,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:22:26,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2019-09-08 08:22:26,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:26,980 INFO L225 Difference]: With dead ends: 9187 [2019-09-08 08:22:26,981 INFO L226 Difference]: Without dead ends: 6273 [2019-09-08 08:22:26,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:22:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6273 states. [2019-09-08 08:22:27,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6273 to 6223. [2019-09-08 08:22:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2019-09-08 08:22:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 10066 transitions. [2019-09-08 08:22:27,165 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 10066 transitions. Word has length 261 [2019-09-08 08:22:27,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:27,166 INFO L475 AbstractCegarLoop]: Abstraction has 6223 states and 10066 transitions. [2019-09-08 08:22:27,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:22:27,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 10066 transitions. [2019-09-08 08:22:27,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 08:22:27,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:27,176 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] [2019-09-08 08:22:27,176 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:27,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:27,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1975836145, now seen corresponding path program 1 times [2019-09-08 08:22:27,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:27,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:27,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:27,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:27,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:22:27,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:27,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:22:27,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:22:27,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:22:27,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:22:27,712 INFO L87 Difference]: Start difference. First operand 6223 states and 10066 transitions. Second operand 13 states. [2019-09-08 08:22:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:42,709 INFO L93 Difference]: Finished difference Result 46976 states and 76609 transitions. [2019-09-08 08:22:42,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 08:22:42,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 265 [2019-09-08 08:22:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:42,945 INFO L225 Difference]: With dead ends: 46976 [2019-09-08 08:22:42,945 INFO L226 Difference]: Without dead ends: 41310 [2019-09-08 08:22:42,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 08:22:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41310 states. [2019-09-08 08:22:44,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41310 to 37694. [2019-09-08 08:22:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37694 states. [2019-09-08 08:22:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37694 states to 37694 states and 61388 transitions. [2019-09-08 08:22:44,320 INFO L78 Accepts]: Start accepts. Automaton has 37694 states and 61388 transitions. Word has length 265 [2019-09-08 08:22:44,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:44,321 INFO L475 AbstractCegarLoop]: Abstraction has 37694 states and 61388 transitions. [2019-09-08 08:22:44,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:22:44,321 INFO L276 IsEmpty]: Start isEmpty. Operand 37694 states and 61388 transitions. [2019-09-08 08:22:44,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 08:22:44,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:44,350 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] [2019-09-08 08:22:44,350 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:44,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:44,350 INFO L82 PathProgramCache]: Analyzing trace with hash 107488039, now seen corresponding path program 1 times [2019-09-08 08:22:44,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:44,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:44,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:45,548 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 08:22:45,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:45,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:22:45,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:22:45,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:22:45,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:22:45,550 INFO L87 Difference]: Start difference. First operand 37694 states and 61388 transitions. Second operand 6 states. [2019-09-08 08:22:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:50,175 INFO L93 Difference]: Finished difference Result 96032 states and 156595 transitions. [2019-09-08 08:22:50,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:22:50,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 266 [2019-09-08 08:22:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:50,411 INFO L225 Difference]: With dead ends: 96032 [2019-09-08 08:22:50,411 INFO L226 Difference]: Without dead ends: 58895 [2019-09-08 08:22:50,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:22:50,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58895 states. [2019-09-08 08:22:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58895 to 55723. [2019-09-08 08:22:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55723 states. [2019-09-08 08:22:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55723 states to 55723 states and 90843 transitions. [2019-09-08 08:22:52,088 INFO L78 Accepts]: Start accepts. Automaton has 55723 states and 90843 transitions. Word has length 266 [2019-09-08 08:22:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:52,089 INFO L475 AbstractCegarLoop]: Abstraction has 55723 states and 90843 transitions. [2019-09-08 08:22:52,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:22:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 55723 states and 90843 transitions. [2019-09-08 08:22:52,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 08:22:52,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:52,114 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] [2019-09-08 08:22:52,115 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:52,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:52,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2134593449, now seen corresponding path program 1 times [2019-09-08 08:22:52,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:52,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:52,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:52,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:52,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:52,925 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 08:22:52,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:52,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:22:52,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:22:52,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:22:52,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:22:52,927 INFO L87 Difference]: Start difference. First operand 55723 states and 90843 transitions. Second operand 13 states. [2019-09-08 08:23:09,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:23:09,716 INFO L93 Difference]: Finished difference Result 104122 states and 169778 transitions. [2019-09-08 08:23:09,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-08 08:23:09,717 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 267 [2019-09-08 08:23:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:23:10,016 INFO L225 Difference]: With dead ends: 104122 [2019-09-08 08:23:10,016 INFO L226 Difference]: Without dead ends: 101144 [2019-09-08 08:23:10,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1708 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=985, Invalid=3985, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 08:23:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101144 states. [2019-09-08 08:23:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101144 to 91861. [2019-09-08 08:23:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91861 states. [2019-09-08 08:23:14,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91861 states to 91861 states and 149838 transitions. [2019-09-08 08:23:14,219 INFO L78 Accepts]: Start accepts. Automaton has 91861 states and 149838 transitions. Word has length 267 [2019-09-08 08:23:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:23:14,220 INFO L475 AbstractCegarLoop]: Abstraction has 91861 states and 149838 transitions. [2019-09-08 08:23:14,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:23:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 91861 states and 149838 transitions. [2019-09-08 08:23:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 08:23:14,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:23:14,247 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:23:14,248 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:23:14,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:23:14,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1425353305, now seen corresponding path program 1 times [2019-09-08 08:23:14,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:23:14,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:23:14,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:14,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:23:14,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:23:14,624 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 08:23:14,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:23:14,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:23:14,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:23:14,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:23:14,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:23:14,627 INFO L87 Difference]: Start difference. First operand 91861 states and 149838 transitions. Second operand 13 states. [2019-09-08 08:23:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:23:37,447 INFO L93 Difference]: Finished difference Result 148692 states and 242938 transitions. [2019-09-08 08:23:37,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 08:23:37,449 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 267 [2019-09-08 08:23:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:23:37,925 INFO L225 Difference]: With dead ends: 148692 [2019-09-08 08:23:37,925 INFO L226 Difference]: Without dead ends: 136982 [2019-09-08 08:23:37,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1913 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1055, Invalid=4495, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 08:23:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136982 states. [2019-09-08 08:23:42,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136982 to 115067. [2019-09-08 08:23:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115067 states. [2019-09-08 08:23:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115067 states to 115067 states and 187689 transitions. [2019-09-08 08:23:42,758 INFO L78 Accepts]: Start accepts. Automaton has 115067 states and 187689 transitions. Word has length 267 [2019-09-08 08:23:42,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:23:42,759 INFO L475 AbstractCegarLoop]: Abstraction has 115067 states and 187689 transitions. [2019-09-08 08:23:42,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:23:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 115067 states and 187689 transitions. [2019-09-08 08:23:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 08:23:42,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:23:42,781 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] [2019-09-08 08:23:42,781 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:23:42,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:23:42,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1805107113, now seen corresponding path program 1 times [2019-09-08 08:23:42,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:23:42,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:23:42,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:42,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:23:42,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:23:43,228 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 08:23:43,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:23:43,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:23:43,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:23:43,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:23:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:23:43,230 INFO L87 Difference]: Start difference. First operand 115067 states and 187689 transitions. Second operand 13 states. [2019-09-08 08:24:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:24:03,564 INFO L93 Difference]: Finished difference Result 179723 states and 293691 transitions. [2019-09-08 08:24:03,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 08:24:03,564 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 267 [2019-09-08 08:24:03,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:24:04,064 INFO L225 Difference]: With dead ends: 179723 [2019-09-08 08:24:04,065 INFO L226 Difference]: Without dead ends: 149907 [2019-09-08 08:24:04,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1797 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 08:24:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149907 states. [2019-09-08 08:24:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149907 to 130415. [2019-09-08 08:24:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130415 states. [2019-09-08 08:24:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130415 states to 130415 states and 212952 transitions. [2019-09-08 08:24:07,063 INFO L78 Accepts]: Start accepts. Automaton has 130415 states and 212952 transitions. Word has length 267 [2019-09-08 08:24:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:24:07,064 INFO L475 AbstractCegarLoop]: Abstraction has 130415 states and 212952 transitions. [2019-09-08 08:24:07,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:24:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 130415 states and 212952 transitions. [2019-09-08 08:24:07,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 08:24:07,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:24:07,086 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] [2019-09-08 08:24:07,086 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:24:07,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:24:07,087 INFO L82 PathProgramCache]: Analyzing trace with hash 523288921, now seen corresponding path program 1 times [2019-09-08 08:24:07,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:24:07,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:24:07,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:24:07,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:24:07,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:24:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:24:07,496 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 08:24:07,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:24:07,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:24:07,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:24:07,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:24:07,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:24:07,499 INFO L87 Difference]: Start difference. First operand 130415 states and 212952 transitions. Second operand 13 states. [2019-09-08 08:24:28,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:24:28,881 INFO L93 Difference]: Finished difference Result 239106 states and 391371 transitions. [2019-09-08 08:24:28,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 08:24:28,881 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 267 [2019-09-08 08:24:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:24:29,393 INFO L225 Difference]: With dead ends: 239106 [2019-09-08 08:24:29,394 INFO L226 Difference]: Without dead ends: 190508 [2019-09-08 08:24:29,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1800 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 08:24:29,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190508 states. [2019-09-08 08:24:32,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190508 to 166156. [2019-09-08 08:24:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166156 states. [2019-09-08 08:24:37,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166156 states to 166156 states and 271912 transitions. [2019-09-08 08:24:37,380 INFO L78 Accepts]: Start accepts. Automaton has 166156 states and 271912 transitions. Word has length 267 [2019-09-08 08:24:37,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:24:37,381 INFO L475 AbstractCegarLoop]: Abstraction has 166156 states and 271912 transitions. [2019-09-08 08:24:37,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:24:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 166156 states and 271912 transitions. [2019-09-08 08:24:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 08:24:37,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:24:37,404 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] [2019-09-08 08:24:37,404 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:24:37,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:24:37,405 INFO L82 PathProgramCache]: Analyzing trace with hash -558026135, now seen corresponding path program 1 times [2019-09-08 08:24:37,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:24:37,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:24:37,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:24:37,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:24:37,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:24:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:24:37,802 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 08:24:37,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:24:37,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 08:24:37,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 08:24:37,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 08:24:37,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 08:24:37,804 INFO L87 Difference]: Start difference. First operand 166156 states and 271912 transitions. Second operand 13 states. [2019-09-08 08:24:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:24:59,863 INFO L93 Difference]: Finished difference Result 343052 states and 562492 transitions. [2019-09-08 08:24:59,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 08:24:59,863 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 267 [2019-09-08 08:24:59,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:25:00,557 INFO L225 Difference]: With dead ends: 343052 [2019-09-08 08:25:00,558 INFO L226 Difference]: Without dead ends: 261256 [2019-09-08 08:25:00,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1858 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1027, Invalid=4375, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 08:25:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261256 states. [2019-09-08 08:25:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261256 to 207357. [2019-09-08 08:25:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207357 states. [2019-09-08 08:25:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207357 states to 207357 states and 340554 transitions. [2019-09-08 08:25:05,851 INFO L78 Accepts]: Start accepts. Automaton has 207357 states and 340554 transitions. Word has length 267 [2019-09-08 08:25:05,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:25:05,851 INFO L475 AbstractCegarLoop]: Abstraction has 207357 states and 340554 transitions. [2019-09-08 08:25:05,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 08:25:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 207357 states and 340554 transitions. [2019-09-08 08:25:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 08:25:05,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:25:05,869 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] [2019-09-08 08:25:05,869 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:25:05,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:25:05,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2028413336, now seen corresponding path program 1 times [2019-09-08 08:25:05,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:25:05,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:25:05,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:25:05,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:25:05,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:25:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:25:06,098 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 08:25:06,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:25:06,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:25:06,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:25:06,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:25:06,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:25:06,101 INFO L87 Difference]: Start difference. First operand 207357 states and 340554 transitions. Second operand 6 states. [2019-09-08 08:25:16,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:25:16,592 INFO L93 Difference]: Finished difference Result 473772 states and 777278 transitions. [2019-09-08 08:25:16,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 08:25:16,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 267 [2019-09-08 08:25:16,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:25:17,279 INFO L225 Difference]: With dead ends: 473772 [2019-09-08 08:25:17,279 INFO L226 Difference]: Without dead ends: 266972 [2019-09-08 08:25:18,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-08 08:25:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266972 states. [2019-09-08 08:25:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266972 to 265014. [2019-09-08 08:25:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265014 states. [2019-09-08 08:25:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265014 states to 265014 states and 434801 transitions. [2019-09-08 08:25:27,545 INFO L78 Accepts]: Start accepts. Automaton has 265014 states and 434801 transitions. Word has length 267 [2019-09-08 08:25:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:25:27,546 INFO L475 AbstractCegarLoop]: Abstraction has 265014 states and 434801 transitions. [2019-09-08 08:25:27,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:25:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 265014 states and 434801 transitions. [2019-09-08 08:25:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 08:25:27,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:25:27,565 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] [2019-09-08 08:25:27,565 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:25:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:25:27,566 INFO L82 PathProgramCache]: Analyzing trace with hash 733997167, now seen corresponding path program 1 times [2019-09-08 08:25:27,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:25:27,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:25:27,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:25:27,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:25:27,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:25:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:25:27,927 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 08:25:27,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:25:27,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 08:25:27,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 08:25:27,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 08:25:27,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-08 08:25:27,929 INFO L87 Difference]: Start difference. First operand 265014 states and 434801 transitions. Second operand 14 states. [2019-09-08 08:25:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:25:57,287 INFO L93 Difference]: Finished difference Result 625090 states and 1041598 transitions. [2019-09-08 08:25:57,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-08 08:25:57,288 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 268 [2019-09-08 08:25:57,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:25:58,754 INFO L225 Difference]: With dead ends: 625090 [2019-09-08 08:25:58,755 INFO L226 Difference]: Without dead ends: 538859 [2019-09-08 08:25:58,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2394 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1287, Invalid=5355, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 08:25:59,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538859 states. [2019-09-08 08:26:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538859 to 483687. [2019-09-08 08:26:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483687 states. [2019-09-08 08:26:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483687 states to 483687 states and 797368 transitions. [2019-09-08 08:26:25,293 INFO L78 Accepts]: Start accepts. Automaton has 483687 states and 797368 transitions. Word has length 268 [2019-09-08 08:26:25,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:26:25,294 INFO L475 AbstractCegarLoop]: Abstraction has 483687 states and 797368 transitions. [2019-09-08 08:26:25,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 08:26:25,294 INFO L276 IsEmpty]: Start isEmpty. Operand 483687 states and 797368 transitions. [2019-09-08 08:26:25,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 08:26:25,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:26:25,317 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] [2019-09-08 08:26:25,317 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:26:25,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:26:25,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1599395471, now seen corresponding path program 1 times [2019-09-08 08:26:25,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:26:25,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:26:25,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:26:25,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:26:25,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:26:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:26:25,616 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 08:26:25,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:26:25,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 08:26:25,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 08:26:25,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 08:26:25,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:26:25,620 INFO L87 Difference]: Start difference. First operand 483687 states and 797368 transitions. Second operand 7 states. [2019-09-08 08:26:48,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:26:48,956 INFO L93 Difference]: Finished difference Result 959314 states and 1586094 transitions. [2019-09-08 08:26:48,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:26:48,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 268 [2019-09-08 08:26:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:26:50,457 INFO L225 Difference]: With dead ends: 959314 [2019-09-08 08:26:50,458 INFO L226 Difference]: Without dead ends: 630864 [2019-09-08 08:26:51,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:26:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630864 states. [2019-09-08 08:27:14,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630864 to 630092. [2019-09-08 08:27:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630092 states. [2019-09-08 08:27:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630092 states to 630092 states and 1039977 transitions. [2019-09-08 08:27:26,061 INFO L78 Accepts]: Start accepts. Automaton has 630092 states and 1039977 transitions. Word has length 268 [2019-09-08 08:27:26,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:27:26,062 INFO L475 AbstractCegarLoop]: Abstraction has 630092 states and 1039977 transitions. [2019-09-08 08:27:26,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 08:27:26,063 INFO L276 IsEmpty]: Start isEmpty. Operand 630092 states and 1039977 transitions. [2019-09-08 08:27:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 08:27:26,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:27:26,085 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] [2019-09-08 08:27:26,085 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:27:26,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:27:26,085 INFO L82 PathProgramCache]: Analyzing trace with hash 426435838, now seen corresponding path program 1 times [2019-09-08 08:27:26,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:27:26,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:27:26,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:26,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:27:26,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:27:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:27:26,298 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 08:27:26,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:27:26,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:27:26,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:27:26,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:27:26,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:27:26,300 INFO L87 Difference]: Start difference. First operand 630092 states and 1039977 transitions. Second operand 6 states. [2019-09-08 08:28:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:28:15,314 INFO L93 Difference]: Finished difference Result 1873862 states and 3094592 transitions. [2019-09-08 08:28:15,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:28:15,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 268 [2019-09-08 08:28:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:28:19,965 INFO L225 Difference]: With dead ends: 1873862 [2019-09-08 08:28:19,966 INFO L226 Difference]: Without dead ends: 1246819 [2019-09-08 08:28:20,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:28:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246819 states. [2019-09-08 08:29:30,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246819 to 1241064. [2019-09-08 08:29:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241064 states. [2019-09-08 08:29:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241064 states to 1241064 states and 2044928 transitions. [2019-09-08 08:29:35,219 INFO L78 Accepts]: Start accepts. Automaton has 1241064 states and 2044928 transitions. Word has length 268 [2019-09-08 08:29:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:29:35,220 INFO L475 AbstractCegarLoop]: Abstraction has 1241064 states and 2044928 transitions. [2019-09-08 08:29:35,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:29:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1241064 states and 2044928 transitions. [2019-09-08 08:29:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-08 08:29:35,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:29:35,253 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:29:35,253 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:29:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:29:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash -627700207, now seen corresponding path program 1 times [2019-09-08 08:29:35,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:29:35,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:29:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:29:35,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:29:35,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:29:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:29:35,538 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 08:29:35,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:29:35,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:29:35,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:29:35,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:29:35,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:29:35,539 INFO L87 Difference]: Start difference. First operand 1241064 states and 2044928 transitions. Second operand 6 states.