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_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:31:14,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:31:14,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:31:14,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:31:14,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:31:14,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:31:14,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:31:14,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:31:14,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:31:14,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:31:14,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:31:14,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:31:14,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:31:14,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:31:14,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:31:14,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:31:14,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:31:14,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:31:14,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:31:14,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:31:14,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:31:14,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:31:14,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:31:14,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:31:14,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:31:14,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:31:14,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:31:14,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:31:14,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:31:14,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:31:14,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:31:14,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:31:14,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:31:14,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:31:14,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:31:14,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:31:14,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:31:14,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:31:14,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:31:14,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:31:14,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:31:14,236 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 13:31:14,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:31:14,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:31:14,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:31:14,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:31:14,252 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:31:14,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:31:14,253 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:31:14,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:31:14,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:31:14,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:31:14,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:31:14,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:31:14,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:31:14,254 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:31:14,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:31:14,254 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:31:14,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:31:14,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:31:14,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:31:14,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:31:14,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:31:14,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:31:14,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:31:14,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:31:14,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:31:14,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:31:14,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:31:14,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:31:14,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:31:14,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:31:14,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:31:14,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:31:14,301 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:31:14,302 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:31:14,302 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 13:31:14,361 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7397371b5/69bf3bf4ed5b4473abfc2a130f26777c/FLAGe6175f7f9 [2019-09-08 13:31:15,006 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:31:15,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 13:31:15,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7397371b5/69bf3bf4ed5b4473abfc2a130f26777c/FLAGe6175f7f9 [2019-09-08 13:31:15,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7397371b5/69bf3bf4ed5b4473abfc2a130f26777c [2019-09-08 13:31:15,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:31:15,191 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:31:15,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:31:15,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:31:15,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:31:15,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:31:15" (1/1) ... [2019-09-08 13:31:15,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aac0b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:15, skipping insertion in model container [2019-09-08 13:31:15,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:31:15" (1/1) ... [2019-09-08 13:31:15,207 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:31:15,360 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:31:16,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:31:16,564 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:31:17,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:31:17,371 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:31:17,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:17 WrapperNode [2019-09-08 13:31:17,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:31:17,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:31:17,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:31:17,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:31:17,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:17" (1/1) ... [2019-09-08 13:31:17,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:17" (1/1) ... [2019-09-08 13:31:17,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:17" (1/1) ... [2019-09-08 13:31:17,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:17" (1/1) ... [2019-09-08 13:31:17,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:17" (1/1) ... [2019-09-08 13:31:17,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:17" (1/1) ... [2019-09-08 13:31:17,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:17" (1/1) ... [2019-09-08 13:31:17,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:31:17,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:31:17,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:31:17,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:31:17,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:17" (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 13:31:17,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:31:17,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:31:17,722 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:31:17,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:31:17,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:31:17,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:31:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:31:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:31:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:31:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:31:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:31:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:31:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:31:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:31:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 13:31:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:31:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:31:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:31:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:31:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:31:22,019 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:31:22,020 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:31:22,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:31:22 BoogieIcfgContainer [2019-09-08 13:31:22,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:31:22,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:31:22,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:31:22,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:31:22,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:31:15" (1/3) ... [2019-09-08 13:31:22,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d639b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:31:22, skipping insertion in model container [2019-09-08 13:31:22,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:17" (2/3) ... [2019-09-08 13:31:22,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d639b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:31:22, skipping insertion in model container [2019-09-08 13:31:22,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:31:22" (3/3) ... [2019-09-08 13:31:22,029 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 13:31:22,039 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:31:22,048 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:31:22,066 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:31:22,104 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:31:22,105 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:31:22,105 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:31:22,105 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:31:22,105 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:31:22,106 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:31:22,106 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:31:22,106 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:31:22,106 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:31:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states. [2019-09-08 13:31:22,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-08 13:31:22,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:22,183 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:22,186 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:22,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:22,192 INFO L82 PathProgramCache]: Analyzing trace with hash 822825100, now seen corresponding path program 1 times [2019-09-08 13:31:22,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:22,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:22,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:22,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:22,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:23,234 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 13:31:23,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:23,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:23,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:23,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:23,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:23,262 INFO L87 Difference]: Start difference. First operand 1529 states. Second operand 3 states. [2019-09-08 13:31:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:23,574 INFO L93 Difference]: Finished difference Result 3055 states and 5327 transitions. [2019-09-08 13:31:23,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:23,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-08 13:31:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:23,612 INFO L225 Difference]: With dead ends: 3055 [2019-09-08 13:31:23,613 INFO L226 Difference]: Without dead ends: 2116 [2019-09-08 13:31:23,626 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 13:31:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-09-08 13:31:23,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 2114. [2019-09-08 13:31:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-09-08 13:31:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3545 transitions. [2019-09-08 13:31:23,826 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3545 transitions. Word has length 376 [2019-09-08 13:31:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:23,831 INFO L475 AbstractCegarLoop]: Abstraction has 2114 states and 3545 transitions. [2019-09-08 13:31:23,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3545 transitions. [2019-09-08 13:31:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-08 13:31:23,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:23,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:23,852 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:23,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:23,854 INFO L82 PathProgramCache]: Analyzing trace with hash 724616216, now seen corresponding path program 1 times [2019-09-08 13:31:23,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:23,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:23,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:23,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:23,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:24,256 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 13:31:24,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:24,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:24,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:24,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:24,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:24,261 INFO L87 Difference]: Start difference. First operand 2114 states and 3545 transitions. Second operand 3 states. [2019-09-08 13:31:24,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:24,429 INFO L93 Difference]: Finished difference Result 4604 states and 7621 transitions. [2019-09-08 13:31:24,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:24,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-08 13:31:24,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:24,453 INFO L225 Difference]: With dead ends: 4604 [2019-09-08 13:31:24,454 INFO L226 Difference]: Without dead ends: 3116 [2019-09-08 13:31:24,459 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 13:31:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2019-09-08 13:31:24,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3114. [2019-09-08 13:31:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2019-09-08 13:31:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 5172 transitions. [2019-09-08 13:31:24,658 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 5172 transitions. Word has length 376 [2019-09-08 13:31:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:24,661 INFO L475 AbstractCegarLoop]: Abstraction has 3114 states and 5172 transitions. [2019-09-08 13:31:24,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 5172 transitions. [2019-09-08 13:31:24,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-08 13:31:24,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:24,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:24,680 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:24,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:24,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1055361571, now seen corresponding path program 1 times [2019-09-08 13:31:24,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:24,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:24,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:24,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:24,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:25,164 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 13:31:25,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:25,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:25,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:25,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:25,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:25,166 INFO L87 Difference]: Start difference. First operand 3114 states and 5172 transitions. Second operand 3 states. [2019-09-08 13:31:25,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:25,405 INFO L93 Difference]: Finished difference Result 7172 states and 11788 transitions. [2019-09-08 13:31:25,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:25,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-08 13:31:25,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:25,436 INFO L225 Difference]: With dead ends: 7172 [2019-09-08 13:31:25,437 INFO L226 Difference]: Without dead ends: 4750 [2019-09-08 13:31:25,454 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 13:31:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4750 states. [2019-09-08 13:31:25,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4750 to 4748. [2019-09-08 13:31:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4748 states. [2019-09-08 13:31:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4748 states and 7817 transitions. [2019-09-08 13:31:25,726 INFO L78 Accepts]: Start accepts. Automaton has 4748 states and 7817 transitions. Word has length 376 [2019-09-08 13:31:25,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:25,727 INFO L475 AbstractCegarLoop]: Abstraction has 4748 states and 7817 transitions. [2019-09-08 13:31:25,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:25,727 INFO L276 IsEmpty]: Start isEmpty. Operand 4748 states and 7817 transitions. [2019-09-08 13:31:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-08 13:31:25,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:25,742 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:25,742 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:25,743 INFO L82 PathProgramCache]: Analyzing trace with hash -991064276, now seen corresponding path program 1 times [2019-09-08 13:31:25,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:25,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:25,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:25,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:25,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:26,165 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 13:31:26,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:26,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:31:26,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:31:26,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:31:26,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:31:26,168 INFO L87 Difference]: Start difference. First operand 4748 states and 7817 transitions. Second operand 4 states. [2019-09-08 13:31:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:26,552 INFO L93 Difference]: Finished difference Result 7942 states and 13172 transitions. [2019-09-08 13:31:26,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:31:26,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 376 [2019-09-08 13:31:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:26,588 INFO L225 Difference]: With dead ends: 7942 [2019-09-08 13:31:26,589 INFO L226 Difference]: Without dead ends: 6652 [2019-09-08 13:31:26,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:31:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6652 states. [2019-09-08 13:31:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6652 to 5324. [2019-09-08 13:31:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5324 states. [2019-09-08 13:31:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5324 states to 5324 states and 8793 transitions. [2019-09-08 13:31:26,865 INFO L78 Accepts]: Start accepts. Automaton has 5324 states and 8793 transitions. Word has length 376 [2019-09-08 13:31:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:26,866 INFO L475 AbstractCegarLoop]: Abstraction has 5324 states and 8793 transitions. [2019-09-08 13:31:26,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:31:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 5324 states and 8793 transitions. [2019-09-08 13:31:26,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-08 13:31:26,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:26,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:26,882 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:26,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:26,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1954837219, now seen corresponding path program 1 times [2019-09-08 13:31:26,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:26,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:26,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:26,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:26,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:27,653 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 13:31:27,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:27,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:27,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:27,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:27,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:27,655 INFO L87 Difference]: Start difference. First operand 5324 states and 8793 transitions. Second operand 3 states. [2019-09-08 13:31:28,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:28,120 INFO L93 Difference]: Finished difference Result 9572 states and 15923 transitions. [2019-09-08 13:31:28,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:28,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-08 13:31:28,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:28,161 INFO L225 Difference]: With dead ends: 9572 [2019-09-08 13:31:28,161 INFO L226 Difference]: Without dead ends: 7706 [2019-09-08 13:31:28,168 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 13:31:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7706 states. [2019-09-08 13:31:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7706 to 7704. [2019-09-08 13:31:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7704 states. [2019-09-08 13:31:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7704 states to 7704 states and 12741 transitions. [2019-09-08 13:31:28,556 INFO L78 Accepts]: Start accepts. Automaton has 7704 states and 12741 transitions. Word has length 376 [2019-09-08 13:31:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:28,557 INFO L475 AbstractCegarLoop]: Abstraction has 7704 states and 12741 transitions. [2019-09-08 13:31:28,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 7704 states and 12741 transitions. [2019-09-08 13:31:28,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-08 13:31:28,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:28,573 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:28,574 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:28,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:28,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1152448316, now seen corresponding path program 1 times [2019-09-08 13:31:28,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:28,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:28,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:28,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:28,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:29,157 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 13:31:29,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:29,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:31:29,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:31:29,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:31:29,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:31:29,159 INFO L87 Difference]: Start difference. First operand 7704 states and 12741 transitions. Second operand 5 states. [2019-09-08 13:31:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:30,069 INFO L93 Difference]: Finished difference Result 23200 states and 38713 transitions. [2019-09-08 13:31:30,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:31:30,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 377 [2019-09-08 13:31:30,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:30,120 INFO L225 Difference]: With dead ends: 23200 [2019-09-08 13:31:30,120 INFO L226 Difference]: Without dead ends: 19626 [2019-09-08 13:31:30,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 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 13:31:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19626 states. [2019-09-08 13:31:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19626 to 15020. [2019-09-08 13:31:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15020 states. [2019-09-08 13:31:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15020 states to 15020 states and 24961 transitions. [2019-09-08 13:31:31,044 INFO L78 Accepts]: Start accepts. Automaton has 15020 states and 24961 transitions. Word has length 377 [2019-09-08 13:31:31,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:31,045 INFO L475 AbstractCegarLoop]: Abstraction has 15020 states and 24961 transitions. [2019-09-08 13:31:31,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:31:31,046 INFO L276 IsEmpty]: Start isEmpty. Operand 15020 states and 24961 transitions. [2019-09-08 13:31:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-09-08 13:31:31,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:31,064 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:31,065 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:31,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:31,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1738520537, now seen corresponding path program 1 times [2019-09-08 13:31:31,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:31,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:31,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:31,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:31,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:32,019 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 13:31:32,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:32,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:31:32,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:31:32,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:31:32,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:31:32,022 INFO L87 Difference]: Start difference. First operand 15020 states and 24961 transitions. Second operand 4 states. [2019-09-08 13:31:33,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:33,002 INFO L93 Difference]: Finished difference Result 37856 states and 63122 transitions. [2019-09-08 13:31:33,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:31:33,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 378 [2019-09-08 13:31:33,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:33,076 INFO L225 Difference]: With dead ends: 37856 [2019-09-08 13:31:33,076 INFO L226 Difference]: Without dead ends: 27306 [2019-09-08 13:31:33,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:31:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27306 states. [2019-09-08 13:31:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27306 to 23458. [2019-09-08 13:31:35,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23458 states. [2019-09-08 13:31:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23458 states to 23458 states and 38999 transitions. [2019-09-08 13:31:35,105 INFO L78 Accepts]: Start accepts. Automaton has 23458 states and 38999 transitions. Word has length 378 [2019-09-08 13:31:35,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:35,106 INFO L475 AbstractCegarLoop]: Abstraction has 23458 states and 38999 transitions. [2019-09-08 13:31:35,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:31:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand 23458 states and 38999 transitions. [2019-09-08 13:31:35,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-08 13:31:35,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:35,130 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:35,131 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:35,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:35,131 INFO L82 PathProgramCache]: Analyzing trace with hash 47984045, now seen corresponding path program 1 times [2019-09-08 13:31:35,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:35,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:35,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:35,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:35,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:36,134 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 13:31:36,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:36,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:31:36,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:31:36,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:31:36,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:31:36,136 INFO L87 Difference]: Start difference. First operand 23458 states and 38999 transitions. Second operand 4 states. [2019-09-08 13:31:37,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:37,853 INFO L93 Difference]: Finished difference Result 71106 states and 118549 transitions. [2019-09-08 13:31:37,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:31:37,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 382 [2019-09-08 13:31:37,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:38,004 INFO L225 Difference]: With dead ends: 71106 [2019-09-08 13:31:38,004 INFO L226 Difference]: Without dead ends: 52130 [2019-09-08 13:31:38,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 13:31:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52130 states. [2019-09-08 13:31:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52130 to 44232. [2019-09-08 13:31:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44232 states. [2019-09-08 13:31:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44232 states to 44232 states and 73561 transitions. [2019-09-08 13:31:40,620 INFO L78 Accepts]: Start accepts. Automaton has 44232 states and 73561 transitions. Word has length 382 [2019-09-08 13:31:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:40,621 INFO L475 AbstractCegarLoop]: Abstraction has 44232 states and 73561 transitions. [2019-09-08 13:31:40,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:31:40,622 INFO L276 IsEmpty]: Start isEmpty. Operand 44232 states and 73561 transitions. [2019-09-08 13:31:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-08 13:31:40,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:40,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:40,652 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:40,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:40,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1181837992, now seen corresponding path program 1 times [2019-09-08 13:31:40,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:40,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:40,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:40,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:40,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:41,079 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 13:31:41,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:41,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:31:41,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:31:41,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:31:41,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:31:41,081 INFO L87 Difference]: Start difference. First operand 44232 states and 73561 transitions. Second operand 5 states. [2019-09-08 13:31:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:45,889 INFO L93 Difference]: Finished difference Result 171746 states and 286627 transitions. [2019-09-08 13:31:45,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:31:45,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 382 [2019-09-08 13:31:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:46,255 INFO L225 Difference]: With dead ends: 171746 [2019-09-08 13:31:46,256 INFO L226 Difference]: Without dead ends: 136148 [2019-09-08 13:31:46,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 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 13:31:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136148 states. [2019-09-08 13:31:49,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136148 to 108320. [2019-09-08 13:31:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108320 states. [2019-09-08 13:31:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108320 states to 108320 states and 180349 transitions. [2019-09-08 13:31:49,945 INFO L78 Accepts]: Start accepts. Automaton has 108320 states and 180349 transitions. Word has length 382 [2019-09-08 13:31:49,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:49,946 INFO L475 AbstractCegarLoop]: Abstraction has 108320 states and 180349 transitions. [2019-09-08 13:31:49,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:31:49,946 INFO L276 IsEmpty]: Start isEmpty. Operand 108320 states and 180349 transitions. [2019-09-08 13:31:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-08 13:31:49,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:49,973 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:49,974 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:49,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:49,974 INFO L82 PathProgramCache]: Analyzing trace with hash 954181943, now seen corresponding path program 1 times [2019-09-08 13:31:49,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:49,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:49,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:49,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:49,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:50,400 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 13:31:50,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:50,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:50,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:50,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:50,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:50,403 INFO L87 Difference]: Start difference. First operand 108320 states and 180349 transitions. Second operand 3 states. [2019-09-08 13:31:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:57,200 INFO L93 Difference]: Finished difference Result 302904 states and 504500 transitions. [2019-09-08 13:31:57,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:57,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2019-09-08 13:31:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:57,855 INFO L225 Difference]: With dead ends: 302904 [2019-09-08 13:31:57,855 INFO L226 Difference]: Without dead ends: 195302 [2019-09-08 13:31:57,994 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 13:31:58,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195302 states. [2019-09-08 13:32:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195302 to 187016. [2019-09-08 13:32:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187016 states. [2019-09-08 13:32:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187016 states to 187016 states and 309572 transitions. [2019-09-08 13:32:07,431 INFO L78 Accepts]: Start accepts. Automaton has 187016 states and 309572 transitions. Word has length 382 [2019-09-08 13:32:07,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:07,431 INFO L475 AbstractCegarLoop]: Abstraction has 187016 states and 309572 transitions. [2019-09-08 13:32:07,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:32:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 187016 states and 309572 transitions. [2019-09-08 13:32:07,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-08 13:32:07,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:07,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:32:07,458 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:07,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:07,458 INFO L82 PathProgramCache]: Analyzing trace with hash 727343335, now seen corresponding path program 1 times [2019-09-08 13:32:07,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:07,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:07,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:07,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:07,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:08,132 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 13:32:08,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:08,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:32:08,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:32:08,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:32:08,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:32:08,134 INFO L87 Difference]: Start difference. First operand 187016 states and 309572 transitions. Second operand 7 states. [2019-09-08 13:32:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:24,757 INFO L93 Difference]: Finished difference Result 618186 states and 1025104 transitions. [2019-09-08 13:32:24,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 13:32:24,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 382 [2019-09-08 13:32:24,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:25,572 INFO L225 Difference]: With dead ends: 618186 [2019-09-08 13:32:25,572 INFO L226 Difference]: Without dead ends: 445516 [2019-09-08 13:32:25,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 13:32:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445516 states. [2019-09-08 13:32:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445516 to 198020. [2019-09-08 13:32:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198020 states. [2019-09-08 13:32:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198020 states to 198020 states and 327960 transitions. [2019-09-08 13:32:41,029 INFO L78 Accepts]: Start accepts. Automaton has 198020 states and 327960 transitions. Word has length 382 [2019-09-08 13:32:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:41,029 INFO L475 AbstractCegarLoop]: Abstraction has 198020 states and 327960 transitions. [2019-09-08 13:32:41,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:32:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 198020 states and 327960 transitions. [2019-09-08 13:32:41,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-08 13:32:41,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:41,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:32:41,051 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:41,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:41,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1949809634, now seen corresponding path program 1 times [2019-09-08 13:32:41,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:41,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:41,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:41,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:41,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:41,692 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 13:32:41,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:41,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:32:41,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:32:41,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:32:41,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:32:41,695 INFO L87 Difference]: Start difference. First operand 198020 states and 327960 transitions. Second operand 7 states. [2019-09-08 13:33:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:33:04,159 INFO L93 Difference]: Finished difference Result 630030 states and 1044980 transitions. [2019-09-08 13:33:04,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 13:33:04,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 382 [2019-09-08 13:33:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:33:04,785 INFO L225 Difference]: With dead ends: 630030 [2019-09-08 13:33:04,785 INFO L226 Difference]: Without dead ends: 457360 [2019-09-08 13:33:04,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 13:33:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457360 states. [2019-09-08 13:33:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457360 to 220268. [2019-09-08 13:33:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220268 states. [2019-09-08 13:33:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220268 states to 220268 states and 364976 transitions. [2019-09-08 13:33:23,672 INFO L78 Accepts]: Start accepts. Automaton has 220268 states and 364976 transitions. Word has length 382 [2019-09-08 13:33:23,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:33:23,672 INFO L475 AbstractCegarLoop]: Abstraction has 220268 states and 364976 transitions. [2019-09-08 13:33:23,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:33:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 220268 states and 364976 transitions. [2019-09-08 13:33:23,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-08 13:33:23,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:33:23,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:33:23,699 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:33:23,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:33:23,699 INFO L82 PathProgramCache]: Analyzing trace with hash 446914932, now seen corresponding path program 1 times [2019-09-08 13:33:23,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:33:23,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:33:23,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:33:23,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:33:23,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:33:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:33:24,291 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 13:33:24,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:33:24,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:33:24,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:33:24,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:33:24,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:33:24,293 INFO L87 Difference]: Start difference. First operand 220268 states and 364976 transitions. Second operand 7 states. [2019-09-08 13:33:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:33:53,108 INFO L93 Difference]: Finished difference Result 646322 states and 1071912 transitions. [2019-09-08 13:33:53,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 13:33:53,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 382 [2019-09-08 13:33:53,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:33:53,878 INFO L225 Difference]: With dead ends: 646322 [2019-09-08 13:33:53,878 INFO L226 Difference]: Without dead ends: 532088 [2019-09-08 13:33:54,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 13:33:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532088 states. [2019-09-08 13:34:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532088 to 241900. [2019-09-08 13:34:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241900 states. [2019-09-08 13:34:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241900 states to 241900 states and 400860 transitions. [2019-09-08 13:34:18,040 INFO L78 Accepts]: Start accepts. Automaton has 241900 states and 400860 transitions. Word has length 382 [2019-09-08 13:34:18,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:34:18,041 INFO L475 AbstractCegarLoop]: Abstraction has 241900 states and 400860 transitions. [2019-09-08 13:34:18,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:34:18,041 INFO L276 IsEmpty]: Start isEmpty. Operand 241900 states and 400860 transitions. [2019-09-08 13:34:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-08 13:34:18,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:34:18,069 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:18,070 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:34:18,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:34:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1329868963, now seen corresponding path program 1 times [2019-09-08 13:34:18,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:34:18,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:34:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:18,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:34:18,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:34:19,089 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 13:34:19,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:34:19,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:34:19,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:34:19,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:34:19,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:34:19,092 INFO L87 Difference]: Start difference. First operand 241900 states and 400860 transitions. Second operand 7 states. [2019-09-08 13:34:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:34:35,309 INFO L93 Difference]: Finished difference Result 362896 states and 601870 transitions. [2019-09-08 13:34:35,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 13:34:35,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 382 [2019-09-08 13:34:35,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:34:35,707 INFO L225 Difference]: With dead ends: 362896 [2019-09-08 13:34:35,707 INFO L226 Difference]: Without dead ends: 260930 [2019-09-08 13:34:35,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-08 13:34:36,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260930 states. [2019-09-08 13:34:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260930 to 248432. [2019-09-08 13:34:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248432 states. [2019-09-08 13:34:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248432 states to 248432 states and 411768 transitions. [2019-09-08 13:34:56,500 INFO L78 Accepts]: Start accepts. Automaton has 248432 states and 411768 transitions. Word has length 382 [2019-09-08 13:34:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:34:56,501 INFO L475 AbstractCegarLoop]: Abstraction has 248432 states and 411768 transitions. [2019-09-08 13:34:56,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:34:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 248432 states and 411768 transitions. [2019-09-08 13:34:56,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-08 13:34:56,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:34:56,524 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:56,524 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:34:56,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:34:56,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1451385970, now seen corresponding path program 1 times [2019-09-08 13:34:56,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:34:56,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:34:56,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:56,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:34:56,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:34:56,837 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 13:34:56,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:34:56,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:34:56,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:34:56,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:34:56,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:34:56,839 INFO L87 Difference]: Start difference. First operand 248432 states and 411768 transitions. Second operand 3 states. [2019-09-08 13:35:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:35:10,639 INFO L93 Difference]: Finished difference Result 488511 states and 810188 transitions. [2019-09-08 13:35:10,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:35:10,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2019-09-08 13:35:10,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:35:11,006 INFO L225 Difference]: With dead ends: 488511 [2019-09-08 13:35:11,006 INFO L226 Difference]: Without dead ends: 241949 [2019-09-08 13:35:11,160 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 13:35:11,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241949 states. [2019-09-08 13:35:30,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241949 to 241947. [2019-09-08 13:35:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241947 states. [2019-09-08 13:35:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241947 states to 241947 states and 400522 transitions. [2019-09-08 13:35:31,468 INFO L78 Accepts]: Start accepts. Automaton has 241947 states and 400522 transitions. Word has length 382 [2019-09-08 13:35:31,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:35:31,468 INFO L475 AbstractCegarLoop]: Abstraction has 241947 states and 400522 transitions. [2019-09-08 13:35:31,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:35:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 241947 states and 400522 transitions. [2019-09-08 13:35:31,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-08 13:35:31,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:35:31,481 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:35:31,482 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:35:31,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:35:31,482 INFO L82 PathProgramCache]: Analyzing trace with hash -883565018, now seen corresponding path program 1 times [2019-09-08 13:35:31,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:35:31,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:35:31,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:35:31,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:35:31,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:35:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:35:31,963 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 13:35:31,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:35:31,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:35:31,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:35:31,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:35:31,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:35:31,965 INFO L87 Difference]: Start difference. First operand 241947 states and 400522 transitions. Second operand 6 states. [2019-09-08 13:36:05,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:36:05,939 INFO L93 Difference]: Finished difference Result 738415 states and 1222780 transitions. [2019-09-08 13:36:05,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:36:05,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 382 [2019-09-08 13:36:05,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:36:06,726 INFO L225 Difference]: With dead ends: 738415 [2019-09-08 13:36:06,726 INFO L226 Difference]: Without dead ends: 504953 [2019-09-08 13:36:06,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:36:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504953 states. [2019-09-08 13:36:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504953 to 495059. [2019-09-08 13:36:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495059 states. [2019-09-08 13:36:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495059 states to 495059 states and 818008 transitions. [2019-09-08 13:36:44,959 INFO L78 Accepts]: Start accepts. Automaton has 495059 states and 818008 transitions. Word has length 382 [2019-09-08 13:36:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:36:44,959 INFO L475 AbstractCegarLoop]: Abstraction has 495059 states and 818008 transitions. [2019-09-08 13:36:44,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:36:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 495059 states and 818008 transitions. [2019-09-08 13:36:44,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-09-08 13:36:44,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:36:44,979 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:36:44,979 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:36:44,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:36:44,980 INFO L82 PathProgramCache]: Analyzing trace with hash 980547119, now seen corresponding path program 1 times [2019-09-08 13:36:44,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:36:44,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:36:44,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:36:44,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:36:44,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:36:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:36:45,245 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 13:36:45,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:36:45,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:36:45,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:36:45,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:36:45,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:36:45,246 INFO L87 Difference]: Start difference. First operand 495059 states and 818008 transitions. Second operand 3 states. [2019-09-08 13:37:55,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:55,319 INFO L93 Difference]: Finished difference Result 1453472 states and 2398250 transitions. [2019-09-08 13:37:55,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:55,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2019-09-08 13:37:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:56,974 INFO L225 Difference]: With dead ends: 1453472 [2019-09-08 13:37:56,975 INFO L226 Difference]: Without dead ends: 967150 [2019-09-08 13:37:57,372 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 13:37:58,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967150 states. [2019-09-08 13:39:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967150 to 965330. [2019-09-08 13:39:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965330 states. [2019-09-08 13:39:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965330 states to 965330 states and 1589136 transitions. [2019-09-08 13:39:17,650 INFO L78 Accepts]: Start accepts. Automaton has 965330 states and 1589136 transitions. Word has length 383 [2019-09-08 13:39:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:17,650 INFO L475 AbstractCegarLoop]: Abstraction has 965330 states and 1589136 transitions. [2019-09-08 13:39:17,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 965330 states and 1589136 transitions. [2019-09-08 13:39:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-09-08 13:39:17,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:17,670 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:17,670 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:17,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:17,671 INFO L82 PathProgramCache]: Analyzing trace with hash 710004661, now seen corresponding path program 1 times [2019-09-08 13:39:17,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:17,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:17,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:17,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:17,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:19,512 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 13:39:19,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:19,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:39:19,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:39:19,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:39:19,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:39:19,514 INFO L87 Difference]: Start difference. First operand 965330 states and 1589136 transitions. Second operand 7 states.