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.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:13:39,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:13:39,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:13:39,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:13:39,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:13:39,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:13:39,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:13:39,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:13:39,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:13:39,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:13:39,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:13:39,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:13:39,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:13:39,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:13:39,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:13:39,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:13:39,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:13:39,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:13:39,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:13:39,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:13:39,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:13:39,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:13:39,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:13:39,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:13:39,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:13:39,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:13:39,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:13:39,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:13:39,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:13:39,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:13:39,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:13:39,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:13:39,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:13:39,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:13:39,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:13:39,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:13:39,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:13:39,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:13:39,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:13:39,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:13:39,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:13:39,483 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 10:13:39,499 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:13:39,499 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:13:39,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:13:39,501 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:13:39,501 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:13:39,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:13:39,501 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:13:39,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:13:39,502 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:13:39,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:13:39,502 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:13:39,502 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:13:39,503 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:13:39,503 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:13:39,503 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:13:39,503 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:13:39,503 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:13:39,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:13:39,504 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:13:39,504 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:13:39,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:13:39,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:13:39,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:13:39,505 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:13:39,505 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:13:39,505 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:13:39,506 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:13:39,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:13:39,506 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:13:39,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:13:39,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:13:39,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:13:39,557 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:13:39,557 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:13:39,558 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 10:13:39,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db107b2d7/ec95c71c214546ab858dc959b3119ecf/FLAG498233d47 [2019-09-08 10:13:40,423 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:13:40,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 10:13:40,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db107b2d7/ec95c71c214546ab858dc959b3119ecf/FLAG498233d47 [2019-09-08 10:13:40,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db107b2d7/ec95c71c214546ab858dc959b3119ecf [2019-09-08 10:13:40,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:13:40,489 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:13:40,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:13:40,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:13:40,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:13:40,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:13:40" (1/1) ... [2019-09-08 10:13:40,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5943fbb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:40, skipping insertion in model container [2019-09-08 10:13:40,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:13:40" (1/1) ... [2019-09-08 10:13:40,506 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:13:40,758 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:13:43,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:13:43,093 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:13:44,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:13:44,911 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:13:44,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:44 WrapperNode [2019-09-08 10:13:44,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:13:44,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:13:44,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:13:44,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:13:44,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:44" (1/1) ... [2019-09-08 10:13:44,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:44" (1/1) ... [2019-09-08 10:13:44,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:44" (1/1) ... [2019-09-08 10:13:44,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:44" (1/1) ... [2019-09-08 10:13:45,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:44" (1/1) ... [2019-09-08 10:13:45,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:44" (1/1) ... [2019-09-08 10:13:45,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:44" (1/1) ... [2019-09-08 10:13:45,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:13:45,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:13:45,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:13:45,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:13:45,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:44" (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 10:13:45,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:13:45,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:13:45,283 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:13:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:13:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:13:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:13:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:13:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:13:45,286 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:13:45,286 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:13:45,286 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:13:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:13:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:13:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:13:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 10:13:45,290 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:13:45,292 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:13:45,292 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:13:45,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:13:45,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:13:52,330 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:13:52,330 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:13:52,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:13:52 BoogieIcfgContainer [2019-09-08 10:13:52,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:13:52,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:13:52,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:13:52,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:13:52,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:13:40" (1/3) ... [2019-09-08 10:13:52,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33035b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:13:52, skipping insertion in model container [2019-09-08 10:13:52,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:44" (2/3) ... [2019-09-08 10:13:52,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33035b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:13:52, skipping insertion in model container [2019-09-08 10:13:52,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:13:52" (3/3) ... [2019-09-08 10:13:52,345 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 10:13:52,356 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:13:52,380 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 10:13:52,397 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 10:13:52,450 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:13:52,450 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:13:52,451 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:13:52,451 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:13:52,451 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:13:52,451 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:13:52,451 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:13:52,451 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:13:52,451 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:13:52,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states. [2019-09-08 10:13:52,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-08 10:13:52,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:52,556 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] [2019-09-08 10:13:52,559 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:52,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:52,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1861550886, now seen corresponding path program 1 times [2019-09-08 10:13:52,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:52,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:52,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:52,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:52,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:53,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:53,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:13:53,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:13:53,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:13:53,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:13:53,429 INFO L87 Difference]: Start difference. First operand 2249 states. Second operand 4 states. [2019-09-08 10:13:53,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:53,922 INFO L93 Difference]: Finished difference Result 3956 states and 6884 transitions. [2019-09-08 10:13:53,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:13:53,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 290 [2019-09-08 10:13:53,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:53,962 INFO L225 Difference]: With dead ends: 3956 [2019-09-08 10:13:53,963 INFO L226 Difference]: Without dead ends: 2245 [2019-09-08 10:13:53,978 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 10:13:54,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-09-08 10:13:54,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2245. [2019-09-08 10:13:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-09-08 10:13:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 3871 transitions. [2019-09-08 10:13:54,189 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 3871 transitions. Word has length 290 [2019-09-08 10:13:54,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:54,193 INFO L475 AbstractCegarLoop]: Abstraction has 2245 states and 3871 transitions. [2019-09-08 10:13:54,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:13:54,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 3871 transitions. [2019-09-08 10:13:54,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-08 10:13:54,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:54,209 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:54,210 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:54,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:54,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1372017418, now seen corresponding path program 1 times [2019-09-08 10:13:54,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:54,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:54,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:54,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:54,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:54,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:54,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:54,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:54,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:54,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:54,631 INFO L87 Difference]: Start difference. First operand 2245 states and 3871 transitions. Second operand 3 states. [2019-09-08 10:13:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:55,157 INFO L93 Difference]: Finished difference Result 5464 states and 9356 transitions. [2019-09-08 10:13:55,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:55,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2019-09-08 10:13:55,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:55,183 INFO L225 Difference]: With dead ends: 5464 [2019-09-08 10:13:55,184 INFO L226 Difference]: Without dead ends: 3801 [2019-09-08 10:13:55,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3801 states. [2019-09-08 10:13:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3801 to 3797. [2019-09-08 10:13:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2019-09-08 10:13:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 6464 transitions. [2019-09-08 10:13:55,354 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 6464 transitions. Word has length 349 [2019-09-08 10:13:55,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:55,356 INFO L475 AbstractCegarLoop]: Abstraction has 3797 states and 6464 transitions. [2019-09-08 10:13:55,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 6464 transitions. [2019-09-08 10:13:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-08 10:13:55,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:55,372 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:55,373 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:55,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:55,373 INFO L82 PathProgramCache]: Analyzing trace with hash -58772868, now seen corresponding path program 1 times [2019-09-08 10:13:55,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:55,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:55,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:55,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:55,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:55,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:55,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:55,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:55,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:55,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:55,804 INFO L87 Difference]: Start difference. First operand 3797 states and 6464 transitions. Second operand 3 states. [2019-09-08 10:13:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:56,064 INFO L93 Difference]: Finished difference Result 6370 states and 10871 transitions. [2019-09-08 10:13:56,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:56,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2019-09-08 10:13:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:56,099 INFO L225 Difference]: With dead ends: 6370 [2019-09-08 10:13:56,101 INFO L226 Difference]: Without dead ends: 4697 [2019-09-08 10:13:56,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states. [2019-09-08 10:13:56,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 4693. [2019-09-08 10:13:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4693 states. [2019-09-08 10:13:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4693 states to 4693 states and 7996 transitions. [2019-09-08 10:13:56,294 INFO L78 Accepts]: Start accepts. Automaton has 4693 states and 7996 transitions. Word has length 353 [2019-09-08 10:13:56,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:56,295 INFO L475 AbstractCegarLoop]: Abstraction has 4693 states and 7996 transitions. [2019-09-08 10:13:56,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:56,295 INFO L276 IsEmpty]: Start isEmpty. Operand 4693 states and 7996 transitions. [2019-09-08 10:13:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-08 10:13:56,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:56,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:56,312 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:56,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:56,312 INFO L82 PathProgramCache]: Analyzing trace with hash -691547991, now seen corresponding path program 1 times [2019-09-08 10:13:56,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:56,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:56,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:56,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:56,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:56,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:56,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:56,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:56,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:56,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:56,661 INFO L87 Difference]: Start difference. First operand 4693 states and 7996 transitions. Second operand 3 states. [2019-09-08 10:13:57,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:57,173 INFO L93 Difference]: Finished difference Result 12615 states and 21382 transitions. [2019-09-08 10:13:57,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:57,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 357 [2019-09-08 10:13:57,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:57,220 INFO L225 Difference]: With dead ends: 12615 [2019-09-08 10:13:57,220 INFO L226 Difference]: Without dead ends: 8527 [2019-09-08 10:13:57,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:57,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8527 states. [2019-09-08 10:13:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8527 to 8523. [2019-09-08 10:13:57,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8523 states. [2019-09-08 10:13:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8523 states to 8523 states and 14421 transitions. [2019-09-08 10:13:57,620 INFO L78 Accepts]: Start accepts. Automaton has 8523 states and 14421 transitions. Word has length 357 [2019-09-08 10:13:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:57,621 INFO L475 AbstractCegarLoop]: Abstraction has 8523 states and 14421 transitions. [2019-09-08 10:13:57,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 8523 states and 14421 transitions. [2019-09-08 10:13:57,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-09-08 10:13:57,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:57,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:57,659 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:57,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:57,660 INFO L82 PathProgramCache]: Analyzing trace with hash 127920415, now seen corresponding path program 1 times [2019-09-08 10:13:57,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:57,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:57,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:57,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:57,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:58,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:58,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:58,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:58,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:58,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:58,057 INFO L87 Difference]: Start difference. First operand 8523 states and 14421 transitions. Second operand 3 states. [2019-09-08 10:13:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:58,529 INFO L93 Difference]: Finished difference Result 15288 states and 25910 transitions. [2019-09-08 10:13:58,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:58,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 361 [2019-09-08 10:13:58,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:58,591 INFO L225 Difference]: With dead ends: 15288 [2019-09-08 10:13:58,591 INFO L226 Difference]: Without dead ends: 11190 [2019-09-08 10:13:58,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11190 states. [2019-09-08 10:13:59,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 11186. [2019-09-08 10:13:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11186 states. [2019-09-08 10:13:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11186 states to 11186 states and 18931 transitions. [2019-09-08 10:13:59,233 INFO L78 Accepts]: Start accepts. Automaton has 11186 states and 18931 transitions. Word has length 361 [2019-09-08 10:13:59,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:59,233 INFO L475 AbstractCegarLoop]: Abstraction has 11186 states and 18931 transitions. [2019-09-08 10:13:59,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 11186 states and 18931 transitions. [2019-09-08 10:13:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-08 10:13:59,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:59,265 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:59,265 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:59,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:59,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1382676078, now seen corresponding path program 1 times [2019-09-08 10:13:59,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:59,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:59,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:59,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:59,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:59,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:59,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:59,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:59,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:59,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:59,568 INFO L87 Difference]: Start difference. First operand 11186 states and 18931 transitions. Second operand 3 states. [2019-09-08 10:14:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:00,212 INFO L93 Difference]: Finished difference Result 31564 states and 53193 transitions. [2019-09-08 10:14:00,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:00,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-09-08 10:14:00,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:00,268 INFO L225 Difference]: With dead ends: 31564 [2019-09-08 10:14:00,268 INFO L226 Difference]: Without dead ends: 21006 [2019-09-08 10:14:00,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21006 states. [2019-09-08 10:14:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21006 to 21002. [2019-09-08 10:14:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21002 states. [2019-09-08 10:14:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21002 states to 21002 states and 35288 transitions. [2019-09-08 10:14:01,929 INFO L78 Accepts]: Start accepts. Automaton has 21002 states and 35288 transitions. Word has length 365 [2019-09-08 10:14:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:01,931 INFO L475 AbstractCegarLoop]: Abstraction has 21002 states and 35288 transitions. [2019-09-08 10:14:01,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 21002 states and 35288 transitions. [2019-09-08 10:14:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-09-08 10:14:01,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:01,983 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:01,983 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:01,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:01,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1632761396, now seen corresponding path program 1 times [2019-09-08 10:14:01,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:01,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:01,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:01,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:01,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:02,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:02,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:02,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:02,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:02,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:02,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:02,303 INFO L87 Difference]: Start difference. First operand 21002 states and 35288 transitions. Second operand 3 states. [2019-09-08 10:14:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:03,466 INFO L93 Difference]: Finished difference Result 38803 states and 65367 transitions. [2019-09-08 10:14:03,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:03,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 369 [2019-09-08 10:14:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:03,563 INFO L225 Difference]: With dead ends: 38803 [2019-09-08 10:14:03,563 INFO L226 Difference]: Without dead ends: 28235 [2019-09-08 10:14:03,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:03,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28235 states. [2019-09-08 10:14:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28235 to 28231. [2019-09-08 10:14:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28231 states. [2019-09-08 10:14:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28231 states to 28231 states and 47446 transitions. [2019-09-08 10:14:04,512 INFO L78 Accepts]: Start accepts. Automaton has 28231 states and 47446 transitions. Word has length 369 [2019-09-08 10:14:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:04,513 INFO L475 AbstractCegarLoop]: Abstraction has 28231 states and 47446 transitions. [2019-09-08 10:14:04,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 28231 states and 47446 transitions. [2019-09-08 10:14:04,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-08 10:14:04,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:04,579 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:04,579 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:04,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:04,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2014350559, now seen corresponding path program 1 times [2019-09-08 10:14:04,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:04,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:04,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:04,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:04,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:04,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:04,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:04,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:04,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:04,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:04,901 INFO L87 Difference]: Start difference. First operand 28231 states and 47446 transitions. Second operand 3 states. [2019-09-08 10:14:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:06,303 INFO L93 Difference]: Finished difference Result 81223 states and 135938 transitions. [2019-09-08 10:14:06,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:06,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 373 [2019-09-08 10:14:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:06,473 INFO L225 Difference]: With dead ends: 81223 [2019-09-08 10:14:06,474 INFO L226 Difference]: Without dead ends: 53643 [2019-09-08 10:14:06,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:06,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53643 states. [2019-09-08 10:14:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53643 to 53639. [2019-09-08 10:14:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53639 states. [2019-09-08 10:14:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53639 states to 53639 states and 89423 transitions. [2019-09-08 10:14:09,487 INFO L78 Accepts]: Start accepts. Automaton has 53639 states and 89423 transitions. Word has length 373 [2019-09-08 10:14:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:09,488 INFO L475 AbstractCegarLoop]: Abstraction has 53639 states and 89423 transitions. [2019-09-08 10:14:09,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:09,488 INFO L276 IsEmpty]: Start isEmpty. Operand 53639 states and 89423 transitions. [2019-09-08 10:14:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-08 10:14:09,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:09,556 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:09,557 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:09,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:09,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1625799271, now seen corresponding path program 1 times [2019-09-08 10:14:09,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:09,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:09,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:09,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:09,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:09,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:09,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:09,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:09,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:09,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:09,838 INFO L87 Difference]: Start difference. First operand 53639 states and 89423 transitions. Second operand 3 states. [2019-09-08 10:14:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:11,299 INFO L93 Difference]: Finished difference Result 100010 states and 167236 transitions. [2019-09-08 10:14:11,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:11,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 377 [2019-09-08 10:14:11,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:11,467 INFO L225 Difference]: With dead ends: 100010 [2019-09-08 10:14:11,467 INFO L226 Difference]: Without dead ends: 72420 [2019-09-08 10:14:11,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72420 states. [2019-09-08 10:14:14,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72420 to 72416. [2019-09-08 10:14:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72416 states. [2019-09-08 10:14:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72416 states to 72416 states and 120709 transitions. [2019-09-08 10:14:14,755 INFO L78 Accepts]: Start accepts. Automaton has 72416 states and 120709 transitions. Word has length 377 [2019-09-08 10:14:14,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:14,757 INFO L475 AbstractCegarLoop]: Abstraction has 72416 states and 120709 transitions. [2019-09-08 10:14:14,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:14,757 INFO L276 IsEmpty]: Start isEmpty. Operand 72416 states and 120709 transitions. [2019-09-08 10:14:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-08 10:14:14,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:14,831 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:14,831 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:14,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:14,832 INFO L82 PathProgramCache]: Analyzing trace with hash 58024986, now seen corresponding path program 1 times [2019-09-08 10:14:14,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:14,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:14,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:14,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:14,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:15,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:15,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:15,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:15,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:15,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:15,094 INFO L87 Difference]: Start difference. First operand 72416 states and 120709 transitions. Second operand 3 states. [2019-09-08 10:14:19,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:19,743 INFO L93 Difference]: Finished difference Result 209486 states and 347551 transitions. [2019-09-08 10:14:19,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:19,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2019-09-08 10:14:19,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:19,905 INFO L225 Difference]: With dead ends: 209486 [2019-09-08 10:14:19,905 INFO L226 Difference]: Without dead ends: 137744 [2019-09-08 10:14:20,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:20,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137744 states. [2019-09-08 10:14:22,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137744 to 137740. [2019-09-08 10:14:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137740 states. [2019-09-08 10:14:22,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137740 states to 137740 states and 227422 transitions. [2019-09-08 10:14:22,840 INFO L78 Accepts]: Start accepts. Automaton has 137740 states and 227422 transitions. Word has length 381 [2019-09-08 10:14:22,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:22,840 INFO L475 AbstractCegarLoop]: Abstraction has 137740 states and 227422 transitions. [2019-09-08 10:14:22,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand 137740 states and 227422 transitions. [2019-09-08 10:14:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-09-08 10:14:22,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:22,959 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:22,960 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:22,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1546574356, now seen corresponding path program 1 times [2019-09-08 10:14:22,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:22,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:22,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:22,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:22,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:23,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:23,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:23,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:23,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:23,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:23,239 INFO L87 Difference]: Start difference. First operand 137740 states and 227422 transitions. Second operand 3 states. [2019-09-08 10:14:29,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:29,667 INFO L93 Difference]: Finished difference Result 256489 states and 424821 transitions. [2019-09-08 10:14:29,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:29,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 385 [2019-09-08 10:14:29,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:29,872 INFO L225 Difference]: With dead ends: 256489 [2019-09-08 10:14:29,872 INFO L226 Difference]: Without dead ends: 184737 [2019-09-08 10:14:29,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184737 states. [2019-09-08 10:14:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184737 to 184733. [2019-09-08 10:14:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184733 states. [2019-09-08 10:14:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184733 states to 184733 states and 304688 transitions. [2019-09-08 10:14:33,752 INFO L78 Accepts]: Start accepts. Automaton has 184733 states and 304688 transitions. Word has length 385 [2019-09-08 10:14:33,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:33,753 INFO L475 AbstractCegarLoop]: Abstraction has 184733 states and 304688 transitions. [2019-09-08 10:14:33,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:33,753 INFO L276 IsEmpty]: Start isEmpty. Operand 184733 states and 304688 transitions. [2019-09-08 10:14:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-08 10:14:33,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:33,893 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:14:33,893 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:33,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:33,894 INFO L82 PathProgramCache]: Analyzing trace with hash 426553753, now seen corresponding path program 1 times [2019-09-08 10:14:33,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:33,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:33,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:33,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:33,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:14:35,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:35,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:14:35,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:14:35,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:14:35,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:14:35,596 INFO L87 Difference]: Start difference. First operand 184733 states and 304688 transitions. Second operand 7 states. [2019-09-08 10:15:22,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:22,319 INFO L93 Difference]: Finished difference Result 1370452 states and 2270452 transitions. [2019-09-08 10:15:22,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:15:22,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 389 [2019-09-08 10:15:22,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:24,633 INFO L225 Difference]: With dead ends: 1370452 [2019-09-08 10:15:24,634 INFO L226 Difference]: Without dead ends: 1186396 [2019-09-08 10:15:24,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:15:25,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186396 states. [2019-09-08 10:15:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186396 to 367634. [2019-09-08 10:15:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367634 states. [2019-09-08 10:15:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367634 states to 367634 states and 603488 transitions. [2019-09-08 10:15:55,282 INFO L78 Accepts]: Start accepts. Automaton has 367634 states and 603488 transitions. Word has length 389 [2019-09-08 10:15:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:55,282 INFO L475 AbstractCegarLoop]: Abstraction has 367634 states and 603488 transitions. [2019-09-08 10:15:55,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:15:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 367634 states and 603488 transitions. [2019-09-08 10:15:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 10:15:55,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:55,557 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:15:55,557 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:55,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:55,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1426895631, now seen corresponding path program 1 times [2019-09-08 10:15:55,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:55,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:55,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:55,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:55,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:15:55,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:55,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:15:55,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:15:55,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:15:55,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:15:55,824 INFO L87 Difference]: Start difference. First operand 367634 states and 603488 transitions. Second operand 4 states. [2019-09-08 10:16:38,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:38,671 INFO L93 Difference]: Finished difference Result 1094138 states and 1804332 transitions. [2019-09-08 10:16:38,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:16:38,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 391 [2019-09-08 10:16:38,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:39,986 INFO L225 Difference]: With dead ends: 1094138 [2019-09-08 10:16:39,987 INFO L226 Difference]: Without dead ends: 727181 [2019-09-08 10:16:40,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 10:16:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727181 states. [2019-09-08 10:17:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727181 to 607029. [2019-09-08 10:17:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607029 states. [2019-09-08 10:17:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607029 states to 607029 states and 997448 transitions. [2019-09-08 10:17:27,112 INFO L78 Accepts]: Start accepts. Automaton has 607029 states and 997448 transitions. Word has length 391 [2019-09-08 10:17:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:27,112 INFO L475 AbstractCegarLoop]: Abstraction has 607029 states and 997448 transitions. [2019-09-08 10:17:27,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:17:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 607029 states and 997448 transitions. [2019-09-08 10:17:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 10:17:27,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:27,612 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:17:27,612 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash -258916304, now seen corresponding path program 1 times [2019-09-08 10:17:27,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:27,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:27,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:27,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:27,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:27,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:27,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:17:27,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:17:27,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:17:27,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:17:27,901 INFO L87 Difference]: Start difference. First operand 607029 states and 997448 transitions. Second operand 4 states. [2019-09-08 10:18:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:43,027 INFO L93 Difference]: Finished difference Result 1799282 states and 2962185 transitions. [2019-09-08 10:18:43,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:18:43,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 392 [2019-09-08 10:18:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:45,783 INFO L225 Difference]: With dead ends: 1799282 [2019-09-08 10:18:45,783 INFO L226 Difference]: Without dead ends: 1192930 [2019-09-08 10:18:46,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 10:18:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192930 states. [2019-09-08 10:20:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192930 to 997850. [2019-09-08 10:20:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997850 states. [2019-09-08 10:20:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997850 states to 997850 states and 1635986 transitions. [2019-09-08 10:20:15,966 INFO L78 Accepts]: Start accepts. Automaton has 997850 states and 1635986 transitions. Word has length 392 [2019-09-08 10:20:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:20:15,966 INFO L475 AbstractCegarLoop]: Abstraction has 997850 states and 1635986 transitions. [2019-09-08 10:20:15,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:20:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 997850 states and 1635986 transitions. [2019-09-08 10:20:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-08 10:20:16,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:20:16,846 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:20:16,846 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:20:16,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:20:16,846 INFO L82 PathProgramCache]: Analyzing trace with hash 488934634, now seen corresponding path program 1 times [2019-09-08 10:20:16,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:20:16,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:20:16,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:16,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:20:16,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:20:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:20:18,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:20:18,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:20:18,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:20:18,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:20:18,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:20:18,668 INFO L87 Difference]: Start difference. First operand 997850 states and 1635986 transitions. Second operand 4 states. [2019-09-08 10:22:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:22:37,268 INFO L93 Difference]: Finished difference Result 2946418 states and 4840136 transitions. [2019-09-08 10:22:37,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:22:37,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 393 [2019-09-08 10:22:37,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:22:40,778 INFO L225 Difference]: With dead ends: 2946418 [2019-09-08 10:22:40,779 INFO L226 Difference]: Without dead ends: 1949245 [2019-09-08 10:22:43,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 10:22:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949245 states.