java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:46:26,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:46:26,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:46:26,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:46:26,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:46:26,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:46:26,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:46:26,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:46:26,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:46:26,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:46:26,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:46:26,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:46:26,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:46:26,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:46:26,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:46:26,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:46:26,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:46:26,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:46:26,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:46:26,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:46:26,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:46:26,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:46:26,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:46:26,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:46:26,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:46:26,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:46:26,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:46:26,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:46:26,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:46:26,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:46:26,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:46:26,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:46:26,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:46:26,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:46:26,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:46:26,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:46:26,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:46:26,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:46:26,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:46:26,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:46:26,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:46:26,125 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 09:46:26,139 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:46:26,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:46:26,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:46:26,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:46:26,141 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:46:26,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:46:26,142 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:46:26,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:46:26,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:46:26,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:46:26,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:46:26,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:46:26,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:46:26,143 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:46:26,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:46:26,143 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:46:26,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:46:26,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:46:26,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:46:26,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:46:26,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:46:26,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:46:26,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:46:26,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:46:26,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:46:26,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:46:26,145 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:46:26,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:46:26,146 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:46:26,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:46:26,194 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:46:26,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:46:26,200 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:46:26,201 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:46:26,201 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 09:46:26,285 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1dafd1f/1bd552f4038d40ad9c1978aaa6fe536b/FLAG86115cb21 [2019-09-08 09:46:26,963 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:46:26,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 09:46:26,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1dafd1f/1bd552f4038d40ad9c1978aaa6fe536b/FLAG86115cb21 [2019-09-08 09:46:27,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1dafd1f/1bd552f4038d40ad9c1978aaa6fe536b [2019-09-08 09:46:27,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:46:27,189 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:46:27,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:46:27,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:46:27,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:46:27,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:46:27" (1/1) ... [2019-09-08 09:46:27,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7babf411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:46:27, skipping insertion in model container [2019-09-08 09:46:27,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:46:27" (1/1) ... [2019-09-08 09:46:27,208 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:46:27,312 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:46:28,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:46:28,180 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:46:28,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:46:28,572 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:46:28,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:46:28 WrapperNode [2019-09-08 09:46:28,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:46:28,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:46:28,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:46:28,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:46:28,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:46:28" (1/1) ... [2019-09-08 09:46:28,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:46:28" (1/1) ... [2019-09-08 09:46:28,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:46:28" (1/1) ... [2019-09-08 09:46:28,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:46:28" (1/1) ... [2019-09-08 09:46:28,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:46:28" (1/1) ... [2019-09-08 09:46:28,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:46:28" (1/1) ... [2019-09-08 09:46:28,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:46:28" (1/1) ... [2019-09-08 09:46:28,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:46:28,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:46:28,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:46:28,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:46:28,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:46:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:46:28,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:46:28,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:46:28,823 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:46:28,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:46:28,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:46:28,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:46:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:46:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:46:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:46:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:46:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:46:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:46:28,827 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:46:28,827 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:46:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:46:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:46:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:46:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:46:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:46:31,271 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:46:31,272 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:46:31,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:46:31 BoogieIcfgContainer [2019-09-08 09:46:31,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:46:31,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:46:31,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:46:31,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:46:31,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:46:27" (1/3) ... [2019-09-08 09:46:31,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2164d204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:46:31, skipping insertion in model container [2019-09-08 09:46:31,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:46:28" (2/3) ... [2019-09-08 09:46:31,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2164d204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:46:31, skipping insertion in model container [2019-09-08 09:46:31,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:46:31" (3/3) ... [2019-09-08 09:46:31,281 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 09:46:31,291 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:46:31,311 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 09:46:31,328 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 09:46:31,368 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:46:31,369 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:46:31,369 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:46:31,369 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:46:31,369 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:46:31,370 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:46:31,370 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:46:31,370 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:46:31,370 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:46:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states. [2019-09-08 09:46:31,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 09:46:31,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:31,430 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] [2019-09-08 09:46:31,432 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:31,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:31,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1597217065, now seen corresponding path program 1 times [2019-09-08 09:46:31,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:31,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:31,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:31,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:31,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:32,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:32,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:46:32,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:46:32,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:46:32,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:46:32,920 INFO L87 Difference]: Start difference. First operand 618 states. Second operand 4 states. [2019-09-08 09:46:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:33,390 INFO L93 Difference]: Finished difference Result 1810 states and 3249 transitions. [2019-09-08 09:46:33,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:46:33,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-09-08 09:46:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:33,428 INFO L225 Difference]: With dead ends: 1810 [2019-09-08 09:46:33,429 INFO L226 Difference]: Without dead ends: 1199 [2019-09-08 09:46:33,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:46:33,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-08 09:46:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1166. [2019-09-08 09:46:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2019-09-08 09:46:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1816 transitions. [2019-09-08 09:46:33,608 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1816 transitions. Word has length 235 [2019-09-08 09:46:33,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:33,611 INFO L475 AbstractCegarLoop]: Abstraction has 1166 states and 1816 transitions. [2019-09-08 09:46:33,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:46:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1816 transitions. [2019-09-08 09:46:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 09:46:33,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:33,627 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] [2019-09-08 09:46:33,627 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:33,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:33,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1613581353, now seen corresponding path program 1 times [2019-09-08 09:46:33,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:33,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:33,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:33,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:33,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:33,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:33,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:33,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:33,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:33,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:33,986 INFO L87 Difference]: Start difference. First operand 1166 states and 1816 transitions. Second operand 3 states. [2019-09-08 09:46:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:34,197 INFO L93 Difference]: Finished difference Result 3324 states and 5150 transitions. [2019-09-08 09:46:34,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:46:34,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-09-08 09:46:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:34,215 INFO L225 Difference]: With dead ends: 3324 [2019-09-08 09:46:34,216 INFO L226 Difference]: Without dead ends: 2287 [2019-09-08 09:46:34,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2019-09-08 09:46:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2256. [2019-09-08 09:46:34,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2256 states. [2019-09-08 09:46:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3500 transitions. [2019-09-08 09:46:34,341 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3500 transitions. Word has length 237 [2019-09-08 09:46:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:34,344 INFO L475 AbstractCegarLoop]: Abstraction has 2256 states and 3500 transitions. [2019-09-08 09:46:34,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:46:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3500 transitions. [2019-09-08 09:46:34,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 09:46:34,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:34,353 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] [2019-09-08 09:46:34,354 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:34,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:34,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1404773198, now seen corresponding path program 1 times [2019-09-08 09:46:34,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:34,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:34,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:34,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:34,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:34,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:34,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:34,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:34,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:34,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:34,551 INFO L87 Difference]: Start difference. First operand 2256 states and 3500 transitions. Second operand 3 states. [2019-09-08 09:46:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:34,788 INFO L93 Difference]: Finished difference Result 6693 states and 10376 transitions. [2019-09-08 09:46:34,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:46:34,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-09-08 09:46:34,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:34,815 INFO L225 Difference]: With dead ends: 6693 [2019-09-08 09:46:34,816 INFO L226 Difference]: Without dead ends: 4479 [2019-09-08 09:46:34,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:34,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4479 states. [2019-09-08 09:46:34,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4479 to 2275. [2019-09-08 09:46:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2275 states. [2019-09-08 09:46:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 3528 transitions. [2019-09-08 09:46:35,006 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 3528 transitions. Word has length 237 [2019-09-08 09:46:35,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:35,007 INFO L475 AbstractCegarLoop]: Abstraction has 2275 states and 3528 transitions. [2019-09-08 09:46:35,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:46:35,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 3528 transitions. [2019-09-08 09:46:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 09:46:35,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:35,016 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] [2019-09-08 09:46:35,017 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:35,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:35,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1129052347, now seen corresponding path program 1 times [2019-09-08 09:46:35,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:35,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:35,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:35,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:35,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:35,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:35,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:35,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:35,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:35,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:35,171 INFO L87 Difference]: Start difference. First operand 2275 states and 3528 transitions. Second operand 3 states. [2019-09-08 09:46:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:35,470 INFO L93 Difference]: Finished difference Result 6712 states and 10397 transitions. [2019-09-08 09:46:35,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:46:35,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-09-08 09:46:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:35,493 INFO L225 Difference]: With dead ends: 6712 [2019-09-08 09:46:35,493 INFO L226 Difference]: Without dead ends: 4497 [2019-09-08 09:46:35,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4497 states. [2019-09-08 09:46:35,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4497 to 2293. [2019-09-08 09:46:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2019-09-08 09:46:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3549 transitions. [2019-09-08 09:46:35,661 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 3549 transitions. Word has length 238 [2019-09-08 09:46:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:35,662 INFO L475 AbstractCegarLoop]: Abstraction has 2293 states and 3549 transitions. [2019-09-08 09:46:35,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:46:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 3549 transitions. [2019-09-08 09:46:35,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 09:46:35,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:35,669 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] [2019-09-08 09:46:35,669 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:35,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:35,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1019398943, now seen corresponding path program 1 times [2019-09-08 09:46:35,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:35,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:35,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:35,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:35,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:35,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:35,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:46:35,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:46:35,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:46:35,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:46:35,941 INFO L87 Difference]: Start difference. First operand 2293 states and 3549 transitions. Second operand 4 states. [2019-09-08 09:46:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:36,258 INFO L93 Difference]: Finished difference Result 6388 states and 9802 transitions. [2019-09-08 09:46:36,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:46:36,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-08 09:46:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:36,283 INFO L225 Difference]: With dead ends: 6388 [2019-09-08 09:46:36,283 INFO L226 Difference]: Without dead ends: 4424 [2019-09-08 09:46:36,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:46:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4424 states. [2019-09-08 09:46:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4424 to 2500. [2019-09-08 09:46:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2019-09-08 09:46:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3902 transitions. [2019-09-08 09:46:36,521 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3902 transitions. Word has length 239 [2019-09-08 09:46:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:36,521 INFO L475 AbstractCegarLoop]: Abstraction has 2500 states and 3902 transitions. [2019-09-08 09:46:36,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:46:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3902 transitions. [2019-09-08 09:46:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 09:46:36,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:36,529 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] [2019-09-08 09:46:36,529 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:36,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:36,530 INFO L82 PathProgramCache]: Analyzing trace with hash 655104156, now seen corresponding path program 1 times [2019-09-08 09:46:36,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:36,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:36,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:36,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:36,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:36,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:36,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:36,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:36,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:36,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:36,732 INFO L87 Difference]: Start difference. First operand 2500 states and 3902 transitions. Second operand 3 states. [2019-09-08 09:46:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:37,073 INFO L93 Difference]: Finished difference Result 6722 states and 10374 transitions. [2019-09-08 09:46:37,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:46:37,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 09:46:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:37,097 INFO L225 Difference]: With dead ends: 6722 [2019-09-08 09:46:37,097 INFO L226 Difference]: Without dead ends: 4642 [2019-09-08 09:46:37,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:37,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4642 states. [2019-09-08 09:46:37,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4642 to 4613. [2019-09-08 09:46:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4613 states. [2019-09-08 09:46:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 7117 transitions. [2019-09-08 09:46:37,426 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 7117 transitions. Word has length 239 [2019-09-08 09:46:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:37,427 INFO L475 AbstractCegarLoop]: Abstraction has 4613 states and 7117 transitions. [2019-09-08 09:46:37,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:46:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 7117 transitions. [2019-09-08 09:46:37,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 09:46:37,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:37,439 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] [2019-09-08 09:46:37,439 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:37,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:37,440 INFO L82 PathProgramCache]: Analyzing trace with hash -134121780, now seen corresponding path program 1 times [2019-09-08 09:46:37,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:37,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:37,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:37,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:37,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:37,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:37,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:37,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:37,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:37,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:37,595 INFO L87 Difference]: Start difference. First operand 4613 states and 7117 transitions. Second operand 3 states. [2019-09-08 09:46:38,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:38,085 INFO L93 Difference]: Finished difference Result 12269 states and 18632 transitions. [2019-09-08 09:46:38,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:46:38,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-08 09:46:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:38,132 INFO L225 Difference]: With dead ends: 12269 [2019-09-08 09:46:38,133 INFO L226 Difference]: Without dead ends: 8459 [2019-09-08 09:46:38,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8459 states. [2019-09-08 09:46:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8459 to 4717. [2019-09-08 09:46:38,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4717 states. [2019-09-08 09:46:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4717 states to 4717 states and 7260 transitions. [2019-09-08 09:46:38,524 INFO L78 Accepts]: Start accepts. Automaton has 4717 states and 7260 transitions. Word has length 241 [2019-09-08 09:46:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:38,525 INFO L475 AbstractCegarLoop]: Abstraction has 4717 states and 7260 transitions. [2019-09-08 09:46:38,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:46:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 4717 states and 7260 transitions. [2019-09-08 09:46:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 09:46:38,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:38,537 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] [2019-09-08 09:46:38,538 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:38,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:38,538 INFO L82 PathProgramCache]: Analyzing trace with hash -98518151, now seen corresponding path program 1 times [2019-09-08 09:46:38,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:38,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:38,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:38,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:38,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:38,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:38,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:38,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:38,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:38,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:38,659 INFO L87 Difference]: Start difference. First operand 4717 states and 7260 transitions. Second operand 3 states. [2019-09-08 09:46:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:39,072 INFO L93 Difference]: Finished difference Result 12401 states and 18798 transitions. [2019-09-08 09:46:39,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:46:39,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-09-08 09:46:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:39,096 INFO L225 Difference]: With dead ends: 12401 [2019-09-08 09:46:39,097 INFO L226 Difference]: Without dead ends: 8584 [2019-09-08 09:46:39,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8584 states. [2019-09-08 09:46:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8584 to 4842. [2019-09-08 09:46:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4842 states. [2019-09-08 09:46:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4842 states to 4842 states and 7406 transitions. [2019-09-08 09:46:39,478 INFO L78 Accepts]: Start accepts. Automaton has 4842 states and 7406 transitions. Word has length 242 [2019-09-08 09:46:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:39,478 INFO L475 AbstractCegarLoop]: Abstraction has 4842 states and 7406 transitions. [2019-09-08 09:46:39,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:46:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand 4842 states and 7406 transitions. [2019-09-08 09:46:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 09:46:39,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:39,491 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] [2019-09-08 09:46:39,492 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:39,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1709942343, now seen corresponding path program 1 times [2019-09-08 09:46:39,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:39,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:39,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:39,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:39,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:39,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:39,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:46:39,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:46:39,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:46:39,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:46:39,788 INFO L87 Difference]: Start difference. First operand 4842 states and 7406 transitions. Second operand 5 states. [2019-09-08 09:46:40,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:40,885 INFO L93 Difference]: Finished difference Result 9726 states and 14917 transitions. [2019-09-08 09:46:40,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:46:40,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2019-09-08 09:46:40,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:40,901 INFO L225 Difference]: With dead ends: 9726 [2019-09-08 09:46:40,901 INFO L226 Difference]: Without dead ends: 6820 [2019-09-08 09:46:40,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:46:40,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6820 states. [2019-09-08 09:46:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6820 to 6818. [2019-09-08 09:46:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6818 states. [2019-09-08 09:46:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6818 states to 6818 states and 10426 transitions. [2019-09-08 09:46:41,333 INFO L78 Accepts]: Start accepts. Automaton has 6818 states and 10426 transitions. Word has length 243 [2019-09-08 09:46:41,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:41,334 INFO L475 AbstractCegarLoop]: Abstraction has 6818 states and 10426 transitions. [2019-09-08 09:46:41,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:46:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 6818 states and 10426 transitions. [2019-09-08 09:46:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 09:46:41,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:41,349 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] [2019-09-08 09:46:41,349 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:41,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:41,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1091040623, now seen corresponding path program 1 times [2019-09-08 09:46:41,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:41,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:41,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:41,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:41,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:42,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:42,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:46:42,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:46:42,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:46:42,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:46:42,330 INFO L87 Difference]: Start difference. First operand 6818 states and 10426 transitions. Second operand 17 states. [2019-09-08 09:46:45,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:45,394 INFO L93 Difference]: Finished difference Result 12320 states and 18833 transitions. [2019-09-08 09:46:45,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 09:46:45,399 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 243 [2019-09-08 09:46:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:45,429 INFO L225 Difference]: With dead ends: 12320 [2019-09-08 09:46:45,429 INFO L226 Difference]: Without dead ends: 11194 [2019-09-08 09:46:45,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=315, Invalid=945, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 09:46:45,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11194 states. [2019-09-08 09:46:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11194 to 7698. [2019-09-08 09:46:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7698 states. [2019-09-08 09:46:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7698 states to 7698 states and 11662 transitions. [2019-09-08 09:46:46,128 INFO L78 Accepts]: Start accepts. Automaton has 7698 states and 11662 transitions. Word has length 243 [2019-09-08 09:46:46,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:46,129 INFO L475 AbstractCegarLoop]: Abstraction has 7698 states and 11662 transitions. [2019-09-08 09:46:46,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:46:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 7698 states and 11662 transitions. [2019-09-08 09:46:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 09:46:46,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:46,150 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] [2019-09-08 09:46:46,151 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:46,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:46,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2061385505, now seen corresponding path program 1 times [2019-09-08 09:46:46,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:46,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:46,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:46,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:46,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:46,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:46,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:46:46,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:46:46,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:46:46,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:46:46,544 INFO L87 Difference]: Start difference. First operand 7698 states and 11662 transitions. Second operand 4 states. [2019-09-08 09:46:47,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:47,749 INFO L93 Difference]: Finished difference Result 22466 states and 33998 transitions. [2019-09-08 09:46:47,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:46:47,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-09-08 09:46:47,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:47,790 INFO L225 Difference]: With dead ends: 22466 [2019-09-08 09:46:47,790 INFO L226 Difference]: Without dead ends: 14840 [2019-09-08 09:46:47,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:46:47,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14840 states. [2019-09-08 09:46:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14840 to 14815. [2019-09-08 09:46:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14815 states. [2019-09-08 09:46:49,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14815 states to 14815 states and 22275 transitions. [2019-09-08 09:46:49,068 INFO L78 Accepts]: Start accepts. Automaton has 14815 states and 22275 transitions. Word has length 243 [2019-09-08 09:46:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:49,068 INFO L475 AbstractCegarLoop]: Abstraction has 14815 states and 22275 transitions. [2019-09-08 09:46:49,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:46:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 14815 states and 22275 transitions. [2019-09-08 09:46:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 09:46:49,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:49,093 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 09:46:49,093 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:49,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1532797198, now seen corresponding path program 1 times [2019-09-08 09:46:49,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:49,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:49,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:49,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:49,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:49,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:49,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:49,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:49,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:49,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:49,262 INFO L87 Difference]: Start difference. First operand 14815 states and 22275 transitions. Second operand 3 states. [2019-09-08 09:46:50,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:50,580 INFO L93 Difference]: Finished difference Result 41912 states and 62587 transitions. [2019-09-08 09:46:50,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:46:50,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-08 09:46:50,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:50,630 INFO L225 Difference]: With dead ends: 41912 [2019-09-08 09:46:50,630 INFO L226 Difference]: Without dead ends: 28586 [2019-09-08 09:46:50,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28586 states. [2019-09-08 09:46:52,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28586 to 28563. [2019-09-08 09:46:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28563 states. [2019-09-08 09:46:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28563 states to 28563 states and 42534 transitions. [2019-09-08 09:46:52,479 INFO L78 Accepts]: Start accepts. Automaton has 28563 states and 42534 transitions. Word has length 245 [2019-09-08 09:46:52,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:52,480 INFO L475 AbstractCegarLoop]: Abstraction has 28563 states and 42534 transitions. [2019-09-08 09:46:52,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:46:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 28563 states and 42534 transitions. [2019-09-08 09:46:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 09:46:52,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:52,518 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 09:46:52,518 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:52,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:52,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1332769017, now seen corresponding path program 1 times [2019-09-08 09:46:52,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:52,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:52,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:52,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:52,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:52,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:46:52,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:46:52,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:46:52,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:46:52,839 INFO L87 Difference]: Start difference. First operand 28563 states and 42534 transitions. Second operand 4 states. [2019-09-08 09:46:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:56,255 INFO L93 Difference]: Finished difference Result 82855 states and 123128 transitions. [2019-09-08 09:46:56,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:46:56,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-09-08 09:46:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:56,340 INFO L225 Difference]: With dead ends: 82855 [2019-09-08 09:46:56,340 INFO L226 Difference]: Without dead ends: 56549 [2019-09-08 09:46:56,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:46:56,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56549 states. [2019-09-08 09:46:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56549 to 30243. [2019-09-08 09:46:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30243 states. [2019-09-08 09:46:58,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30243 states to 30243 states and 45304 transitions. [2019-09-08 09:46:58,447 INFO L78 Accepts]: Start accepts. Automaton has 30243 states and 45304 transitions. Word has length 245 [2019-09-08 09:46:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:58,447 INFO L475 AbstractCegarLoop]: Abstraction has 30243 states and 45304 transitions. [2019-09-08 09:46:58,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:46:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 30243 states and 45304 transitions. [2019-09-08 09:46:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 09:46:58,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:58,470 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 09:46:58,471 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:58,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:58,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1584462879, now seen corresponding path program 1 times [2019-09-08 09:46:58,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:58,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:58,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:58,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:58,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:58,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:58,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:58,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:58,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:58,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:58,661 INFO L87 Difference]: Start difference. First operand 30243 states and 45304 transitions. Second operand 3 states. [2019-09-08 09:47:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:02,689 INFO L93 Difference]: Finished difference Result 86528 states and 128974 transitions. [2019-09-08 09:47:02,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:02,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-08 09:47:02,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:02,768 INFO L225 Difference]: With dead ends: 86528 [2019-09-08 09:47:02,768 INFO L226 Difference]: Without dead ends: 58845 [2019-09-08 09:47:02,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:02,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58845 states. [2019-09-08 09:47:06,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58845 to 58824. [2019-09-08 09:47:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58824 states. [2019-09-08 09:47:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58824 states to 58824 states and 87435 transitions. [2019-09-08 09:47:06,266 INFO L78 Accepts]: Start accepts. Automaton has 58824 states and 87435 transitions. Word has length 245 [2019-09-08 09:47:06,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:06,267 INFO L475 AbstractCegarLoop]: Abstraction has 58824 states and 87435 transitions. [2019-09-08 09:47:06,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 58824 states and 87435 transitions. [2019-09-08 09:47:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 09:47:06,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:06,321 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 09:47:06,321 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:06,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:06,322 INFO L82 PathProgramCache]: Analyzing trace with hash -515565086, now seen corresponding path program 1 times [2019-09-08 09:47:06,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:06,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:06,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:06,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:06,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:47:06,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:06,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:47:06,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:47:06,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:47:06,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:47:06,598 INFO L87 Difference]: Start difference. First operand 58824 states and 87435 transitions. Second operand 4 states. [2019-09-08 09:47:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:09,968 INFO L93 Difference]: Finished difference Result 104594 states and 154437 transitions. [2019-09-08 09:47:09,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:47:09,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-09-08 09:47:09,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:10,038 INFO L225 Difference]: With dead ends: 104594 [2019-09-08 09:47:10,039 INFO L226 Difference]: Without dead ends: 52816 [2019-09-08 09:47:10,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:47:10,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52816 states. [2019-09-08 09:47:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52816 to 52356. [2019-09-08 09:47:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52356 states. [2019-09-08 09:47:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52356 states to 52356 states and 77765 transitions. [2019-09-08 09:47:14,584 INFO L78 Accepts]: Start accepts. Automaton has 52356 states and 77765 transitions. Word has length 245 [2019-09-08 09:47:14,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:14,584 INFO L475 AbstractCegarLoop]: Abstraction has 52356 states and 77765 transitions. [2019-09-08 09:47:14,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:47:14,584 INFO L276 IsEmpty]: Start isEmpty. Operand 52356 states and 77765 transitions. [2019-09-08 09:47:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 09:47:14,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:14,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:47:14,621 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:14,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:14,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1615424582, now seen corresponding path program 1 times [2019-09-08 09:47:14,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:14,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:14,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:14,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:14,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:14,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:47:14,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:14,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:47:14,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:47:14,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:47:14,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:47:14,860 INFO L87 Difference]: Start difference. First operand 52356 states and 77765 transitions. Second operand 4 states. [2019-09-08 09:47:19,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:19,847 INFO L93 Difference]: Finished difference Result 133461 states and 196486 transitions. [2019-09-08 09:47:19,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:47:19,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2019-09-08 09:47:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:19,946 INFO L225 Difference]: With dead ends: 133461 [2019-09-08 09:47:19,946 INFO L226 Difference]: Without dead ends: 86360 [2019-09-08 09:47:19,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:47:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86360 states. [2019-09-08 09:47:24,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86360 to 51678. [2019-09-08 09:47:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51678 states. [2019-09-08 09:47:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51678 states to 51678 states and 76762 transitions. [2019-09-08 09:47:24,918 INFO L78 Accepts]: Start accepts. Automaton has 51678 states and 76762 transitions. Word has length 247 [2019-09-08 09:47:24,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:24,918 INFO L475 AbstractCegarLoop]: Abstraction has 51678 states and 76762 transitions. [2019-09-08 09:47:24,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:47:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 51678 states and 76762 transitions. [2019-09-08 09:47:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 09:47:24,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:24,960 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:47:24,961 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:24,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:24,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2065076026, now seen corresponding path program 1 times [2019-09-08 09:47:24,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:24,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:24,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:24,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:24,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:47:25,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:25,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:25,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:25,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:25,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:25,082 INFO L87 Difference]: Start difference. First operand 51678 states and 76762 transitions. Second operand 3 states. [2019-09-08 09:47:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:30,277 INFO L93 Difference]: Finished difference Result 129566 states and 190764 transitions. [2019-09-08 09:47:30,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:30,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-09-08 09:47:30,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:30,378 INFO L225 Difference]: With dead ends: 129566 [2019-09-08 09:47:30,378 INFO L226 Difference]: Without dead ends: 86844 [2019-09-08 09:47:30,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:30,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86844 states. [2019-09-08 09:47:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86844 to 52329. [2019-09-08 09:47:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52329 states. [2019-09-08 09:47:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52329 states to 52329 states and 77526 transitions. [2019-09-08 09:47:35,502 INFO L78 Accepts]: Start accepts. Automaton has 52329 states and 77526 transitions. Word has length 250 [2019-09-08 09:47:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:35,502 INFO L475 AbstractCegarLoop]: Abstraction has 52329 states and 77526 transitions. [2019-09-08 09:47:35,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 52329 states and 77526 transitions. [2019-09-08 09:47:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 09:47:35,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:35,538 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] [2019-09-08 09:47:35,539 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:35,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:35,539 INFO L82 PathProgramCache]: Analyzing trace with hash 330031223, now seen corresponding path program 1 times [2019-09-08 09:47:35,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:35,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:35,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:35,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:35,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:47:35,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:35,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:47:35,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:47:35,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:47:35,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:47:35,773 INFO L87 Difference]: Start difference. First operand 52329 states and 77526 transitions. Second operand 4 states. [2019-09-08 09:47:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:38,882 INFO L93 Difference]: Finished difference Result 91032 states and 134031 transitions. [2019-09-08 09:47:38,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:47:38,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-09-08 09:47:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:38,935 INFO L225 Difference]: With dead ends: 91032 [2019-09-08 09:47:38,935 INFO L226 Difference]: Without dead ends: 47163 [2019-09-08 09:47:38,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:47:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47163 states. [2019-09-08 09:47:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47163 to 46688. [2019-09-08 09:47:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46688 states. [2019-09-08 09:47:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46688 states to 46688 states and 69232 transitions. [2019-09-08 09:47:43,380 INFO L78 Accepts]: Start accepts. Automaton has 46688 states and 69232 transitions. Word has length 251 [2019-09-08 09:47:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:43,380 INFO L475 AbstractCegarLoop]: Abstraction has 46688 states and 69232 transitions. [2019-09-08 09:47:43,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:47:43,380 INFO L276 IsEmpty]: Start isEmpty. Operand 46688 states and 69232 transitions. [2019-09-08 09:47:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 09:47:43,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:43,415 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] [2019-09-08 09:47:43,415 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:43,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:43,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1968231149, now seen corresponding path program 1 times [2019-09-08 09:47:43,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:43,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:43,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:43,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:43,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:47:43,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:43,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:47:43,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:47:43,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:47:43,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:47:43,878 INFO L87 Difference]: Start difference. First operand 46688 states and 69232 transitions. Second operand 4 states. [2019-09-08 09:47:49,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:49,445 INFO L93 Difference]: Finished difference Result 129024 states and 190589 transitions. [2019-09-08 09:47:49,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:47:49,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-09-08 09:47:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:49,536 INFO L225 Difference]: With dead ends: 129024 [2019-09-08 09:47:49,536 INFO L226 Difference]: Without dead ends: 82869 [2019-09-08 09:47:49,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:47:49,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82869 states. [2019-09-08 09:47:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82869 to 82852. [2019-09-08 09:47:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82852 states. [2019-09-08 09:47:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82852 states to 82852 states and 121447 transitions. [2019-09-08 09:47:55,496 INFO L78 Accepts]: Start accepts. Automaton has 82852 states and 121447 transitions. Word has length 251 [2019-09-08 09:47:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:55,496 INFO L475 AbstractCegarLoop]: Abstraction has 82852 states and 121447 transitions. [2019-09-08 09:47:55,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:47:55,496 INFO L276 IsEmpty]: Start isEmpty. Operand 82852 states and 121447 transitions. [2019-09-08 09:47:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 09:47:55,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:55,576 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 09:47:55,576 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:55,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:55,577 INFO L82 PathProgramCache]: Analyzing trace with hash 395400033, now seen corresponding path program 1 times [2019-09-08 09:47:55,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:55,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:55,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:55,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:55,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:47:55,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:55,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:55,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:55,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:55,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:55,759 INFO L87 Difference]: Start difference. First operand 82852 states and 121447 transitions. Second operand 3 states. [2019-09-08 09:48:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:07,785 INFO L93 Difference]: Finished difference Result 230778 states and 336235 transitions. [2019-09-08 09:48:07,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:48:07,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-08 09:48:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:07,973 INFO L225 Difference]: With dead ends: 230778 [2019-09-08 09:48:07,974 INFO L226 Difference]: Without dead ends: 156143 [2019-09-08 09:48:08,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:08,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156143 states. [2019-09-08 09:48:22,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156143 to 155796. [2019-09-08 09:48:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155796 states. [2019-09-08 09:48:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155796 states to 155796 states and 226064 transitions. [2019-09-08 09:48:22,307 INFO L78 Accepts]: Start accepts. Automaton has 155796 states and 226064 transitions. Word has length 253 [2019-09-08 09:48:22,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:22,307 INFO L475 AbstractCegarLoop]: Abstraction has 155796 states and 226064 transitions. [2019-09-08 09:48:22,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:48:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 155796 states and 226064 transitions. [2019-09-08 09:48:22,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 09:48:22,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:22,440 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] [2019-09-08 09:48:22,440 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:22,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2007197606, now seen corresponding path program 1 times [2019-09-08 09:48:22,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:22,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:22,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:22,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:22,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:48:22,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:22,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:48:22,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:48:22,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:48:22,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:22,631 INFO L87 Difference]: Start difference. First operand 155796 states and 226064 transitions. Second operand 3 states. [2019-09-08 09:48:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:43,131 INFO L93 Difference]: Finished difference Result 436324 states and 630191 transitions. [2019-09-08 09:48:43,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:48:43,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-09-08 09:48:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:43,568 INFO L225 Difference]: With dead ends: 436324 [2019-09-08 09:48:43,569 INFO L226 Difference]: Without dead ends: 296056 [2019-09-08 09:48:43,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:43,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296056 states. [2019-09-08 09:49:10,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296056 to 296043. [2019-09-08 09:49:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296043 states. [2019-09-08 09:49:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296043 states to 296043 states and 425686 transitions. [2019-09-08 09:49:15,417 INFO L78 Accepts]: Start accepts. Automaton has 296043 states and 425686 transitions. Word has length 255 [2019-09-08 09:49:15,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:15,417 INFO L475 AbstractCegarLoop]: Abstraction has 296043 states and 425686 transitions. [2019-09-08 09:49:15,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:49:15,417 INFO L276 IsEmpty]: Start isEmpty. Operand 296043 states and 425686 transitions. [2019-09-08 09:49:15,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 09:49:15,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:15,643 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] [2019-09-08 09:49:15,643 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:15,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:15,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2079589877, now seen corresponding path program 1 times [2019-09-08 09:49:15,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:15,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:15,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:15,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:15,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:49:15,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:49:15,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:49:15,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:49:15,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:49:15,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:49:15,755 INFO L87 Difference]: Start difference. First operand 296043 states and 425686 transitions. Second operand 3 states. [2019-09-08 09:49:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:57,912 INFO L93 Difference]: Finished difference Result 746430 states and 1066630 transitions. [2019-09-08 09:49:57,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:49:57,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-09-08 09:49:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:58,608 INFO L225 Difference]: With dead ends: 746430 [2019-09-08 09:49:58,608 INFO L226 Difference]: Without dead ends: 494043 [2019-09-08 09:49:58,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:49:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494043 states. [2019-09-08 09:50:29,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494043 to 295503. [2019-09-08 09:50:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295503 states. [2019-09-08 09:50:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295503 states to 295503 states and 424088 transitions. [2019-09-08 09:50:30,745 INFO L78 Accepts]: Start accepts. Automaton has 295503 states and 424088 transitions. Word has length 258 [2019-09-08 09:50:30,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:30,746 INFO L475 AbstractCegarLoop]: Abstraction has 295503 states and 424088 transitions. [2019-09-08 09:50:30,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:50:30,746 INFO L276 IsEmpty]: Start isEmpty. Operand 295503 states and 424088 transitions. [2019-09-08 09:50:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 09:50:30,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:30,991 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] [2019-09-08 09:50:30,992 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:30,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:30,992 INFO L82 PathProgramCache]: Analyzing trace with hash -833471595, now seen corresponding path program 1 times [2019-09-08 09:50:30,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:30,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:30,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:30,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:30,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:50:31,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:31,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:50:31,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:50:31,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:50:31,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:50:31,390 INFO L87 Difference]: Start difference. First operand 295503 states and 424088 transitions. Second operand 4 states. [2019-09-08 09:51:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:26,669 INFO L93 Difference]: Finished difference Result 867820 states and 1241750 transitions. [2019-09-08 09:51:26,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:26,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2019-09-08 09:51:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:27,465 INFO L225 Difference]: With dead ends: 867820 [2019-09-08 09:51:27,466 INFO L226 Difference]: Without dead ends: 572900 [2019-09-08 09:51:27,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:51:28,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572900 states. [2019-09-08 09:52:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572900 to 569458. [2019-09-08 09:52:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569458 states. [2019-09-08 09:52:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569458 states to 569458 states and 808680 transitions. [2019-09-08 09:52:28,723 INFO L78 Accepts]: Start accepts. Automaton has 569458 states and 808680 transitions. Word has length 259 [2019-09-08 09:52:28,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:28,723 INFO L475 AbstractCegarLoop]: Abstraction has 569458 states and 808680 transitions. [2019-09-08 09:52:28,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:52:28,723 INFO L276 IsEmpty]: Start isEmpty. Operand 569458 states and 808680 transitions. [2019-09-08 09:52:29,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 09:52:29,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:29,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] [2019-09-08 09:52:29,317 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:29,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:29,317 INFO L82 PathProgramCache]: Analyzing trace with hash 74483756, now seen corresponding path program 1 times [2019-09-08 09:52:29,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:29,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:29,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:29,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:29,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:29,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 09:52:29,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:29,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:29,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:29,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:29,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:29,501 INFO L87 Difference]: Start difference. First operand 569458 states and 808680 transitions. Second operand 3 states. [2019-09-08 09:54:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:19,332 INFO L93 Difference]: Finished difference Result 1670866 states and 2363719 transitions. [2019-09-08 09:54:19,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:19,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-09-08 09:54:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:21,789 INFO L225 Difference]: With dead ends: 1670866 [2019-09-08 09:54:21,790 INFO L226 Difference]: Without dead ends: 1115690 [2019-09-08 09:54:22,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115690 states. [2019-09-08 09:56:36,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115690 to 1112248. [2019-09-08 09:56:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112248 states. [2019-09-08 09:56:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112248 states to 1112248 states and 1563981 transitions. [2019-09-08 09:56:39,270 INFO L78 Accepts]: Start accepts. Automaton has 1112248 states and 1563981 transitions. Word has length 261 [2019-09-08 09:56:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:39,270 INFO L475 AbstractCegarLoop]: Abstraction has 1112248 states and 1563981 transitions. [2019-09-08 09:56:39,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:56:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1112248 states and 1563981 transitions. [2019-09-08 09:56:40,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 09:56:40,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:40,277 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 09:56:40,277 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:40,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:40,278 INFO L82 PathProgramCache]: Analyzing trace with hash 678056007, now seen corresponding path program 1 times [2019-09-08 09:56:40,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:40,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:40,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:40,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:40,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:56:40,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:40,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:56:40,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:56:40,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:56:40,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:40,391 INFO L87 Difference]: Start difference. First operand 1112248 states and 1563981 transitions. Second operand 3 states.