java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:42:25,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:42:25,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:42:25,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:42:25,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:42:25,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:42:25,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:42:25,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:42:25,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:42:25,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:42:25,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:42:25,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:42:25,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:42:25,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:42:25,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:42:25,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:42:25,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:42:25,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:42:25,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:42:25,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:42:25,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:42:25,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:42:25,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:42:25,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:42:25,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:42:25,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:42:25,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:42:25,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:42:25,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:42:25,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:42:25,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:42:25,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:42:25,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:42:25,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:42:25,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:42:25,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:42:25,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:42:25,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:42:25,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:42:25,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:42:25,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:42:25,248 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 09:42:25,273 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:42:25,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:42:25,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:42:25,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:42:25,278 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:42:25,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:42:25,278 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:42:25,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:42:25,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:42:25,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:42:25,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:42:25,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:42:25,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:42:25,281 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:42:25,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:42:25,281 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:42:25,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:42:25,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:42:25,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:42:25,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:42:25,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:42:25,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:42:25,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:42:25,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:42:25,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:42:25,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:42:25,284 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:42:25,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:42:25,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:42:25,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:42:25,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:42:25,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:42:25,363 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:42:25,364 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:42:25,364 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 09:42:25,459 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a65a33b/209f62241cae4b11ab16531caa44af21/FLAG7678de3da [2019-09-08 09:42:26,091 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:42:26,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 09:42:26,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a65a33b/209f62241cae4b11ab16531caa44af21/FLAG7678de3da [2019-09-08 09:42:26,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a65a33b/209f62241cae4b11ab16531caa44af21 [2019-09-08 09:42:26,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:42:26,317 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:42:26,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:42:26,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:42:26,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:42:26,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:42:26" (1/1) ... [2019-09-08 09:42:26,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5756954e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:26, skipping insertion in model container [2019-09-08 09:42:26,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:42:26" (1/1) ... [2019-09-08 09:42:26,335 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:42:26,454 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:42:27,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:42:27,412 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:42:27,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:42:27,847 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:42:27,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:27 WrapperNode [2019-09-08 09:42:27,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:42:27,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:42:27,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:42:27,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:42:27,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:27" (1/1) ... [2019-09-08 09:42:27,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:27" (1/1) ... [2019-09-08 09:42:27,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:27" (1/1) ... [2019-09-08 09:42:27,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:27" (1/1) ... [2019-09-08 09:42:27,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:27" (1/1) ... [2019-09-08 09:42:27,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:27" (1/1) ... [2019-09-08 09:42:27,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:27" (1/1) ... [2019-09-08 09:42:28,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:42:28,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:42:28,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:42:28,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:42:28,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:42:28,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:42:28,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:42:28,080 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:42:28,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:42:28,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:42:28,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:42:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:42:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:42:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:42:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:42:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:42:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:42:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:42:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:42:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:42:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:42:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:42:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:42:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:42:30,451 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:42:30,451 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:42:30,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:42:30 BoogieIcfgContainer [2019-09-08 09:42:30,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:42:30,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:42:30,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:42:30,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:42:30,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:42:26" (1/3) ... [2019-09-08 09:42:30,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ecf2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:42:30, skipping insertion in model container [2019-09-08 09:42:30,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:42:27" (2/3) ... [2019-09-08 09:42:30,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ecf2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:42:30, skipping insertion in model container [2019-09-08 09:42:30,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:42:30" (3/3) ... [2019-09-08 09:42:30,467 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 09:42:30,477 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:42:30,506 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:42:30,526 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:42:30,575 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:42:30,576 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:42:30,577 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:42:30,577 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:42:30,577 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:42:30,577 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:42:30,577 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:42:30,577 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:42:30,577 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:42:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states. [2019-09-08 09:42:30,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-08 09:42:30,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:30,666 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] [2019-09-08 09:42:30,669 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:30,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:30,677 INFO L82 PathProgramCache]: Analyzing trace with hash -273867960, now seen corresponding path program 1 times [2019-09-08 09:42:30,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:30,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:30,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:30,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:30,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:32,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:32,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:42:32,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:42:32,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:42:32,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:42:32,264 INFO L87 Difference]: Start difference. First operand 712 states. Second operand 4 states. [2019-09-08 09:42:32,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:32,643 INFO L93 Difference]: Finished difference Result 2088 states and 3714 transitions. [2019-09-08 09:42:32,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:42:32,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2019-09-08 09:42:32,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:32,669 INFO L225 Difference]: With dead ends: 2088 [2019-09-08 09:42:32,670 INFO L226 Difference]: Without dead ends: 1383 [2019-09-08 09:42:32,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:42:32,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2019-09-08 09:42:32,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1381. [2019-09-08 09:42:32,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381 states. [2019-09-08 09:42:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2147 transitions. [2019-09-08 09:42:32,857 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2147 transitions. Word has length 296 [2019-09-08 09:42:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:32,860 INFO L475 AbstractCegarLoop]: Abstraction has 1381 states and 2147 transitions. [2019-09-08 09:42:32,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:42:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2147 transitions. [2019-09-08 09:42:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 09:42:32,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:32,870 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] [2019-09-08 09:42:32,870 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:32,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:32,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1576767261, now seen corresponding path program 1 times [2019-09-08 09:42:32,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:32,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:32,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:32,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:33,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:33,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:33,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:33,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:33,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:33,198 INFO L87 Difference]: Start difference. First operand 1381 states and 2147 transitions. Second operand 3 states. [2019-09-08 09:42:33,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:33,321 INFO L93 Difference]: Finished difference Result 4098 states and 6370 transitions. [2019-09-08 09:42:33,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:33,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-09-08 09:42:33,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:33,336 INFO L225 Difference]: With dead ends: 4098 [2019-09-08 09:42:33,337 INFO L226 Difference]: Without dead ends: 2742 [2019-09-08 09:42:33,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:33,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2019-09-08 09:42:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 1394. [2019-09-08 09:42:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2019-09-08 09:42:33,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2166 transitions. [2019-09-08 09:42:33,435 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2166 transitions. Word has length 298 [2019-09-08 09:42:33,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:33,436 INFO L475 AbstractCegarLoop]: Abstraction has 1394 states and 2166 transitions. [2019-09-08 09:42:33,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:33,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2166 transitions. [2019-09-08 09:42:33,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 09:42:33,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:33,442 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] [2019-09-08 09:42:33,443 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:33,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:33,443 INFO L82 PathProgramCache]: Analyzing trace with hash -430171170, now seen corresponding path program 1 times [2019-09-08 09:42:33,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:33,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:33,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:33,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:33,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:33,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:33,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:33,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:33,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:33,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:33,765 INFO L87 Difference]: Start difference. First operand 1394 states and 2166 transitions. Second operand 3 states. [2019-09-08 09:42:33,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:33,998 INFO L93 Difference]: Finished difference Result 3979 states and 6157 transitions. [2019-09-08 09:42:33,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:34,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-09-08 09:42:34,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:34,020 INFO L225 Difference]: With dead ends: 3979 [2019-09-08 09:42:34,020 INFO L226 Difference]: Without dead ends: 2727 [2019-09-08 09:42:34,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:34,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2019-09-08 09:42:34,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2725. [2019-09-08 09:42:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2725 states. [2019-09-08 09:42:34,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2725 states and 4215 transitions. [2019-09-08 09:42:34,194 INFO L78 Accepts]: Start accepts. Automaton has 2725 states and 4215 transitions. Word has length 298 [2019-09-08 09:42:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:34,196 INFO L475 AbstractCegarLoop]: Abstraction has 2725 states and 4215 transitions. [2019-09-08 09:42:34,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:34,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 4215 transitions. [2019-09-08 09:42:34,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-08 09:42:34,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:34,206 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] [2019-09-08 09:42:34,207 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:34,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:34,207 INFO L82 PathProgramCache]: Analyzing trace with hash 683417454, now seen corresponding path program 1 times [2019-09-08 09:42:34,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:34,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:34,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:34,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:34,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:34,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:34,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:34,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:34,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:34,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:34,367 INFO L87 Difference]: Start difference. First operand 2725 states and 4215 transitions. Second operand 3 states. [2019-09-08 09:42:34,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:34,869 INFO L93 Difference]: Finished difference Result 8062 states and 12458 transitions. [2019-09-08 09:42:34,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:34,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-09-08 09:42:34,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:34,906 INFO L225 Difference]: With dead ends: 8062 [2019-09-08 09:42:34,907 INFO L226 Difference]: Without dead ends: 5397 [2019-09-08 09:42:34,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:34,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5397 states. [2019-09-08 09:42:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5397 to 2743. [2019-09-08 09:42:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2743 states. [2019-09-08 09:42:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 4236 transitions. [2019-09-08 09:42:35,156 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 4236 transitions. Word has length 299 [2019-09-08 09:42:35,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:35,157 INFO L475 AbstractCegarLoop]: Abstraction has 2743 states and 4236 transitions. [2019-09-08 09:42:35,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 4236 transitions. [2019-09-08 09:42:35,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 09:42:35,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:35,171 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] [2019-09-08 09:42:35,171 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:35,172 INFO L82 PathProgramCache]: Analyzing trace with hash -799745095, now seen corresponding path program 1 times [2019-09-08 09:42:35,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:35,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:35,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:35,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:35,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:35,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:35,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:35,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:35,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:35,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:35,475 INFO L87 Difference]: Start difference. First operand 2743 states and 4236 transitions. Second operand 3 states. [2019-09-08 09:42:35,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:35,874 INFO L93 Difference]: Finished difference Result 7786 states and 11965 transitions. [2019-09-08 09:42:35,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:35,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-09-08 09:42:35,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:35,909 INFO L225 Difference]: With dead ends: 7786 [2019-09-08 09:42:35,910 INFO L226 Difference]: Without dead ends: 5288 [2019-09-08 09:42:35,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5288 states. [2019-09-08 09:42:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5288 to 5286. [2019-09-08 09:42:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5286 states. [2019-09-08 09:42:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5286 states to 5286 states and 8104 transitions. [2019-09-08 09:42:36,344 INFO L78 Accepts]: Start accepts. Automaton has 5286 states and 8104 transitions. Word has length 300 [2019-09-08 09:42:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:36,345 INFO L475 AbstractCegarLoop]: Abstraction has 5286 states and 8104 transitions. [2019-09-08 09:42:36,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 5286 states and 8104 transitions. [2019-09-08 09:42:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 09:42:36,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:36,362 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] [2019-09-08 09:42:36,363 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:36,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:36,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2079229974, now seen corresponding path program 1 times [2019-09-08 09:42:36,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:36,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:36,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:36,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:36,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:36,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:36,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:42:36,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:42:36,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:42:36,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:42:36,736 INFO L87 Difference]: Start difference. First operand 5286 states and 8104 transitions. Second operand 4 states. [2019-09-08 09:42:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:37,454 INFO L93 Difference]: Finished difference Result 14380 states and 21866 transitions. [2019-09-08 09:42:37,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:42:37,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2019-09-08 09:42:37,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:37,516 INFO L225 Difference]: With dead ends: 14380 [2019-09-08 09:42:37,516 INFO L226 Difference]: Without dead ends: 9634 [2019-09-08 09:42:37,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:42:37,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9634 states. [2019-09-08 09:42:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9634 to 5521. [2019-09-08 09:42:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5521 states. [2019-09-08 09:42:37,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5521 states to 5521 states and 8492 transitions. [2019-09-08 09:42:37,990 INFO L78 Accepts]: Start accepts. Automaton has 5521 states and 8492 transitions. Word has length 300 [2019-09-08 09:42:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:37,992 INFO L475 AbstractCegarLoop]: Abstraction has 5521 states and 8492 transitions. [2019-09-08 09:42:37,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:42:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 5521 states and 8492 transitions. [2019-09-08 09:42:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 09:42:38,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:38,007 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] [2019-09-08 09:42:38,008 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:38,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:38,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1219902707, now seen corresponding path program 1 times [2019-09-08 09:42:38,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:38,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:38,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:38,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:38,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:38,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:38,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:38,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:38,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:38,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:38,183 INFO L87 Difference]: Start difference. First operand 5521 states and 8492 transitions. Second operand 3 states. [2019-09-08 09:42:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:38,773 INFO L93 Difference]: Finished difference Result 14993 states and 22757 transitions. [2019-09-08 09:42:38,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:38,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-08 09:42:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:38,801 INFO L225 Difference]: With dead ends: 14993 [2019-09-08 09:42:38,801 INFO L226 Difference]: Without dead ends: 10275 [2019-09-08 09:42:38,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10275 states. [2019-09-08 09:42:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10275 to 5625. [2019-09-08 09:42:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5625 states. [2019-09-08 09:42:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5625 states to 5625 states and 8635 transitions. [2019-09-08 09:42:39,186 INFO L78 Accepts]: Start accepts. Automaton has 5625 states and 8635 transitions. Word has length 302 [2019-09-08 09:42:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:39,186 INFO L475 AbstractCegarLoop]: Abstraction has 5625 states and 8635 transitions. [2019-09-08 09:42:39,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 5625 states and 8635 transitions. [2019-09-08 09:42:39,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-08 09:42:39,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:39,201 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] [2019-09-08 09:42:39,202 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:39,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:39,202 INFO L82 PathProgramCache]: Analyzing trace with hash 3714028, now seen corresponding path program 1 times [2019-09-08 09:42:39,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:39,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:39,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:39,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:39,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:39,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:39,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:39,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:39,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:39,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:39,347 INFO L87 Difference]: Start difference. First operand 5625 states and 8635 transitions. Second operand 3 states. [2019-09-08 09:42:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:39,982 INFO L93 Difference]: Finished difference Result 15125 states and 22923 transitions. [2019-09-08 09:42:39,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:39,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-09-08 09:42:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:40,005 INFO L225 Difference]: With dead ends: 15125 [2019-09-08 09:42:40,006 INFO L226 Difference]: Without dead ends: 10400 [2019-09-08 09:42:40,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10400 states. [2019-09-08 09:42:40,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10400 to 5750. [2019-09-08 09:42:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5750 states. [2019-09-08 09:42:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5750 states to 5750 states and 8781 transitions. [2019-09-08 09:42:40,392 INFO L78 Accepts]: Start accepts. Automaton has 5750 states and 8781 transitions. Word has length 303 [2019-09-08 09:42:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:40,393 INFO L475 AbstractCegarLoop]: Abstraction has 5750 states and 8781 transitions. [2019-09-08 09:42:40,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 5750 states and 8781 transitions. [2019-09-08 09:42:40,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 09:42:40,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:40,408 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:42:40,409 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:40,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:40,409 INFO L82 PathProgramCache]: Analyzing trace with hash 810921408, now seen corresponding path program 1 times [2019-09-08 09:42:40,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:40,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:40,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:40,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:40,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:40,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:40,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:42:40,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:42:40,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:42:40,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:42:40,922 INFO L87 Difference]: Start difference. First operand 5750 states and 8781 transitions. Second operand 4 states. [2019-09-08 09:42:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:41,545 INFO L93 Difference]: Finished difference Result 12783 states and 19503 transitions. [2019-09-08 09:42:41,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:42:41,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-09-08 09:42:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:41,560 INFO L225 Difference]: With dead ends: 12783 [2019-09-08 09:42:41,560 INFO L226 Difference]: Without dead ends: 6598 [2019-09-08 09:42:41,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:42:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6598 states. [2019-09-08 09:42:41,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6598 to 6596. [2019-09-08 09:42:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6596 states. [2019-09-08 09:42:41,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6596 states to 6596 states and 10032 transitions. [2019-09-08 09:42:41,974 INFO L78 Accepts]: Start accepts. Automaton has 6596 states and 10032 transitions. Word has length 304 [2019-09-08 09:42:41,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:41,975 INFO L475 AbstractCegarLoop]: Abstraction has 6596 states and 10032 transitions. [2019-09-08 09:42:41,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:42:41,975 INFO L276 IsEmpty]: Start isEmpty. Operand 6596 states and 10032 transitions. [2019-09-08 09:42:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:42:41,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:41,992 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:42:41,993 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:41,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:41,993 INFO L82 PathProgramCache]: Analyzing trace with hash 584962070, now seen corresponding path program 1 times [2019-09-08 09:42:41,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:41,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:41,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:42,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:42,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:42,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:42,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:42,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:42,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:42,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:42,220 INFO L87 Difference]: Start difference. First operand 6596 states and 10032 transitions. Second operand 3 states. [2019-09-08 09:42:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:43,117 INFO L93 Difference]: Finished difference Result 19196 states and 29128 transitions. [2019-09-08 09:42:43,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:43,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-08 09:42:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:43,154 INFO L225 Difference]: With dead ends: 19196 [2019-09-08 09:42:43,155 INFO L226 Difference]: Without dead ends: 12907 [2019-09-08 09:42:43,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:43,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12907 states. [2019-09-08 09:42:43,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12907 to 12905. [2019-09-08 09:42:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12905 states. [2019-09-08 09:42:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12905 states to 12905 states and 19499 transitions. [2019-09-08 09:42:43,988 INFO L78 Accepts]: Start accepts. Automaton has 12905 states and 19499 transitions. Word has length 306 [2019-09-08 09:42:43,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:43,988 INFO L475 AbstractCegarLoop]: Abstraction has 12905 states and 19499 transitions. [2019-09-08 09:42:43,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:43,988 INFO L276 IsEmpty]: Start isEmpty. Operand 12905 states and 19499 transitions. [2019-09-08 09:42:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:42:44,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:44,015 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:42:44,016 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:44,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:44,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1321064755, now seen corresponding path program 1 times [2019-09-08 09:42:44,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:44,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:44,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:44,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:44,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:44,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:44,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:42:44,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:42:44,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:42:44,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:42:44,367 INFO L87 Difference]: Start difference. First operand 12905 states and 19499 transitions. Second operand 4 states. [2019-09-08 09:42:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:45,553 INFO L93 Difference]: Finished difference Result 35234 states and 52918 transitions. [2019-09-08 09:42:45,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:42:45,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-09-08 09:42:45,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:45,596 INFO L225 Difference]: With dead ends: 35234 [2019-09-08 09:42:45,596 INFO L226 Difference]: Without dead ends: 24700 [2019-09-08 09:42:45,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:42:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24700 states. [2019-09-08 09:42:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24700 to 14084. [2019-09-08 09:42:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14084 states. [2019-09-08 09:42:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14084 states to 14084 states and 21484 transitions. [2019-09-08 09:42:47,406 INFO L78 Accepts]: Start accepts. Automaton has 14084 states and 21484 transitions. Word has length 306 [2019-09-08 09:42:47,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:47,407 INFO L475 AbstractCegarLoop]: Abstraction has 14084 states and 21484 transitions. [2019-09-08 09:42:47,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:42:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 14084 states and 21484 transitions. [2019-09-08 09:42:47,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:42:47,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:47,441 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:42:47,442 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:47,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:47,442 INFO L82 PathProgramCache]: Analyzing trace with hash -307449274, now seen corresponding path program 1 times [2019-09-08 09:42:47,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:47,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:47,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:47,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:47,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:47,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:47,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:47,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:47,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:47,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:47,575 INFO L87 Difference]: Start difference. First operand 14084 states and 21484 transitions. Second operand 3 states. [2019-09-08 09:42:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:48,706 INFO L93 Difference]: Finished difference Result 39644 states and 59996 transitions. [2019-09-08 09:42:48,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:48,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-08 09:42:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:48,736 INFO L225 Difference]: With dead ends: 39644 [2019-09-08 09:42:48,736 INFO L226 Difference]: Without dead ends: 26923 [2019-09-08 09:42:48,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:48,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26923 states. [2019-09-08 09:42:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26923 to 14354. [2019-09-08 09:42:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14354 states. [2019-09-08 09:42:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14354 states to 14354 states and 21834 transitions. [2019-09-08 09:42:49,464 INFO L78 Accepts]: Start accepts. Automaton has 14354 states and 21834 transitions. Word has length 306 [2019-09-08 09:42:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:49,465 INFO L475 AbstractCegarLoop]: Abstraction has 14354 states and 21834 transitions. [2019-09-08 09:42:49,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 14354 states and 21834 transitions. [2019-09-08 09:42:49,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-08 09:42:49,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:49,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:42:49,489 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:49,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:49,489 INFO L82 PathProgramCache]: Analyzing trace with hash -520567887, now seen corresponding path program 1 times [2019-09-08 09:42:49,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:49,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:49,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:49,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:49,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:49,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:49,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:49,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:49,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:49,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:49,625 INFO L87 Difference]: Start difference. First operand 14354 states and 21834 transitions. Second operand 3 states. [2019-09-08 09:42:50,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:50,860 INFO L93 Difference]: Finished difference Result 39828 states and 60158 transitions. [2019-09-08 09:42:50,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:50,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-09-08 09:42:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:50,892 INFO L225 Difference]: With dead ends: 39828 [2019-09-08 09:42:50,892 INFO L226 Difference]: Without dead ends: 27135 [2019-09-08 09:42:50,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:50,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27135 states. [2019-09-08 09:42:51,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27135 to 14646. [2019-09-08 09:42:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14646 states. [2019-09-08 09:42:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14646 states to 14646 states and 22172 transitions. [2019-09-08 09:42:51,631 INFO L78 Accepts]: Start accepts. Automaton has 14646 states and 22172 transitions. Word has length 307 [2019-09-08 09:42:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:51,631 INFO L475 AbstractCegarLoop]: Abstraction has 14646 states and 22172 transitions. [2019-09-08 09:42:51,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 14646 states and 22172 transitions. [2019-09-08 09:42:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:42:51,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:51,646 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:42:51,646 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:51,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:51,646 INFO L82 PathProgramCache]: Analyzing trace with hash 205458356, now seen corresponding path program 1 times [2019-09-08 09:42:51,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:51,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:51,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:51,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:51,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:51,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:51,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:51,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:51,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:51,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:51,943 INFO L87 Difference]: Start difference. First operand 14646 states and 22172 transitions. Second operand 3 states. [2019-09-08 09:42:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:53,638 INFO L93 Difference]: Finished difference Result 30270 states and 45302 transitions. [2019-09-08 09:42:53,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:53,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-08 09:42:53,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:53,665 INFO L225 Difference]: With dead ends: 30270 [2019-09-08 09:42:53,665 INFO L226 Difference]: Without dead ends: 22440 [2019-09-08 09:42:53,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:53,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22440 states. [2019-09-08 09:42:55,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22440 to 22438. [2019-09-08 09:42:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22438 states. [2019-09-08 09:42:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22438 states to 22438 states and 33520 transitions. [2019-09-08 09:42:55,498 INFO L78 Accepts]: Start accepts. Automaton has 22438 states and 33520 transitions. Word has length 308 [2019-09-08 09:42:55,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:55,498 INFO L475 AbstractCegarLoop]: Abstraction has 22438 states and 33520 transitions. [2019-09-08 09:42:55,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand 22438 states and 33520 transitions. [2019-09-08 09:42:55,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:42:55,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:55,515 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:42:55,516 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:55,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:55,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1707348438, now seen corresponding path program 1 times [2019-09-08 09:42:55,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:55,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:55,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:55,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:55,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:56,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:56,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 09:42:56,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:42:56,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:42:56,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:42:56,023 INFO L87 Difference]: Start difference. First operand 22438 states and 33520 transitions. Second operand 8 states. [2019-09-08 09:42:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:58,107 INFO L93 Difference]: Finished difference Result 38676 states and 58500 transitions. [2019-09-08 09:42:58,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:42:58,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 308 [2019-09-08 09:42:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:58,138 INFO L225 Difference]: With dead ends: 38676 [2019-09-08 09:42:58,139 INFO L226 Difference]: Without dead ends: 34064 [2019-09-08 09:42:58,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:42:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34064 states. [2019-09-08 09:43:00,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34064 to 34062. [2019-09-08 09:43:00,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-09-08 09:43:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 50848 transitions. [2019-09-08 09:43:00,171 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 50848 transitions. Word has length 308 [2019-09-08 09:43:00,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:00,172 INFO L475 AbstractCegarLoop]: Abstraction has 34062 states and 50848 transitions. [2019-09-08 09:43:00,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:43:00,172 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 50848 transitions. [2019-09-08 09:43:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:43:00,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:00,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:00,206 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:00,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:00,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1900209902, now seen corresponding path program 1 times [2019-09-08 09:43:00,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:00,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:00,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:00,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:00,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:00,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:00,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:00,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:00,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:00,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:00,831 INFO L87 Difference]: Start difference. First operand 34062 states and 50848 transitions. Second operand 4 states. [2019-09-08 09:43:05,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:05,078 INFO L93 Difference]: Finished difference Result 97464 states and 145014 transitions. [2019-09-08 09:43:05,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:43:05,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-08 09:43:05,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:05,154 INFO L225 Difference]: With dead ends: 97464 [2019-09-08 09:43:05,154 INFO L226 Difference]: Without dead ends: 64610 [2019-09-08 09:43:05,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:43:05,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64610 states. [2019-09-08 09:43:09,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64610 to 64608. [2019-09-08 09:43:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64608 states. [2019-09-08 09:43:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64608 states to 64608 states and 95597 transitions. [2019-09-08 09:43:09,218 INFO L78 Accepts]: Start accepts. Automaton has 64608 states and 95597 transitions. Word has length 308 [2019-09-08 09:43:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:09,219 INFO L475 AbstractCegarLoop]: Abstraction has 64608 states and 95597 transitions. [2019-09-08 09:43:09,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:43:09,219 INFO L276 IsEmpty]: Start isEmpty. Operand 64608 states and 95597 transitions. [2019-09-08 09:43:09,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:43:09,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:09,273 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:09,273 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:09,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:09,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1669169546, now seen corresponding path program 1 times [2019-09-08 09:43:09,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:09,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:09,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:09,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:09,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:09,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:09,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:09,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:09,702 INFO L87 Difference]: Start difference. First operand 64608 states and 95597 transitions. Second operand 4 states. [2019-09-08 09:43:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:15,140 INFO L93 Difference]: Finished difference Result 137745 states and 203448 transitions. [2019-09-08 09:43:15,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:43:15,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-08 09:43:15,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:15,223 INFO L225 Difference]: With dead ends: 137745 [2019-09-08 09:43:15,223 INFO L226 Difference]: Without dead ends: 70267 [2019-09-08 09:43:15,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:15,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70267 states. [2019-09-08 09:43:19,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70267 to 70265. [2019-09-08 09:43:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70265 states. [2019-09-08 09:43:19,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70265 states to 70265 states and 103159 transitions. [2019-09-08 09:43:19,622 INFO L78 Accepts]: Start accepts. Automaton has 70265 states and 103159 transitions. Word has length 308 [2019-09-08 09:43:19,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:19,623 INFO L475 AbstractCegarLoop]: Abstraction has 70265 states and 103159 transitions. [2019-09-08 09:43:19,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:43:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 70265 states and 103159 transitions. [2019-09-08 09:43:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:43:19,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:19,674 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:19,674 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:19,675 INFO L82 PathProgramCache]: Analyzing trace with hash -581596335, now seen corresponding path program 1 times [2019-09-08 09:43:19,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:19,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:19,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:19,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:19,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:19,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:19,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:19,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:19,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:19,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:19,996 INFO L87 Difference]: Start difference. First operand 70265 states and 103159 transitions. Second operand 4 states. [2019-09-08 09:43:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:29,245 INFO L93 Difference]: Finished difference Result 199944 states and 293262 transitions. [2019-09-08 09:43:29,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:43:29,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-08 09:43:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:29,394 INFO L225 Difference]: With dead ends: 199944 [2019-09-08 09:43:29,394 INFO L226 Difference]: Without dead ends: 138019 [2019-09-08 09:43:29,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:43:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138019 states. [2019-09-08 09:43:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138019 to 75502. [2019-09-08 09:43:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75502 states. [2019-09-08 09:43:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75502 states to 75502 states and 111116 transitions. [2019-09-08 09:43:36,747 INFO L78 Accepts]: Start accepts. Automaton has 75502 states and 111116 transitions. Word has length 308 [2019-09-08 09:43:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:36,748 INFO L475 AbstractCegarLoop]: Abstraction has 75502 states and 111116 transitions. [2019-09-08 09:43:36,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:43:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 75502 states and 111116 transitions. [2019-09-08 09:43:36,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:43:36,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:36,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:36,800 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:36,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:36,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1006208620, now seen corresponding path program 1 times [2019-09-08 09:43:36,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:36,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:36,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:36,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:36,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:37,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:37,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:37,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:37,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:37,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:37,234 INFO L87 Difference]: Start difference. First operand 75502 states and 111116 transitions. Second operand 4 states. [2019-09-08 09:43:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:48,544 INFO L93 Difference]: Finished difference Result 219879 states and 322633 transitions. [2019-09-08 09:43:48,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:43:48,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-08 09:43:48,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:48,700 INFO L225 Difference]: With dead ends: 219879 [2019-09-08 09:43:48,701 INFO L226 Difference]: Without dead ends: 145147 [2019-09-08 09:43:48,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:43:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145147 states. [2019-09-08 09:44:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145147 to 145145. [2019-09-08 09:44:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145145 states. [2019-09-08 09:44:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145145 states to 145145 states and 211365 transitions. [2019-09-08 09:44:01,004 INFO L78 Accepts]: Start accepts. Automaton has 145145 states and 211365 transitions. Word has length 308 [2019-09-08 09:44:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:01,004 INFO L475 AbstractCegarLoop]: Abstraction has 145145 states and 211365 transitions. [2019-09-08 09:44:01,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:44:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 145145 states and 211365 transitions. [2019-09-08 09:44:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 09:44:01,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:01,112 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:01,112 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:01,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1373768697, now seen corresponding path program 1 times [2019-09-08 09:44:01,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:01,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:01,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:01,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:01,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:01,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:01,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:44:01,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:44:01,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:44:01,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:01,369 INFO L87 Difference]: Start difference. First operand 145145 states and 211365 transitions. Second operand 3 states. [2019-09-08 09:44:24,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:24,058 INFO L93 Difference]: Finished difference Result 414835 states and 602502 transitions. [2019-09-08 09:44:24,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:44:24,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-08 09:44:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:24,385 INFO L225 Difference]: With dead ends: 414835 [2019-09-08 09:44:24,385 INFO L226 Difference]: Without dead ends: 284717 [2019-09-08 09:44:24,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:24,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284717 states. [2019-09-08 09:44:48,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284717 to 284715. [2019-09-08 09:44:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284715 states. [2019-09-08 09:44:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284715 states to 284715 states and 411442 transitions. [2019-09-08 09:44:49,344 INFO L78 Accepts]: Start accepts. Automaton has 284715 states and 411442 transitions. Word has length 310 [2019-09-08 09:44:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:49,345 INFO L475 AbstractCegarLoop]: Abstraction has 284715 states and 411442 transitions. [2019-09-08 09:44:49,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:44:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 284715 states and 411442 transitions. [2019-09-08 09:44:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 09:44:49,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:49,551 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:49,551 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:49,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:49,552 INFO L82 PathProgramCache]: Analyzing trace with hash 227172606, now seen corresponding path program 1 times [2019-09-08 09:44:49,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:49,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:49,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:49,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:49,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:49,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:49,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:44:49,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:44:49,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:44:49,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:49,674 INFO L87 Difference]: Start difference. First operand 284715 states and 411442 transitions. Second operand 3 states. [2019-09-08 09:45:37,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:37,871 INFO L93 Difference]: Finished difference Result 833876 states and 1203707 transitions. [2019-09-08 09:45:37,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:45:37,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-08 09:45:37,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:38,639 INFO L225 Difference]: With dead ends: 833876 [2019-09-08 09:45:38,640 INFO L226 Difference]: Without dead ends: 551842 [2019-09-08 09:45:38,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:45:39,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551842 states. [2019-09-08 09:46:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551842 to 285460. [2019-09-08 09:46:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285460 states. [2019-09-08 09:46:10,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285460 states to 285460 states and 412256 transitions. [2019-09-08 09:46:10,736 INFO L78 Accepts]: Start accepts. Automaton has 285460 states and 412256 transitions. Word has length 310 [2019-09-08 09:46:10,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:10,736 INFO L475 AbstractCegarLoop]: Abstraction has 285460 states and 412256 transitions. [2019-09-08 09:46:10,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:46:10,737 INFO L276 IsEmpty]: Start isEmpty. Operand 285460 states and 412256 transitions. [2019-09-08 09:46:10,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 09:46:10,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:10,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] [2019-09-08 09:46:10,979 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:10,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:10,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1035761893, now seen corresponding path program 1 times [2019-09-08 09:46:10,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:10,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:10,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:10,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:10,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:11,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:11,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:11,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:11,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:11,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:11,647 INFO L87 Difference]: Start difference. First operand 285460 states and 412256 transitions. Second operand 3 states. [2019-09-08 09:47:00,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:00,234 INFO L93 Difference]: Finished difference Result 843311 states and 1216763 transitions. [2019-09-08 09:47:00,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:00,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-08 09:47:00,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:01,042 INFO L225 Difference]: With dead ends: 843311 [2019-09-08 09:47:01,042 INFO L226 Difference]: Without dead ends: 567200 [2019-09-08 09:47:01,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567200 states. [2019-09-08 09:47:33,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567200 to 286346. [2019-09-08 09:47:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286346 states. [2019-09-08 09:47:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286346 states to 286346 states and 413271 transitions. [2019-09-08 09:47:34,141 INFO L78 Accepts]: Start accepts. Automaton has 286346 states and 413271 transitions. Word has length 311 [2019-09-08 09:47:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:34,141 INFO L475 AbstractCegarLoop]: Abstraction has 286346 states and 413271 transitions. [2019-09-08 09:47:34,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 286346 states and 413271 transitions. [2019-09-08 09:47:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 09:47:34,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:34,394 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:47:34,394 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:34,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:34,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1797781332, now seen corresponding path program 1 times [2019-09-08 09:47:34,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:34,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:34,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:34,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:34,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:47:34,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:34,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:34,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:34,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:34,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:34,670 INFO L87 Difference]: Start difference. First operand 286346 states and 413271 transitions. Second operand 3 states. [2019-09-08 09:48:28,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:28,552 INFO L93 Difference]: Finished difference Result 817085 states and 1176960 transitions. [2019-09-08 09:48:28,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:48:28,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-08 09:48:28,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:29,248 INFO L225 Difference]: With dead ends: 817085 [2019-09-08 09:48:29,248 INFO L226 Difference]: Without dead ends: 555731 [2019-09-08 09:48:29,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:48:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555731 states. [2019-09-08 09:49:23,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555731 to 555729. [2019-09-08 09:49:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555729 states. [2019-09-08 09:49:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555729 states to 555729 states and 796082 transitions. [2019-09-08 09:49:24,094 INFO L78 Accepts]: Start accepts. Automaton has 555729 states and 796082 transitions. Word has length 312 [2019-09-08 09:49:24,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:24,094 INFO L475 AbstractCegarLoop]: Abstraction has 555729 states and 796082 transitions. [2019-09-08 09:49:24,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:49:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 555729 states and 796082 transitions. [2019-09-08 09:49:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 09:49:24,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:24,615 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:49:24,615 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:24,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:24,616 INFO L82 PathProgramCache]: Analyzing trace with hash 381789105, now seen corresponding path program 1 times [2019-09-08 09:49:24,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:24,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:24,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:24,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:24,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:24,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:49:24,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:49:24,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:49:24,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:49:24,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:49:24,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:49:24,938 INFO L87 Difference]: Start difference. First operand 555729 states and 796082 transitions. Second operand 4 states. [2019-09-08 09:51:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:07,148 INFO L93 Difference]: Finished difference Result 1475914 states and 2108707 transitions. [2019-09-08 09:51:07,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:07,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-08 09:51:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:08,532 INFO L225 Difference]: With dead ends: 1475914 [2019-09-08 09:51:08,532 INFO L226 Difference]: Without dead ends: 1010166 [2019-09-08 09:51:08,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:51:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010166 states. [2019-09-08 09:52:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010166 to 603466. [2019-09-08 09:52:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603466 states. [2019-09-08 09:52:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603466 states to 603466 states and 864958 transitions. [2019-09-08 09:52:30,491 INFO L78 Accepts]: Start accepts. Automaton has 603466 states and 864958 transitions. Word has length 312 [2019-09-08 09:52:30,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:30,492 INFO L475 AbstractCegarLoop]: Abstraction has 603466 states and 864958 transitions. [2019-09-08 09:52:30,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:52:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 603466 states and 864958 transitions. [2019-09-08 09:52:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:52:31,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:31,065 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] [2019-09-08 09:52:31,065 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:31,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:31,066 INFO L82 PathProgramCache]: Analyzing trace with hash 139721311, now seen corresponding path program 1 times [2019-09-08 09:52:31,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:31,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:31,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:31,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:31,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:31,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:31,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:31,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:31,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:31,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:31,203 INFO L87 Difference]: Start difference. First operand 603466 states and 864958 transitions. Second operand 3 states.