java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:29:41,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:29:41,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:29:41,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:29:41,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:29:41,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:29:41,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:29:41,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:29:41,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:29:41,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:29:41,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:29:41,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:29:41,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:29:41,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:29:41,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:29:41,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:29:41,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:29:41,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:29:41,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:29:41,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:29:41,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:29:41,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:29:41,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:29:41,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:29:41,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:29:41,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:29:41,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:29:41,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:29:41,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:29:41,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:29:41,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:29:41,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:29:41,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:29:41,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:29:41,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:29:41,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:29:41,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:29:41,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:29:41,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:29:41,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:29:41,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:29:41,587 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:29:41,610 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:29:41,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:29:41,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:29:41,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:29:41,612 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:29:41,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:29:41,612 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:29:41,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:29:41,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:29:41,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:29:41,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:29:41,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:29:41,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:29:41,614 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:29:41,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:29:41,614 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:29:41,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:29:41,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:29:41,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:29:41,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:29:41,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:29:41,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:29:41,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:29:41,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:29:41,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:29:41,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:29:41,616 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:29:41,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:29:41,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:29:41,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:29:41,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:29:41,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:29:41,662 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:29:41,663 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:29:41,663 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 13:29:41,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/296cb3001/991a73bc699e4e4081856e4cd082fa7f/FLAGe11daeb0f [2019-09-08 13:29:42,434 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:29:42,437 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 13:29:42,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/296cb3001/991a73bc699e4e4081856e4cd082fa7f/FLAGe11daeb0f [2019-09-08 13:29:42,570 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/296cb3001/991a73bc699e4e4081856e4cd082fa7f [2019-09-08 13:29:42,580 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:29:42,581 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:29:42,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:29:42,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:29:42,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:29:42,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:29:42" (1/1) ... [2019-09-08 13:29:42,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc355b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:42, skipping insertion in model container [2019-09-08 13:29:42,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:29:42" (1/1) ... [2019-09-08 13:29:42,598 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:29:42,678 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:29:43,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:29:43,344 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:29:43,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:29:43,655 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:29:43,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:43 WrapperNode [2019-09-08 13:29:43,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:29:43,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:29:43,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:29:43,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:29:43,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:43" (1/1) ... [2019-09-08 13:29:43,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:43" (1/1) ... [2019-09-08 13:29:43,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:43" (1/1) ... [2019-09-08 13:29:43,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:43" (1/1) ... [2019-09-08 13:29:43,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:43" (1/1) ... [2019-09-08 13:29:43,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:43" (1/1) ... [2019-09-08 13:29:43,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:43" (1/1) ... [2019-09-08 13:29:43,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:29:43,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:29:43,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:29:43,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:29:43,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:29:43,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:29:43,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:29:43,907 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:29:43,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:29:43,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:29:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:29:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:29:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:29:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:29:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:29:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:29:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:29:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:29:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:29:43,912 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 13:29:43,912 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:29:43,914 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:29:43,914 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:29:43,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:29:43,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:29:46,423 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:29:46,425 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:29:46,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:29:46 BoogieIcfgContainer [2019-09-08 13:29:46,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:29:46,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:29:46,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:29:46,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:29:46,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:29:42" (1/3) ... [2019-09-08 13:29:46,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4710c7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:29:46, skipping insertion in model container [2019-09-08 13:29:46,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:43" (2/3) ... [2019-09-08 13:29:46,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4710c7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:29:46, skipping insertion in model container [2019-09-08 13:29:46,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:29:46" (3/3) ... [2019-09-08 13:29:46,437 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 13:29:46,446 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:29:46,455 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:29:46,474 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:29:46,512 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:29:46,513 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:29:46,513 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:29:46,513 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:29:46,513 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:29:46,513 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:29:46,514 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:29:46,514 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:29:46,514 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:29:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states. [2019-09-08 13:29:46,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-08 13:29:46,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:46,586 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] [2019-09-08 13:29:46,588 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:46,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:46,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2089532036, now seen corresponding path program 1 times [2019-09-08 13:29:46,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:46,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:46,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:46,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:46,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:47,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:47,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:47,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:47,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:47,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:47,465 INFO L87 Difference]: Start difference. First operand 755 states. Second operand 3 states. [2019-09-08 13:29:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:47,696 INFO L93 Difference]: Finished difference Result 1187 states and 2106 transitions. [2019-09-08 13:29:47,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:47,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-09-08 13:29:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:47,734 INFO L225 Difference]: With dead ends: 1187 [2019-09-08 13:29:47,735 INFO L226 Difference]: Without dead ends: 956 [2019-09-08 13:29:47,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2019-09-08 13:29:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 954. [2019-09-08 13:29:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2019-09-08 13:29:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1666 transitions. [2019-09-08 13:29:47,873 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1666 transitions. Word has length 197 [2019-09-08 13:29:47,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:47,876 INFO L475 AbstractCegarLoop]: Abstraction has 954 states and 1666 transitions. [2019-09-08 13:29:47,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1666 transitions. [2019-09-08 13:29:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 13:29:47,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:47,891 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] [2019-09-08 13:29:47,892 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:47,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:47,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1575416457, now seen corresponding path program 1 times [2019-09-08 13:29:47,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:47,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:47,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:47,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:47,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:48,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:48,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:48,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:48,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:48,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:48,227 INFO L87 Difference]: Start difference. First operand 954 states and 1666 transitions. Second operand 3 states. [2019-09-08 13:29:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:48,297 INFO L93 Difference]: Finished difference Result 1774 states and 3050 transitions. [2019-09-08 13:29:48,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:48,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-09-08 13:29:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:48,307 INFO L225 Difference]: With dead ends: 1774 [2019-09-08 13:29:48,308 INFO L226 Difference]: Without dead ends: 1352 [2019-09-08 13:29:48,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-09-08 13:29:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1350. [2019-09-08 13:29:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1350 states. [2019-09-08 13:29:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 2333 transitions. [2019-09-08 13:29:48,372 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 2333 transitions. Word has length 201 [2019-09-08 13:29:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:48,374 INFO L475 AbstractCegarLoop]: Abstraction has 1350 states and 2333 transitions. [2019-09-08 13:29:48,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:48,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 2333 transitions. [2019-09-08 13:29:48,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 13:29:48,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:48,381 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] [2019-09-08 13:29:48,381 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:48,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:48,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1495177970, now seen corresponding path program 1 times [2019-09-08 13:29:48,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:48,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:48,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:48,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:48,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:48,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:48,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:48,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:48,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:48,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:48,622 INFO L87 Difference]: Start difference. First operand 1350 states and 2333 transitions. Second operand 3 states. [2019-09-08 13:29:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:48,723 INFO L93 Difference]: Finished difference Result 2938 states and 5007 transitions. [2019-09-08 13:29:48,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:48,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-08 13:29:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:48,739 INFO L225 Difference]: With dead ends: 2938 [2019-09-08 13:29:48,739 INFO L226 Difference]: Without dead ends: 2120 [2019-09-08 13:29:48,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:48,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2019-09-08 13:29:48,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 2118. [2019-09-08 13:29:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2118 states. [2019-09-08 13:29:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 3621 transitions. [2019-09-08 13:29:48,824 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 3621 transitions. Word has length 205 [2019-09-08 13:29:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:48,825 INFO L475 AbstractCegarLoop]: Abstraction has 2118 states and 3621 transitions. [2019-09-08 13:29:48,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 3621 transitions. [2019-09-08 13:29:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 13:29:48,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:48,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] [2019-09-08 13:29:48,832 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:48,832 INFO L82 PathProgramCache]: Analyzing trace with hash 810151187, now seen corresponding path program 1 times [2019-09-08 13:29:48,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:48,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:48,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:48,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:48,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:49,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:49,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:49,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:49,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:49,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:49,093 INFO L87 Difference]: Start difference. First operand 2118 states and 3621 transitions. Second operand 3 states. [2019-09-08 13:29:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:49,284 INFO L93 Difference]: Finished difference Result 5194 states and 8783 transitions. [2019-09-08 13:29:49,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:49,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-09-08 13:29:49,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:49,313 INFO L225 Difference]: With dead ends: 5194 [2019-09-08 13:29:49,313 INFO L226 Difference]: Without dead ends: 3608 [2019-09-08 13:29:49,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:49,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states. [2019-09-08 13:29:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 3606. [2019-09-08 13:29:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3606 states. [2019-09-08 13:29:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 6105 transitions. [2019-09-08 13:29:49,577 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 6105 transitions. Word has length 209 [2019-09-08 13:29:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:49,578 INFO L475 AbstractCegarLoop]: Abstraction has 3606 states and 6105 transitions. [2019-09-08 13:29:49,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 6105 transitions. [2019-09-08 13:29:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 13:29:49,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:49,585 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] [2019-09-08 13:29:49,585 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:49,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:49,586 INFO L82 PathProgramCache]: Analyzing trace with hash -984291944, now seen corresponding path program 1 times [2019-09-08 13:29:49,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:49,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:49,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:49,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:49,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:50,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:50,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:50,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:50,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:50,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:50,007 INFO L87 Difference]: Start difference. First operand 3606 states and 6105 transitions. Second operand 3 states. [2019-09-08 13:29:50,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:50,265 INFO L93 Difference]: Finished difference Result 9562 states and 16059 transitions. [2019-09-08 13:29:50,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:50,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-09-08 13:29:50,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:50,303 INFO L225 Difference]: With dead ends: 9562 [2019-09-08 13:29:50,303 INFO L226 Difference]: Without dead ends: 6488 [2019-09-08 13:29:50,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6488 states. [2019-09-08 13:29:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6488 to 6486. [2019-09-08 13:29:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6486 states. [2019-09-08 13:29:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6486 states to 6486 states and 10889 transitions. [2019-09-08 13:29:50,572 INFO L78 Accepts]: Start accepts. Automaton has 6486 states and 10889 transitions. Word has length 213 [2019-09-08 13:29:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:50,573 INFO L475 AbstractCegarLoop]: Abstraction has 6486 states and 10889 transitions. [2019-09-08 13:29:50,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 6486 states and 10889 transitions. [2019-09-08 13:29:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 13:29:50,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:50,581 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] [2019-09-08 13:29:50,581 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:50,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:50,582 INFO L82 PathProgramCache]: Analyzing trace with hash 823929245, now seen corresponding path program 1 times [2019-09-08 13:29:50,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:50,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:50,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:50,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:50,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:51,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:51,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:29:51,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:29:51,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:29:51,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:29:51,106 INFO L87 Difference]: Start difference. First operand 6486 states and 10889 transitions. Second operand 7 states. [2019-09-08 13:29:53,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:53,592 INFO L93 Difference]: Finished difference Result 39693 states and 66593 transitions. [2019-09-08 13:29:53,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 13:29:53,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 217 [2019-09-08 13:29:53,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:53,723 INFO L225 Difference]: With dead ends: 39693 [2019-09-08 13:29:53,723 INFO L226 Difference]: Without dead ends: 33739 [2019-09-08 13:29:53,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 13:29:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33739 states. [2019-09-08 13:29:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33739 to 12283. [2019-09-08 13:29:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12283 states. [2019-09-08 13:29:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12283 states to 12283 states and 20528 transitions. [2019-09-08 13:29:55,476 INFO L78 Accepts]: Start accepts. Automaton has 12283 states and 20528 transitions. Word has length 217 [2019-09-08 13:29:55,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:55,478 INFO L475 AbstractCegarLoop]: Abstraction has 12283 states and 20528 transitions. [2019-09-08 13:29:55,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:29:55,478 INFO L276 IsEmpty]: Start isEmpty. Operand 12283 states and 20528 transitions. [2019-09-08 13:29:55,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-08 13:29:55,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:55,493 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] [2019-09-08 13:29:55,494 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:55,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:55,494 INFO L82 PathProgramCache]: Analyzing trace with hash -298723238, now seen corresponding path program 1 times [2019-09-08 13:29:55,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:55,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:55,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:55,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:55,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:55,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:55,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:29:55,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:29:55,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:29:55,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:55,747 INFO L87 Difference]: Start difference. First operand 12283 states and 20528 transitions. Second operand 4 states. [2019-09-08 13:29:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:56,817 INFO L93 Difference]: Finished difference Result 32964 states and 55162 transitions. [2019-09-08 13:29:56,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:29:56,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-09-08 13:29:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:56,877 INFO L225 Difference]: With dead ends: 32964 [2019-09-08 13:29:56,877 INFO L226 Difference]: Without dead ends: 21213 [2019-09-08 13:29:56,908 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 13:29:56,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21213 states. [2019-09-08 13:29:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21213 to 18259. [2019-09-08 13:29:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18259 states. [2019-09-08 13:29:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18259 states to 18259 states and 30524 transitions. [2019-09-08 13:29:58,118 INFO L78 Accepts]: Start accepts. Automaton has 18259 states and 30524 transitions. Word has length 218 [2019-09-08 13:29:58,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:58,118 INFO L475 AbstractCegarLoop]: Abstraction has 18259 states and 30524 transitions. [2019-09-08 13:29:58,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:29:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 18259 states and 30524 transitions. [2019-09-08 13:29:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 13:29:58,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:58,132 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] [2019-09-08 13:29:58,133 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:58,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:58,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1824874093, now seen corresponding path program 1 times [2019-09-08 13:29:58,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:58,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:58,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:58,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:58,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:58,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:58,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:58,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:58,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:58,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:58,347 INFO L87 Difference]: Start difference. First operand 18259 states and 30524 transitions. Second operand 3 states. [2019-09-08 13:30:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:00,193 INFO L93 Difference]: Finished difference Result 35287 states and 58975 transitions. [2019-09-08 13:30:00,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:00,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-08 13:30:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:00,254 INFO L225 Difference]: With dead ends: 35287 [2019-09-08 13:30:00,255 INFO L226 Difference]: Without dead ends: 25973 [2019-09-08 13:30:00,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25973 states. [2019-09-08 13:30:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25973 to 25971. [2019-09-08 13:30:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25971 states. [2019-09-08 13:30:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25971 states to 25971 states and 43315 transitions. [2019-09-08 13:30:01,597 INFO L78 Accepts]: Start accepts. Automaton has 25971 states and 43315 transitions. Word has length 219 [2019-09-08 13:30:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:01,598 INFO L475 AbstractCegarLoop]: Abstraction has 25971 states and 43315 transitions. [2019-09-08 13:30:01,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:01,598 INFO L276 IsEmpty]: Start isEmpty. Operand 25971 states and 43315 transitions. [2019-09-08 13:30:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 13:30:01,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:01,606 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] [2019-09-08 13:30:01,607 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:01,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:01,607 INFO L82 PathProgramCache]: Analyzing trace with hash -736653820, now seen corresponding path program 1 times [2019-09-08 13:30:01,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:01,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:01,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:01,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:01,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:01,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:01,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:30:01,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:30:01,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:30:01,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:30:01,799 INFO L87 Difference]: Start difference. First operand 25971 states and 43315 transitions. Second operand 4 states. [2019-09-08 13:30:03,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:03,534 INFO L93 Difference]: Finished difference Result 70311 states and 117362 transitions. [2019-09-08 13:30:03,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:30:03,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-09-08 13:30:03,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:03,690 INFO L225 Difference]: With dead ends: 70311 [2019-09-08 13:30:03,691 INFO L226 Difference]: Without dead ends: 45096 [2019-09-08 13:30:03,756 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 13:30:03,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45096 states. [2019-09-08 13:30:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45096 to 38766. [2019-09-08 13:30:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38766 states. [2019-09-08 13:30:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38766 states to 38766 states and 64568 transitions. [2019-09-08 13:30:06,438 INFO L78 Accepts]: Start accepts. Automaton has 38766 states and 64568 transitions. Word has length 219 [2019-09-08 13:30:06,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:06,438 INFO L475 AbstractCegarLoop]: Abstraction has 38766 states and 64568 transitions. [2019-09-08 13:30:06,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:30:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 38766 states and 64568 transitions. [2019-09-08 13:30:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 13:30:06,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:06,449 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] [2019-09-08 13:30:06,449 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:06,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:06,450 INFO L82 PathProgramCache]: Analyzing trace with hash -844487873, now seen corresponding path program 1 times [2019-09-08 13:30:06,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:06,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:06,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:06,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:06,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:06,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:06,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:06,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:06,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:06,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:06,643 INFO L87 Difference]: Start difference. First operand 38766 states and 64568 transitions. Second operand 3 states. [2019-09-08 13:30:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:08,232 INFO L93 Difference]: Finished difference Result 75618 states and 125992 transitions. [2019-09-08 13:30:08,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:08,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-08 13:30:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:08,336 INFO L225 Difference]: With dead ends: 75618 [2019-09-08 13:30:08,342 INFO L226 Difference]: Without dead ends: 55636 [2019-09-08 13:30:08,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55636 states. [2019-09-08 13:30:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55636 to 55634. [2019-09-08 13:30:10,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55634 states. [2019-09-08 13:30:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55634 states to 55634 states and 92442 transitions. [2019-09-08 13:30:12,496 INFO L78 Accepts]: Start accepts. Automaton has 55634 states and 92442 transitions. Word has length 219 [2019-09-08 13:30:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:12,499 INFO L475 AbstractCegarLoop]: Abstraction has 55634 states and 92442 transitions. [2019-09-08 13:30:12,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand 55634 states and 92442 transitions. [2019-09-08 13:30:12,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 13:30:12,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:12,506 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] [2019-09-08 13:30:12,506 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:12,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:12,506 INFO L82 PathProgramCache]: Analyzing trace with hash 486886825, now seen corresponding path program 1 times [2019-09-08 13:30:12,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:12,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:12,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:12,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:12,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:12,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:12,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:12,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:12,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:12,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:12,689 INFO L87 Difference]: Start difference. First operand 55634 states and 92442 transitions. Second operand 3 states. [2019-09-08 13:30:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:14,970 INFO L93 Difference]: Finished difference Result 105966 states and 176252 transitions. [2019-09-08 13:30:14,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:14,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-08 13:30:14,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:15,085 INFO L225 Difference]: With dead ends: 105966 [2019-09-08 13:30:15,086 INFO L226 Difference]: Without dead ends: 77514 [2019-09-08 13:30:15,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77514 states. [2019-09-08 13:30:17,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77514 to 77512. [2019-09-08 13:30:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77512 states. [2019-09-08 13:30:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77512 states to 77512 states and 128557 transitions. [2019-09-08 13:30:17,847 INFO L78 Accepts]: Start accepts. Automaton has 77512 states and 128557 transitions. Word has length 219 [2019-09-08 13:30:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:17,848 INFO L475 AbstractCegarLoop]: Abstraction has 77512 states and 128557 transitions. [2019-09-08 13:30:17,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 77512 states and 128557 transitions. [2019-09-08 13:30:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 13:30:17,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:17,853 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] [2019-09-08 13:30:17,853 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:17,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1688018685, now seen corresponding path program 1 times [2019-09-08 13:30:17,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:17,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:17,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:17,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:17,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:18,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:18,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:18,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:18,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:18,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:18,015 INFO L87 Difference]: Start difference. First operand 77512 states and 128557 transitions. Second operand 3 states. [2019-09-08 13:30:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:22,854 INFO L93 Difference]: Finished difference Result 169402 states and 281131 transitions. [2019-09-08 13:30:22,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:22,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-08 13:30:22,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:23,036 INFO L225 Difference]: With dead ends: 169402 [2019-09-08 13:30:23,036 INFO L226 Difference]: Without dead ends: 116785 [2019-09-08 13:30:23,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:23,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116785 states. [2019-09-08 13:30:26,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116785 to 116783. [2019-09-08 13:30:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116783 states. [2019-09-08 13:30:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116783 states to 116783 states and 193218 transitions. [2019-09-08 13:30:29,856 INFO L78 Accepts]: Start accepts. Automaton has 116783 states and 193218 transitions. Word has length 219 [2019-09-08 13:30:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:29,856 INFO L475 AbstractCegarLoop]: Abstraction has 116783 states and 193218 transitions. [2019-09-08 13:30:29,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 116783 states and 193218 transitions. [2019-09-08 13:30:29,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 13:30:29,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:29,860 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] [2019-09-08 13:30:29,861 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:29,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1711261159, now seen corresponding path program 1 times [2019-09-08 13:30:29,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:29,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:29,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:29,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:29,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:30,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:30,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:30,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:30,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:30,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:30,036 INFO L87 Difference]: Start difference. First operand 116783 states and 193218 transitions. Second operand 3 states. [2019-09-08 13:30:36,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:36,004 INFO L93 Difference]: Finished difference Result 256266 states and 425617 transitions. [2019-09-08 13:30:36,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:36,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-08 13:30:36,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:36,461 INFO L225 Difference]: With dead ends: 256266 [2019-09-08 13:30:36,461 INFO L226 Difference]: Without dead ends: 176183 [2019-09-08 13:30:36,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:36,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176183 states. [2019-09-08 13:30:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176183 to 176181. [2019-09-08 13:30:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176181 states. [2019-09-08 13:30:46,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176181 states to 176181 states and 291267 transitions. [2019-09-08 13:30:46,019 INFO L78 Accepts]: Start accepts. Automaton has 176181 states and 291267 transitions. Word has length 219 [2019-09-08 13:30:46,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:46,020 INFO L475 AbstractCegarLoop]: Abstraction has 176181 states and 291267 transitions. [2019-09-08 13:30:46,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 176181 states and 291267 transitions. [2019-09-08 13:30:46,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 13:30:46,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:46,022 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] [2019-09-08 13:30:46,023 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:46,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:46,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1423041951, now seen corresponding path program 1 times [2019-09-08 13:30:46,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:46,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:46,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:46,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:46,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:46,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:46,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:30:46,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:30:46,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:30:46,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:30:46,252 INFO L87 Difference]: Start difference. First operand 176181 states and 291267 transitions. Second operand 4 states. [2019-09-08 13:31:01,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:01,328 INFO L93 Difference]: Finished difference Result 522912 states and 865488 transitions. [2019-09-08 13:31:01,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:31:01,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-09-08 13:31:01,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:02,162 INFO L225 Difference]: With dead ends: 522912 [2019-09-08 13:31:02,162 INFO L226 Difference]: Without dead ends: 347377 [2019-09-08 13:31:02,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:31:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347377 states. [2019-09-08 13:31:20,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347377 to 289032. [2019-09-08 13:31:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289032 states. [2019-09-08 13:31:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289032 states to 289032 states and 476814 transitions. [2019-09-08 13:31:21,385 INFO L78 Accepts]: Start accepts. Automaton has 289032 states and 476814 transitions. Word has length 220 [2019-09-08 13:31:21,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:21,386 INFO L475 AbstractCegarLoop]: Abstraction has 289032 states and 476814 transitions. [2019-09-08 13:31:21,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:31:21,386 INFO L276 IsEmpty]: Start isEmpty. Operand 289032 states and 476814 transitions. [2019-09-08 13:31:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 13:31:21,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:21,388 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] [2019-09-08 13:31:21,388 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:21,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:21,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1221679509, now seen corresponding path program 1 times [2019-09-08 13:31:21,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:21,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:21,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:21,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:21,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:31:21,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:21,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:31:21,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:31:21,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:31:21,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:31:21,561 INFO L87 Difference]: Start difference. First operand 289032 states and 476814 transitions. Second operand 4 states. [2019-09-08 13:31:48,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:48,851 INFO L93 Difference]: Finished difference Result 849864 states and 1403862 transitions. [2019-09-08 13:31:48,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:31:48,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-09-08 13:31:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:56,511 INFO L225 Difference]: With dead ends: 849864 [2019-09-08 13:31:56,512 INFO L226 Difference]: Without dead ends: 561478 [2019-09-08 13:31:56,747 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 13:31:57,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561478 states. [2019-09-08 13:32:23,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561478 to 472355. [2019-09-08 13:32:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472355 states. [2019-09-08 13:32:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472355 states to 472355 states and 777605 transitions. [2019-09-08 13:32:24,595 INFO L78 Accepts]: Start accepts. Automaton has 472355 states and 777605 transitions. Word has length 221 [2019-09-08 13:32:24,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:24,595 INFO L475 AbstractCegarLoop]: Abstraction has 472355 states and 777605 transitions. [2019-09-08 13:32:24,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:32:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 472355 states and 777605 transitions. [2019-09-08 13:32:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 13:32:24,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:24,597 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] [2019-09-08 13:32:24,598 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:24,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:24,598 INFO L82 PathProgramCache]: Analyzing trace with hash 730146920, now seen corresponding path program 1 times [2019-09-08 13:32:24,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:24,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:24,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:24,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:24,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:24,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:24,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:32:24,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:32:24,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:32:24,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:32:24,860 INFO L87 Difference]: Start difference. First operand 472355 states and 777605 transitions. Second operand 8 states. [2019-09-08 13:34:52,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:34:52,036 INFO L93 Difference]: Finished difference Result 2612940 states and 4310765 transitions. [2019-09-08 13:34:52,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 13:34:52,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 222 [2019-09-08 13:34:52,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:34:56,611 INFO L225 Difference]: With dead ends: 2612940 [2019-09-08 13:34:56,611 INFO L226 Difference]: Without dead ends: 2141231 [2019-09-08 13:34:57,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-08 13:34:59,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141231 states.