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.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:37:22,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:37:22,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:37:22,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:37:22,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:37:22,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:37:22,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:37:22,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:37:22,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:37:22,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:37:22,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:37:22,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:37:22,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:37:22,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:37:22,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:37:22,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:37:22,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:37:22,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:37:22,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:37:22,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:37:22,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:37:22,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:37:22,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:37:22,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:37:22,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:37:22,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:37:22,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:37:22,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:37:22,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:37:22,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:37:22,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:37:22,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:37:22,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:37:22,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:37:22,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:37:22,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:37:22,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:37:22,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:37:22,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:37:22,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:37:22,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:37:22,463 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:37:22,492 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:37:22,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:37:22,494 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:37:22,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:37:22,495 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:37:22,495 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:37:22,496 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:37:22,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:37:22,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:37:22,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:37:22,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:37:22,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:37:22,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:37:22,498 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:37:22,499 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:37:22,499 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:37:22,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:37:22,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:37:22,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:37:22,500 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:37:22,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:37:22,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:37:22,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:37:22,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:37:22,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:37:22,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:37:22,502 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:37:22,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:37:22,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:37:22,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:37:22,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:37:22,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:37:22,564 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:37:22,565 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:37:22,565 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.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 13:37:22,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e217fc96/f6cd35319f144e82bb14dfb6fd8379e5/FLAG0febbda6a [2019-09-08 13:37:23,363 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:37:23,367 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 13:37:23,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e217fc96/f6cd35319f144e82bb14dfb6fd8379e5/FLAG0febbda6a [2019-09-08 13:37:23,478 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e217fc96/f6cd35319f144e82bb14dfb6fd8379e5 [2019-09-08 13:37:23,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:37:23,494 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:37:23,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:37:23,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:37:23,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:37:23,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:37:23" (1/1) ... [2019-09-08 13:37:23,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5943fbb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:23, skipping insertion in model container [2019-09-08 13:37:23,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:37:23" (1/1) ... [2019-09-08 13:37:23,511 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:37:23,611 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:37:24,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:37:24,352 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:37:24,738 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:37:24,775 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:37:24,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:24 WrapperNode [2019-09-08 13:37:24,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:37:24,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:37:24,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:37:24,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:37:24,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:24" (1/1) ... [2019-09-08 13:37:24,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:24" (1/1) ... [2019-09-08 13:37:24,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:24" (1/1) ... [2019-09-08 13:37:24,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:24" (1/1) ... [2019-09-08 13:37:24,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:24" (1/1) ... [2019-09-08 13:37:24,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:24" (1/1) ... [2019-09-08 13:37:24,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:24" (1/1) ... [2019-09-08 13:37:24,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:37:24,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:37:24,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:37:24,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:37:24,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:24" (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:37:25,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:37:25,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:37:25,020 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:37:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:37:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:37:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:37:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:37:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:37:25,022 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:37:25,022 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:37:25,022 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:37:25,022 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:37:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:37:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:37:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 13:37:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:37:25,023 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:37:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:37:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:37:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:37:27,708 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:37:27,709 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:37:27,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:37:27 BoogieIcfgContainer [2019-09-08 13:37:27,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:37:27,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:37:27,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:37:27,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:37:27,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:37:23" (1/3) ... [2019-09-08 13:37:27,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421e690b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:37:27, skipping insertion in model container [2019-09-08 13:37:27,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:24" (2/3) ... [2019-09-08 13:37:27,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421e690b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:37:27, skipping insertion in model container [2019-09-08 13:37:27,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:37:27" (3/3) ... [2019-09-08 13:37:27,721 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 13:37:27,732 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:37:27,742 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:37:27,758 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:37:27,797 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:37:27,798 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:37:27,798 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:37:27,798 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:37:27,798 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:37:27,798 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:37:27,798 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:37:27,799 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:37:27,799 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:37:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2019-09-08 13:37:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 13:37:27,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:27,871 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:37:27,873 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:27,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:27,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1832108402, now seen corresponding path program 1 times [2019-09-08 13:37:27,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:27,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:27,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:27,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:27,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:28,748 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:37:28,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:28,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:28,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:28,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:28,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:28,774 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2019-09-08 13:37:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:29,016 INFO L93 Difference]: Finished difference Result 1207 states and 2146 transitions. [2019-09-08 13:37:29,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:29,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-08 13:37:29,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:29,054 INFO L225 Difference]: With dead ends: 1207 [2019-09-08 13:37:29,054 INFO L226 Difference]: Without dead ends: 976 [2019-09-08 13:37:29,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-09-08 13:37:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 974. [2019-09-08 13:37:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-09-08 13:37:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1686 transitions. [2019-09-08 13:37:29,284 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1686 transitions. Word has length 217 [2019-09-08 13:37:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:29,286 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1686 transitions. [2019-09-08 13:37:29,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:29,286 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1686 transitions. [2019-09-08 13:37:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 13:37:29,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:29,295 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:37:29,295 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:29,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:29,296 INFO L82 PathProgramCache]: Analyzing trace with hash 475136375, now seen corresponding path program 1 times [2019-09-08 13:37:29,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:29,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:29,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:29,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:29,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:29,647 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:37:29,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:29,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:29,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:29,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:29,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:29,655 INFO L87 Difference]: Start difference. First operand 974 states and 1686 transitions. Second operand 3 states. [2019-09-08 13:37:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:29,760 INFO L93 Difference]: Finished difference Result 1794 states and 3070 transitions. [2019-09-08 13:37:29,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:29,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-09-08 13:37:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:29,777 INFO L225 Difference]: With dead ends: 1794 [2019-09-08 13:37:29,778 INFO L226 Difference]: Without dead ends: 1372 [2019-09-08 13:37:29,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-09-08 13:37:29,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1370. [2019-09-08 13:37:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2019-09-08 13:37:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2353 transitions. [2019-09-08 13:37:29,880 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2353 transitions. Word has length 221 [2019-09-08 13:37:29,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:29,882 INFO L475 AbstractCegarLoop]: Abstraction has 1370 states and 2353 transitions. [2019-09-08 13:37:29,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2353 transitions. [2019-09-08 13:37:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 13:37:29,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:29,896 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:29,896 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:29,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:29,897 INFO L82 PathProgramCache]: Analyzing trace with hash 172719100, now seen corresponding path program 1 times [2019-09-08 13:37:29,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:29,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:29,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:29,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:30,368 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:37:30,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:30,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:30,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:30,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:30,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:30,373 INFO L87 Difference]: Start difference. First operand 1370 states and 2353 transitions. Second operand 3 states. [2019-09-08 13:37:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:30,595 INFO L93 Difference]: Finished difference Result 2958 states and 5027 transitions. [2019-09-08 13:37:30,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:30,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-08 13:37:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:30,613 INFO L225 Difference]: With dead ends: 2958 [2019-09-08 13:37:30,615 INFO L226 Difference]: Without dead ends: 2140 [2019-09-08 13:37:30,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:30,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-09-08 13:37:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2138. [2019-09-08 13:37:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-09-08 13:37:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3641 transitions. [2019-09-08 13:37:30,715 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3641 transitions. Word has length 225 [2019-09-08 13:37:30,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:30,716 INFO L475 AbstractCegarLoop]: Abstraction has 2138 states and 3641 transitions. [2019-09-08 13:37:30,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3641 transitions. [2019-09-08 13:37:30,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 13:37:30,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:30,723 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:30,723 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:30,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:30,723 INFO L82 PathProgramCache]: Analyzing trace with hash 300878849, now seen corresponding path program 1 times [2019-09-08 13:37:30,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:30,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:30,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:30,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:30,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:30,990 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:37:30,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:30,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:30,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:30,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:30,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:30,992 INFO L87 Difference]: Start difference. First operand 2138 states and 3641 transitions. Second operand 3 states. [2019-09-08 13:37:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:31,142 INFO L93 Difference]: Finished difference Result 5214 states and 8803 transitions. [2019-09-08 13:37:31,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:31,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-08 13:37:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:31,162 INFO L225 Difference]: With dead ends: 5214 [2019-09-08 13:37:31,163 INFO L226 Difference]: Without dead ends: 3628 [2019-09-08 13:37:31,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:31,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2019-09-08 13:37:31,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 3626. [2019-09-08 13:37:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3626 states. [2019-09-08 13:37:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 6125 transitions. [2019-09-08 13:37:31,335 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 6125 transitions. Word has length 229 [2019-09-08 13:37:31,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:31,336 INFO L475 AbstractCegarLoop]: Abstraction has 3626 states and 6125 transitions. [2019-09-08 13:37:31,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 6125 transitions. [2019-09-08 13:37:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 13:37:31,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:31,344 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:31,344 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:31,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:31,344 INFO L82 PathProgramCache]: Analyzing trace with hash 7408774, now seen corresponding path program 1 times [2019-09-08 13:37:31,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:31,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:31,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:31,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:31,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:31,691 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:37:31,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:31,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:31,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:31,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:31,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:31,694 INFO L87 Difference]: Start difference. First operand 3626 states and 6125 transitions. Second operand 3 states. [2019-09-08 13:37:32,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:32,039 INFO L93 Difference]: Finished difference Result 9582 states and 16079 transitions. [2019-09-08 13:37:32,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:32,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-08 13:37:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:32,075 INFO L225 Difference]: With dead ends: 9582 [2019-09-08 13:37:32,076 INFO L226 Difference]: Without dead ends: 6508 [2019-09-08 13:37:32,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2019-09-08 13:37:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6506. [2019-09-08 13:37:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2019-09-08 13:37:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 10909 transitions. [2019-09-08 13:37:32,408 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 10909 transitions. Word has length 233 [2019-09-08 13:37:32,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:32,409 INFO L475 AbstractCegarLoop]: Abstraction has 6506 states and 10909 transitions. [2019-09-08 13:37:32,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:32,409 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 10909 transitions. [2019-09-08 13:37:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 13:37:32,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:32,418 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:32,418 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:32,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:32,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1561634677, now seen corresponding path program 1 times [2019-09-08 13:37:32,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:32,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:32,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:32,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:32,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:33,043 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:37:33,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:33,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:37:33,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:37:33,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:37:33,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:37:33,046 INFO L87 Difference]: Start difference. First operand 6506 states and 10909 transitions. Second operand 7 states. [2019-09-08 13:37:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:35,673 INFO L93 Difference]: Finished difference Result 39713 states and 66613 transitions. [2019-09-08 13:37:35,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 13:37:35,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 237 [2019-09-08 13:37:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:35,820 INFO L225 Difference]: With dead ends: 39713 [2019-09-08 13:37:35,821 INFO L226 Difference]: Without dead ends: 33759 [2019-09-08 13:37:35,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 13:37:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33759 states. [2019-09-08 13:37:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33759 to 12303. [2019-09-08 13:37:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12303 states. [2019-09-08 13:37:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12303 states to 12303 states and 20548 transitions. [2019-09-08 13:37:37,595 INFO L78 Accepts]: Start accepts. Automaton has 12303 states and 20548 transitions. Word has length 237 [2019-09-08 13:37:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:37,596 INFO L475 AbstractCegarLoop]: Abstraction has 12303 states and 20548 transitions. [2019-09-08 13:37:37,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:37:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 12303 states and 20548 transitions. [2019-09-08 13:37:37,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 13:37:37,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:37,609 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:37,609 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:37,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:37,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1236760728, now seen corresponding path program 1 times [2019-09-08 13:37:37,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:37,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:37,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:37,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:37,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:37,875 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:37:37,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:37,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:37:37,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:37:37,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:37:37,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:37:37,878 INFO L87 Difference]: Start difference. First operand 12303 states and 20548 transitions. Second operand 4 states. [2019-09-08 13:37:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:39,355 INFO L93 Difference]: Finished difference Result 32984 states and 55182 transitions. [2019-09-08 13:37:39,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:37:39,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-08 13:37:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:39,418 INFO L225 Difference]: With dead ends: 32984 [2019-09-08 13:37:39,419 INFO L226 Difference]: Without dead ends: 21233 [2019-09-08 13:37:39,451 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:37:39,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21233 states. [2019-09-08 13:37:40,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21233 to 18279. [2019-09-08 13:37:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18279 states. [2019-09-08 13:37:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18279 states to 18279 states and 30544 transitions. [2019-09-08 13:37:40,832 INFO L78 Accepts]: Start accepts. Automaton has 18279 states and 30544 transitions. Word has length 238 [2019-09-08 13:37:40,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:40,832 INFO L475 AbstractCegarLoop]: Abstraction has 18279 states and 30544 transitions. [2019-09-08 13:37:40,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:37:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 18279 states and 30544 transitions. [2019-09-08 13:37:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:37:40,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:40,848 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:40,849 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:40,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:40,849 INFO L82 PathProgramCache]: Analyzing trace with hash -626801516, now seen corresponding path program 1 times [2019-09-08 13:37:40,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:40,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:40,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:40,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:40,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:41,112 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:37:41,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:41,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:41,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:41,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:41,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:41,116 INFO L87 Difference]: Start difference. First operand 18279 states and 30544 transitions. Second operand 3 states. [2019-09-08 13:37:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:42,965 INFO L93 Difference]: Finished difference Result 40226 states and 67370 transitions. [2019-09-08 13:37:42,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:42,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 13:37:42,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:43,048 INFO L225 Difference]: With dead ends: 40226 [2019-09-08 13:37:43,048 INFO L226 Difference]: Without dead ends: 28072 [2019-09-08 13:37:43,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28072 states. [2019-09-08 13:37:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28072 to 28070. [2019-09-08 13:37:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28070 states. [2019-09-08 13:37:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28070 states to 28070 states and 46877 transitions. [2019-09-08 13:37:44,760 INFO L78 Accepts]: Start accepts. Automaton has 28070 states and 46877 transitions. Word has length 239 [2019-09-08 13:37:44,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:44,760 INFO L475 AbstractCegarLoop]: Abstraction has 28070 states and 46877 transitions. [2019-09-08 13:37:44,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 28070 states and 46877 transitions. [2019-09-08 13:37:44,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:37:44,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:44,769 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:44,769 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:44,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1621339669, now seen corresponding path program 1 times [2019-09-08 13:37:44,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:44,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:44,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:44,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:44,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:44,974 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:37:44,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:44,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:44,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:44,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:44,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:44,977 INFO L87 Difference]: Start difference. First operand 28070 states and 46877 transitions. Second operand 3 states. [2019-09-08 13:37:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:46,295 INFO L93 Difference]: Finished difference Result 53990 states and 90204 transitions. [2019-09-08 13:37:46,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:46,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 13:37:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:46,413 INFO L225 Difference]: With dead ends: 53990 [2019-09-08 13:37:46,413 INFO L226 Difference]: Without dead ends: 39524 [2019-09-08 13:37:46,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39524 states. [2019-09-08 13:37:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39524 to 39522. [2019-09-08 13:37:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39522 states. [2019-09-08 13:37:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39522 states to 39522 states and 65881 transitions. [2019-09-08 13:37:49,450 INFO L78 Accepts]: Start accepts. Automaton has 39522 states and 65881 transitions. Word has length 239 [2019-09-08 13:37:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:49,450 INFO L475 AbstractCegarLoop]: Abstraction has 39522 states and 65881 transitions. [2019-09-08 13:37:49,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 39522 states and 65881 transitions. [2019-09-08 13:37:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:37:49,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:49,456 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:49,456 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:49,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:49,457 INFO L82 PathProgramCache]: Analyzing trace with hash -839265151, now seen corresponding path program 1 times [2019-09-08 13:37:49,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:49,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:49,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:49,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:49,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:49,646 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:37:49,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:49,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:49,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:49,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:49,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:49,648 INFO L87 Difference]: Start difference. First operand 39522 states and 65881 transitions. Second operand 3 states. [2019-09-08 13:37:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:51,281 INFO L93 Difference]: Finished difference Result 75826 states and 126488 transitions. [2019-09-08 13:37:51,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:51,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 13:37:51,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:51,389 INFO L225 Difference]: With dead ends: 75826 [2019-09-08 13:37:51,390 INFO L226 Difference]: Without dead ends: 55408 [2019-09-08 13:37:51,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:51,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55408 states. [2019-09-08 13:37:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55408 to 55406. [2019-09-08 13:37:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55406 states. [2019-09-08 13:37:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55406 states to 55406 states and 92185 transitions. [2019-09-08 13:37:53,514 INFO L78 Accepts]: Start accepts. Automaton has 55406 states and 92185 transitions. Word has length 239 [2019-09-08 13:37:53,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:53,515 INFO L475 AbstractCegarLoop]: Abstraction has 55406 states and 92185 transitions. [2019-09-08 13:37:53,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 55406 states and 92185 transitions. [2019-09-08 13:37:53,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:37:53,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:53,518 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:37:53,519 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:53,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:53,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1472495767, now seen corresponding path program 1 times [2019-09-08 13:37:53,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:53,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:53,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:53,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:53,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:53,729 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:37:53,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:53,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:53,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:53,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:53,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:53,731 INFO L87 Difference]: Start difference. First operand 55406 states and 92185 transitions. Second operand 3 states. [2019-09-08 13:37:56,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:56,988 INFO L93 Difference]: Finished difference Result 106006 states and 176532 transitions. [2019-09-08 13:37:56,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:56,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 13:37:56,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:57,115 INFO L225 Difference]: With dead ends: 106006 [2019-09-08 13:37:57,115 INFO L226 Difference]: Without dead ends: 77300 [2019-09-08 13:37:57,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:57,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77300 states. [2019-09-08 13:37:59,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77300 to 77298. [2019-09-08 13:37:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77298 states. [2019-09-08 13:38:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77298 states to 77298 states and 128349 transitions. [2019-09-08 13:38:00,098 INFO L78 Accepts]: Start accepts. Automaton has 77298 states and 128349 transitions. Word has length 239 [2019-09-08 13:38:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:38:00,099 INFO L475 AbstractCegarLoop]: Abstraction has 77298 states and 128349 transitions. [2019-09-08 13:38:00,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:38:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 77298 states and 128349 transitions. [2019-09-08 13:38:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:38:00,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:38:00,103 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:38:00,104 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:38:00,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:38:00,104 INFO L82 PathProgramCache]: Analyzing trace with hash 141121069, now seen corresponding path program 1 times [2019-09-08 13:38:00,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:38:00,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:38:00,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:00,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:38:00,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:38:00,293 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:38:00,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:38:00,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:38:00,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:38:00,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:38:00,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:38:00,295 INFO L87 Difference]: Start difference. First operand 77298 states and 128349 transitions. Second operand 3 states. [2019-09-08 13:38:05,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:05,034 INFO L93 Difference]: Finished difference Result 147422 states and 245036 transitions. [2019-09-08 13:38:05,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:38:05,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 13:38:05,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:05,224 INFO L225 Difference]: With dead ends: 147422 [2019-09-08 13:38:05,225 INFO L226 Difference]: Without dead ends: 107244 [2019-09-08 13:38:05,295 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:38:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107244 states. [2019-09-08 13:38:08,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107244 to 107242. [2019-09-08 13:38:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107242 states. [2019-09-08 13:38:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107242 states to 107242 states and 177668 transitions. [2019-09-08 13:38:08,786 INFO L78 Accepts]: Start accepts. Automaton has 107242 states and 177668 transitions. Word has length 239 [2019-09-08 13:38:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:38:08,786 INFO L475 AbstractCegarLoop]: Abstraction has 107242 states and 177668 transitions. [2019-09-08 13:38:08,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:38:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 107242 states and 177668 transitions. [2019-09-08 13:38:08,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:38:08,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:38:08,788 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:38:08,788 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:38:08,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:38:08,789 INFO L82 PathProgramCache]: Analyzing trace with hash 248955122, now seen corresponding path program 1 times [2019-09-08 13:38:08,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:38:08,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:38:08,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:08,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:38:08,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:38:09,026 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:38:09,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:38:09,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:38:09,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:38:09,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:38:09,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:38:09,028 INFO L87 Difference]: Start difference. First operand 107242 states and 177668 transitions. Second operand 4 states. [2019-09-08 13:38:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:18,206 INFO L93 Difference]: Finished difference Result 317228 states and 526154 transitions. [2019-09-08 13:38:18,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:38:18,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-08 13:38:18,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:18,574 INFO L225 Difference]: With dead ends: 317228 [2019-09-08 13:38:18,574 INFO L226 Difference]: Without dead ends: 210652 [2019-09-08 13:38:18,683 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:38:18,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210652 states. [2019-09-08 13:38:27,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210652 to 176201. [2019-09-08 13:38:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176201 states. [2019-09-08 13:38:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176201 states to 176201 states and 291287 transitions. [2019-09-08 13:38:28,289 INFO L78 Accepts]: Start accepts. Automaton has 176201 states and 291287 transitions. Word has length 239 [2019-09-08 13:38:28,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:38:28,290 INFO L475 AbstractCegarLoop]: Abstraction has 176201 states and 291287 transitions. [2019-09-08 13:38:28,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:38:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 176201 states and 291287 transitions. [2019-09-08 13:38:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 13:38:28,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:38:28,292 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:38:28,292 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:38:28,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:38:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash -933935761, now seen corresponding path program 1 times [2019-09-08 13:38:28,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:38:28,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:38:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:28,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:38:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:38:28,569 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:38:28,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:38:28,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:38:28,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:38:28,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:38:28,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:38:28,571 INFO L87 Difference]: Start difference. First operand 176201 states and 291287 transitions. Second operand 4 states. [2019-09-08 13:38:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:44,620 INFO L93 Difference]: Finished difference Result 522932 states and 865508 transitions. [2019-09-08 13:38:44,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:38:44,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-08 13:38:44,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:45,166 INFO L225 Difference]: With dead ends: 522932 [2019-09-08 13:38:45,166 INFO L226 Difference]: Without dead ends: 347397 [2019-09-08 13:38:45,319 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:38:45,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347397 states. [2019-09-08 13:39:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347397 to 289052. [2019-09-08 13:39:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289052 states. [2019-09-08 13:39:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289052 states to 289052 states and 476834 transitions. [2019-09-08 13:39:03,530 INFO L78 Accepts]: Start accepts. Automaton has 289052 states and 476834 transitions. Word has length 240 [2019-09-08 13:39:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:03,530 INFO L475 AbstractCegarLoop]: Abstraction has 289052 states and 476834 transitions. [2019-09-08 13:39:03,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:39:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 289052 states and 476834 transitions. [2019-09-08 13:39:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 13:39:03,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:03,532 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:39:03,532 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:03,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:03,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1055710553, now seen corresponding path program 1 times [2019-09-08 13:39:03,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:03,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:03,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:03,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:03,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:39:03,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:03,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:39:03,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:39:03,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:39:03,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:39:03,752 INFO L87 Difference]: Start difference. First operand 289052 states and 476834 transitions. Second operand 4 states. [2019-09-08 13:39:32,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:32,233 INFO L93 Difference]: Finished difference Result 849884 states and 1403882 transitions. [2019-09-08 13:39:32,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:39:32,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-09-08 13:39:32,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:33,358 INFO L225 Difference]: With dead ends: 849884 [2019-09-08 13:39:33,359 INFO L226 Difference]: Without dead ends: 561498 [2019-09-08 13:39:33,651 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:39:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561498 states. [2019-09-08 13:40:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561498 to 472375. [2019-09-08 13:40:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472375 states. [2019-09-08 13:40:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472375 states to 472375 states and 777625 transitions. [2019-09-08 13:40:07,917 INFO L78 Accepts]: Start accepts. Automaton has 472375 states and 777625 transitions. Word has length 241 [2019-09-08 13:40:07,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:07,917 INFO L475 AbstractCegarLoop]: Abstraction has 472375 states and 777625 transitions. [2019-09-08 13:40:07,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:40:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 472375 states and 777625 transitions. [2019-09-08 13:40:07,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 13:40:07,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:07,919 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:07,920 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:07,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:07,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1685205130, now seen corresponding path program 1 times [2019-09-08 13:40:07,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:07,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:07,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:07,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:08,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:40:08,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:08,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:40:08,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:40:08,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:40:08,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:40:08,225 INFO L87 Difference]: Start difference. First operand 472375 states and 777625 transitions. Second operand 8 states. [2019-09-08 13:42:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:42:39,390 INFO L93 Difference]: Finished difference Result 2612960 states and 4310785 transitions. [2019-09-08 13:42:39,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 13:42:39,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-09-08 13:42:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:42:44,739 INFO L225 Difference]: With dead ends: 2612960 [2019-09-08 13:42:44,740 INFO L226 Difference]: Without dead ends: 2141251 [2019-09-08 13:42:45,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-08 13:42:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141251 states.