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/product-lines/elevator_spec1_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:00:15,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:00:15,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:00:15,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:00:15,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:00:15,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:00:15,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:00:15,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:00:15,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:00:15,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:00:15,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:00:15,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:00:15,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:00:15,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:00:15,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:00:15,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:00:15,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:00:15,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:00:15,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:00:15,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:00:15,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:00:15,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:00:15,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:00:15,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:00:15,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:00:15,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:00:15,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:00:15,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:00:15,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:00:15,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:00:15,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:00:15,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:00:15,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:00:15,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:00:15,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:00:15,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:00:15,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:00:15,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:00:15,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:00:15,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:00:15,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:00:15,505 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-10-02 12:00:15,519 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:00:15,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:00:15,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:00:15,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:00:15,521 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:00:15,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:00:15,522 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:00:15,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:00:15,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:00:15,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:00:15,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:00:15,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:00:15,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:00:15,523 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:00:15,526 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:00:15,526 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:00:15,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:00:15,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:00:15,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:00:15,527 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:00:15,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:00:15,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:00:15,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:00:15,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:00:15,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:00:15,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:00:15,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:00:15,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:00:15,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:00:15,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:00:15,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:00:15,588 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:00:15,589 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:00:15,590 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:00:15,591 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product09.cil.c [2019-10-02 12:00:15,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04017dd51/b03522e63d464bc2923f959654318d3d/FLAGd81178b99 [2019-10-02 12:00:16,331 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:00:16,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product09.cil.c [2019-10-02 12:00:16,367 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04017dd51/b03522e63d464bc2923f959654318d3d/FLAGd81178b99 [2019-10-02 12:00:16,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04017dd51/b03522e63d464bc2923f959654318d3d [2019-10-02 12:00:16,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:00:16,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:00:16,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:00:16,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:00:16,489 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:00:16,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:00:16" (1/1) ... [2019-10-02 12:00:16,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bda3564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:00:16, skipping insertion in model container [2019-10-02 12:00:16,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:00:16" (1/1) ... [2019-10-02 12:00:16,502 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:00:16,592 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:00:17,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:00:17,355 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:00:17,495 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:00:17,577 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:00:17,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:00:17 WrapperNode [2019-10-02 12:00:17,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:00:17,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:00:17,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:00:17,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:00:17,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:00:17" (1/1) ... [2019-10-02 12:00:17,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:00:17" (1/1) ... [2019-10-02 12:00:17,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:00:17" (1/1) ... [2019-10-02 12:00:17,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:00:17" (1/1) ... [2019-10-02 12:00:17,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:00:17" (1/1) ... [2019-10-02 12:00:17,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:00:17" (1/1) ... [2019-10-02 12:00:17,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:00:17" (1/1) ... [2019-10-02 12:00:17,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:00:17,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:00:17,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:00:17,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:00:17,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:00:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:00:17,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:00:17,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:00:17,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:00:17,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:00:17,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:00:17,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:00:17,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:00:17,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:00:17,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:00:17,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:00:17,834 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:00:17,834 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:00:17,834 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:00:17,834 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:00:17,835 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:00:17,835 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:00:17,835 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:00:17,835 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:00:17,835 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:00:17,836 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:00:17,836 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:00:17,836 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:00:17,837 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:00:17,837 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:00:17,837 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:00:17,837 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:00:17,837 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:00:17,837 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:00:17,837 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:00:17,838 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:00:17,838 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:00:17,838 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:00:17,838 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:00:17,838 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:00:17,838 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:00:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:00:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:00:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:00:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:00:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:00:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:00:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:00:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:00:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:00:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:00:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:00:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:00:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:00:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:00:17,841 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:00:17,841 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:00:17,841 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:00:17,841 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:00:17,841 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:00:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:00:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:00:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:00:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:00:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:00:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:00:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:00:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:00:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:00:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:00:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:00:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:00:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:00:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:00:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:00:17,845 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:00:17,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:00:17,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:00:17,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:00:17,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:00:17,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:00:17,846 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:00:17,846 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:00:17,846 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:00:17,846 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:00:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:00:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:00:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:00:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:00:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:00:17,848 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:00:17,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:00:17,848 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:00:17,848 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:00:17,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:00:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:00:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:00:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:00:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:00:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:00:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:00:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:00:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:00:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:00:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:00:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:00:17,851 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:00:17,851 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:00:17,851 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:00:17,851 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:00:17,851 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:00:17,852 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:00:17,852 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:00:17,852 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:00:17,852 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:00:17,852 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:00:17,853 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:00:17,853 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:00:17,853 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:00:17,853 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:00:17,853 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:00:17,854 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:00:17,854 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:00:17,854 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:00:17,854 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:00:17,854 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:00:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:00:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:00:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:00:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:00:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:00:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:00:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:00:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:00:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:00:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:00:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:00:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:00:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:00:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:00:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:00:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:00:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:00:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:00:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:00:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:00:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:00:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:00:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:00:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:00:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:00:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:00:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:00:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:00:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:00:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:00:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:00:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:00:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:00:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:00:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:00:17,862 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:00:17,862 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:00:17,862 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:00:17,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:00:17,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:00:17,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:00:20,382 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:00:20,383 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:00:20,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:00:20 BoogieIcfgContainer [2019-10-02 12:00:20,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:00:20,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:00:20,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:00:20,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:00:20,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:00:16" (1/3) ... [2019-10-02 12:00:20,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6e37a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:00:20, skipping insertion in model container [2019-10-02 12:00:20,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:00:17" (2/3) ... [2019-10-02 12:00:20,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6e37a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:00:20, skipping insertion in model container [2019-10-02 12:00:20,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:00:20" (3/3) ... [2019-10-02 12:00:20,394 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product09.cil.c [2019-10-02 12:00:20,405 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:00:20,418 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:00:20,436 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:00:20,486 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:00:20,487 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:00:20,487 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:00:20,487 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:00:20,487 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:00:20,487 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:00:20,488 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:00:20,488 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:00:20,488 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:00:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states. [2019-10-02 12:00:20,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:00:20,565 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:20,570 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:20,575 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:20,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:20,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1329174793, now seen corresponding path program 1 times [2019-10-02 12:00:20,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:20,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:20,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:20,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:20,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:00:21,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:21,272 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:21,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:21,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 3175 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 12:00:21,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:00:22,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:22,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 12:00:22,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:00:22,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:00:22,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:00:22,028 INFO L87 Difference]: Start difference. First operand 738 states. Second operand 4 states. [2019-10-02 12:00:22,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:22,211 INFO L93 Difference]: Finished difference Result 1160 states and 1895 transitions. [2019-10-02 12:00:22,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:00:22,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 12:00:22,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:22,244 INFO L225 Difference]: With dead ends: 1160 [2019-10-02 12:00:22,244 INFO L226 Difference]: Without dead ends: 584 [2019-10-02 12:00:22,257 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 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-10-02 12:00:22,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-02 12:00:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-02 12:00:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-02 12:00:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 941 transitions. [2019-10-02 12:00:22,401 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 941 transitions. Word has length 138 [2019-10-02 12:00:22,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:22,401 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 941 transitions. [2019-10-02 12:00:22,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:00:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 941 transitions. [2019-10-02 12:00:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:00:22,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:22,418 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:22,419 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:22,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:22,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1148939338, now seen corresponding path program 1 times [2019-10-02 12:00:22,419 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:22,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:22,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:22,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:22,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:00:22,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:22,622 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:22,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:23,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 3180 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:00:23,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:00:23,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:23,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:00:23,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:00:23,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:00:23,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:00:23,333 INFO L87 Difference]: Start difference. First operand 584 states and 941 transitions. Second operand 6 states. [2019-10-02 12:00:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:23,480 INFO L93 Difference]: Finished difference Result 1140 states and 1855 transitions. [2019-10-02 12:00:23,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:00:23,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-02 12:00:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:23,490 INFO L225 Difference]: With dead ends: 1140 [2019-10-02 12:00:23,490 INFO L226 Difference]: Without dead ends: 584 [2019-10-02 12:00:23,496 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:00:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-02 12:00:23,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-02 12:00:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-02 12:00:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 940 transitions. [2019-10-02 12:00:23,550 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 940 transitions. Word has length 142 [2019-10-02 12:00:23,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:23,553 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 940 transitions. [2019-10-02 12:00:23,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:00:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 940 transitions. [2019-10-02 12:00:23,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:00:23,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:23,570 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:23,570 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:23,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:23,570 INFO L82 PathProgramCache]: Analyzing trace with hash -333550332, now seen corresponding path program 1 times [2019-10-02 12:00:23,571 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:23,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:23,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:23,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:23,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:00:23,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:23,765 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:23,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:24,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 3182 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:00:24,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream Closed [2019-10-02 12:00:24,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:24,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:00:24,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:00:24,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:00:24,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:00:24,429 INFO L87 Difference]: Start difference. First operand 584 states and 940 transitions. Second operand 6 states. [2019-10-02 12:00:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:24,507 INFO L93 Difference]: Finished difference Result 1144 states and 1858 transitions. [2019-10-02 12:00:24,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:00:24,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-02 12:00:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:24,513 INFO L225 Difference]: With dead ends: 1144 [2019-10-02 12:00:24,514 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 12:00:24,517 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:00:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 12:00:24,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-02 12:00:24,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-02 12:00:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 945 transitions. [2019-10-02 12:00:24,543 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 945 transitions. Word has length 144 [2019-10-02 12:00:24,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:24,544 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 945 transitions. [2019-10-02 12:00:24,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:00:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 945 transitions. [2019-10-02 12:00:24,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:00:24,549 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:24,549 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:24,549 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:24,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:24,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2025668661, now seen corresponding path program 1 times [2019-10-02 12:00:24,550 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:24,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:24,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:24,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:24,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:00:24,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:24,683 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:24,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:25,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 3183 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:00:25,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:00:25,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:25,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:00:25,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:00:25,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:00:25,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:00:25,366 INFO L87 Difference]: Start difference. First operand 590 states and 945 transitions. Second operand 6 states. [2019-10-02 12:00:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:25,459 INFO L93 Difference]: Finished difference Result 1143 states and 1849 transitions. [2019-10-02 12:00:25,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:00:25,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-02 12:00:25,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:25,465 INFO L225 Difference]: With dead ends: 1143 [2019-10-02 12:00:25,465 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 12:00:25,469 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:00:25,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 12:00:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-02 12:00:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-02 12:00:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 944 transitions. [2019-10-02 12:00:25,493 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 944 transitions. Word has length 145 [2019-10-02 12:00:25,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:25,494 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 944 transitions. [2019-10-02 12:00:25,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:00:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 944 transitions. [2019-10-02 12:00:25,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:00:25,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:25,499 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:25,499 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:25,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:25,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1147712472, now seen corresponding path program 1 times [2019-10-02 12:00:25,500 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:25,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:25,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:25,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:25,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:00:25,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:25,639 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:25,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:26,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 3184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:00:26,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:00:26,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:26,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:00:26,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:00:26,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:00:26,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:00:26,306 INFO L87 Difference]: Start difference. First operand 590 states and 944 transitions. Second operand 6 states. [2019-10-02 12:00:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:26,385 INFO L93 Difference]: Finished difference Result 1143 states and 1848 transitions. [2019-10-02 12:00:26,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:00:26,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-10-02 12:00:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:26,391 INFO L225 Difference]: With dead ends: 1143 [2019-10-02 12:00:26,391 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 12:00:26,397 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:00:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 12:00:26,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-02 12:00:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-02 12:00:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 943 transitions. [2019-10-02 12:00:26,425 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 943 transitions. Word has length 146 [2019-10-02 12:00:26,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:26,426 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 943 transitions. [2019-10-02 12:00:26,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:00:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 943 transitions. [2019-10-02 12:00:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 12:00:26,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:26,431 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:26,431 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:26,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:26,431 INFO L82 PathProgramCache]: Analyzing trace with hash 261961625, now seen corresponding path program 1 times [2019-10-02 12:00:26,432 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:26,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:26,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:26,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:26,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:00:26,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:26,677 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:26,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:27,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 3185 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 12:00:27,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:00:27,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:27,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-10-02 12:00:27,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:00:27,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:00:27,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:00:27,359 INFO L87 Difference]: Start difference. First operand 590 states and 943 transitions. Second operand 15 states. [2019-10-02 12:00:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:27,580 INFO L93 Difference]: Finished difference Result 1148 states and 1855 transitions. [2019-10-02 12:00:27,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:00:27,580 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2019-10-02 12:00:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:27,595 INFO L225 Difference]: With dead ends: 1148 [2019-10-02 12:00:27,595 INFO L226 Difference]: Without dead ends: 599 [2019-10-02 12:00:27,601 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:00:27,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-02 12:00:27,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2019-10-02 12:00:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-02 12:00:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 953 transitions. [2019-10-02 12:00:27,629 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 953 transitions. Word has length 147 [2019-10-02 12:00:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:27,629 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 953 transitions. [2019-10-02 12:00:27,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:00:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 953 transitions. [2019-10-02 12:00:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 12:00:27,633 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:27,634 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:27,634 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:27,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:27,634 INFO L82 PathProgramCache]: Analyzing trace with hash -654338191, now seen corresponding path program 1 times [2019-10-02 12:00:27,634 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:27,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:27,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:27,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:27,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:00:27,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:27,796 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:27,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:28,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 3186 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:00:28,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:00:28,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:28,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:00:28,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:00:28,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:00:28,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:00:28,404 INFO L87 Difference]: Start difference. First operand 597 states and 953 transitions. Second operand 8 states. [2019-10-02 12:00:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:28,747 INFO L93 Difference]: Finished difference Result 1155 states and 1868 transitions. [2019-10-02 12:00:28,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:00:28,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 148 [2019-10-02 12:00:28,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:28,753 INFO L225 Difference]: With dead ends: 1155 [2019-10-02 12:00:28,754 INFO L226 Difference]: Without dead ends: 597 [2019-10-02 12:00:28,757 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:00:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-02 12:00:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-10-02 12:00:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-02 12:00:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 948 transitions. [2019-10-02 12:00:28,781 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 948 transitions. Word has length 148 [2019-10-02 12:00:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:28,782 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 948 transitions. [2019-10-02 12:00:28,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:00:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 948 transitions. [2019-10-02 12:00:28,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 12:00:28,786 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:28,787 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:28,787 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:28,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:28,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1770571481, now seen corresponding path program 1 times [2019-10-02 12:00:28,788 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:28,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:28,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:28,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:28,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:00:29,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:29,019 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:29,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:29,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 3188 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:00:29,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:00:29,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:29,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:00:29,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:00:29,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:00:29,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:00:29,701 INFO L87 Difference]: Start difference. First operand 597 states and 948 transitions. Second operand 8 states. [2019-10-02 12:00:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:29,969 INFO L93 Difference]: Finished difference Result 1155 states and 1858 transitions. [2019-10-02 12:00:29,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:00:29,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-10-02 12:00:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:29,978 INFO L225 Difference]: With dead ends: 1155 [2019-10-02 12:00:29,979 INFO L226 Difference]: Without dead ends: 597 [2019-10-02 12:00:29,984 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:00:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-02 12:00:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-10-02 12:00:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-02 12:00:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 943 transitions. [2019-10-02 12:00:30,020 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 943 transitions. Word has length 150 [2019-10-02 12:00:30,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:30,020 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 943 transitions. [2019-10-02 12:00:30,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:00:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 943 transitions. [2019-10-02 12:00:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:00:30,027 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:30,028 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:30,028 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:30,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1535082471, now seen corresponding path program 1 times [2019-10-02 12:00:30,030 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:30,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:30,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:30,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:30,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:00:30,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:30,245 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:30,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:30,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 3190 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:00:30,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:00:31,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:31,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:00:31,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:00:31,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:00:31,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:00:31,019 INFO L87 Difference]: Start difference. First operand 597 states and 943 transitions. Second operand 8 states. [2019-10-02 12:00:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:31,381 INFO L93 Difference]: Finished difference Result 1176 states and 1879 transitions. [2019-10-02 12:00:31,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:00:31,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 152 [2019-10-02 12:00:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:31,390 INFO L225 Difference]: With dead ends: 1176 [2019-10-02 12:00:31,390 INFO L226 Difference]: Without dead ends: 624 [2019-10-02 12:00:31,394 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:00:31,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-10-02 12:00:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 621. [2019-10-02 12:00:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-02 12:00:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 970 transitions. [2019-10-02 12:00:31,444 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 970 transitions. Word has length 152 [2019-10-02 12:00:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:31,444 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 970 transitions. [2019-10-02 12:00:31,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:00:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 970 transitions. [2019-10-02 12:00:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:00:31,449 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:31,449 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:31,449 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:31,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:31,450 INFO L82 PathProgramCache]: Analyzing trace with hash 819565415, now seen corresponding path program 1 times [2019-10-02 12:00:31,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:31,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:31,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:31,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:31,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:00:31,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:31,628 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:31,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:32,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 3186 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:00:32,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:32,325 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:00:32,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:32,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:00:32,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:00:32,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:00:32,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:00:32,345 INFO L87 Difference]: Start difference. First operand 621 states and 970 transitions. Second operand 14 states. [2019-10-02 12:00:32,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:32,642 INFO L93 Difference]: Finished difference Result 1177 states and 1860 transitions. [2019-10-02 12:00:32,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:00:32,643 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 152 [2019-10-02 12:00:32,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:32,648 INFO L225 Difference]: With dead ends: 1177 [2019-10-02 12:00:32,648 INFO L226 Difference]: Without dead ends: 643 [2019-10-02 12:00:32,652 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:00:32,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-02 12:00:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 632. [2019-10-02 12:00:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-02 12:00:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 991 transitions. [2019-10-02 12:00:32,675 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 991 transitions. Word has length 152 [2019-10-02 12:00:32,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:32,675 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 991 transitions. [2019-10-02 12:00:32,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:00:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 991 transitions. [2019-10-02 12:00:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:00:32,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:32,680 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:32,680 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:32,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:32,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1523822727, now seen corresponding path program 1 times [2019-10-02 12:00:32,681 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:32,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:32,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:32,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:32,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:00:32,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:32,849 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:32,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:33,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 3189 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:00:33,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:00:33,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:33,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:00:33,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:00:33,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:00:33,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:00:33,511 INFO L87 Difference]: Start difference. First operand 632 states and 991 transitions. Second operand 6 states. [2019-10-02 12:00:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:33,828 INFO L93 Difference]: Finished difference Result 1226 states and 1944 transitions. [2019-10-02 12:00:33,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:00:33,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-10-02 12:00:33,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:33,835 INFO L225 Difference]: With dead ends: 1226 [2019-10-02 12:00:33,836 INFO L226 Difference]: Without dead ends: 597 [2019-10-02 12:00:33,840 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:00:33,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-02 12:00:33,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-10-02 12:00:33,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-02 12:00:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 928 transitions. [2019-10-02 12:00:33,863 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 928 transitions. Word has length 152 [2019-10-02 12:00:33,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:33,865 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 928 transitions. [2019-10-02 12:00:33,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:00:33,865 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 928 transitions. [2019-10-02 12:00:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 12:00:33,869 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:33,869 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:33,870 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:33,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:33,870 INFO L82 PathProgramCache]: Analyzing trace with hash 272043983, now seen corresponding path program 1 times [2019-10-02 12:00:33,870 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:33,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:33,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:33,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:33,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:00:34,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:34,047 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:34,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:34,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 3194 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:00:34,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:00:34,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:34,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:00:34,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:00:34,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:00:34,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:00:34,667 INFO L87 Difference]: Start difference. First operand 597 states and 928 transitions. Second operand 8 states. [2019-10-02 12:00:34,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:34,874 INFO L93 Difference]: Finished difference Result 1144 states and 1803 transitions. [2019-10-02 12:00:34,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:00:34,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2019-10-02 12:00:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:34,879 INFO L225 Difference]: With dead ends: 1144 [2019-10-02 12:00:34,880 INFO L226 Difference]: Without dead ends: 597 [2019-10-02 12:00:34,883 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:00:34,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-02 12:00:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-10-02 12:00:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-02 12:00:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 927 transitions. [2019-10-02 12:00:34,904 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 927 transitions. Word has length 156 [2019-10-02 12:00:34,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:34,905 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 927 transitions. [2019-10-02 12:00:34,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:00:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 927 transitions. [2019-10-02 12:00:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 12:00:34,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:34,910 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:34,910 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:34,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:34,910 INFO L82 PathProgramCache]: Analyzing trace with hash -101707020, now seen corresponding path program 1 times [2019-10-02 12:00:34,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:34,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:34,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:34,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:34,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:00:35,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:35,224 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:35,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:35,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 3195 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:00:35,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:00:36,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:36,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-10-02 12:00:36,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:00:36,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:00:36,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:00:36,077 INFO L87 Difference]: Start difference. First operand 597 states and 927 transitions. Second operand 18 states. [2019-10-02 12:00:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:36,655 INFO L93 Difference]: Finished difference Result 1160 states and 1830 transitions. [2019-10-02 12:00:36,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:00:36,656 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 157 [2019-10-02 12:00:36,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:36,665 INFO L225 Difference]: With dead ends: 1160 [2019-10-02 12:00:36,665 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 12:00:36,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:00:36,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 12:00:36,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 608. [2019-10-02 12:00:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-10-02 12:00:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 935 transitions. [2019-10-02 12:00:36,695 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 935 transitions. Word has length 157 [2019-10-02 12:00:36,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:36,696 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 935 transitions. [2019-10-02 12:00:36,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:00:36,696 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 935 transitions. [2019-10-02 12:00:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:00:36,700 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:36,700 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:36,701 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:36,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:36,701 INFO L82 PathProgramCache]: Analyzing trace with hash 747290421, now seen corresponding path program 1 times [2019-10-02 12:00:36,701 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:36,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:36,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:36,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:36,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:00:36,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:36,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:00:36,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:00:36,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:00:36,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:00:36,861 INFO L87 Difference]: Start difference. First operand 608 states and 935 transitions. Second operand 9 states. [2019-10-02 12:00:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:37,063 INFO L93 Difference]: Finished difference Result 1091 states and 1726 transitions. [2019-10-02 12:00:37,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:00:37,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-10-02 12:00:37,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:37,069 INFO L225 Difference]: With dead ends: 1091 [2019-10-02 12:00:37,069 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 12:00:37,072 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:00:37,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 12:00:37,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-02 12:00:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-02 12:00:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 930 transitions. [2019-10-02 12:00:37,114 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 930 transitions. Word has length 158 [2019-10-02 12:00:37,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:37,115 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 930 transitions. [2019-10-02 12:00:37,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:00:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 930 transitions. [2019-10-02 12:00:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:00:37,121 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:37,121 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:37,121 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:37,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:37,122 INFO L82 PathProgramCache]: Analyzing trace with hash 282772150, now seen corresponding path program 1 times [2019-10-02 12:00:37,122 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:37,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:37,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:37,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:37,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:00:37,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:37,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:00:37,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:00:37,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:00:37,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:00:37,350 INFO L87 Difference]: Start difference. First operand 605 states and 930 transitions. Second operand 7 states. [2019-10-02 12:00:37,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:37,449 INFO L93 Difference]: Finished difference Result 1088 states and 1721 transitions. [2019-10-02 12:00:37,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:00:37,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2019-10-02 12:00:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:37,454 INFO L225 Difference]: With dead ends: 1088 [2019-10-02 12:00:37,454 INFO L226 Difference]: Without dead ends: 584 [2019-10-02 12:00:37,459 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:00:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-02 12:00:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 582. [2019-10-02 12:00:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-02 12:00:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 900 transitions. [2019-10-02 12:00:37,481 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 900 transitions. Word has length 159 [2019-10-02 12:00:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:37,481 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 900 transitions. [2019-10-02 12:00:37,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:00:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 900 transitions. [2019-10-02 12:00:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:00:37,486 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:37,487 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:37,487 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:37,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:37,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1450567751, now seen corresponding path program 1 times [2019-10-02 12:00:37,488 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:37,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:37,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:37,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:37,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:00:37,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:37,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:00:37,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:00:37,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:00:37,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:00:37,834 INFO L87 Difference]: Start difference. First operand 582 states and 900 transitions. Second operand 13 states. [2019-10-02 12:00:38,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:38,195 INFO L93 Difference]: Finished difference Result 1066 states and 1689 transitions. [2019-10-02 12:00:38,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:00:38,196 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2019-10-02 12:00:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:38,199 INFO L225 Difference]: With dead ends: 1066 [2019-10-02 12:00:38,199 INFO L226 Difference]: Without dead ends: 575 [2019-10-02 12:00:38,203 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:00:38,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-10-02 12:00:38,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-10-02 12:00:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-02 12:00:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 891 transitions. [2019-10-02 12:00:38,222 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 891 transitions. Word has length 159 [2019-10-02 12:00:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:38,225 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 891 transitions. [2019-10-02 12:00:38,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:00:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 891 transitions. [2019-10-02 12:00:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 12:00:38,230 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:38,230 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:38,230 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:38,231 INFO L82 PathProgramCache]: Analyzing trace with hash 510737970, now seen corresponding path program 1 times [2019-10-02 12:00:38,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:38,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:38,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:38,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:38,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:00:38,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:38,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:00:38,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:00:38,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:00:38,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:00:38,471 INFO L87 Difference]: Start difference. First operand 575 states and 891 transitions. Second operand 13 states. [2019-10-02 12:00:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:38,803 INFO L93 Difference]: Finished difference Result 1117 states and 1757 transitions. [2019-10-02 12:00:38,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:00:38,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 160 [2019-10-02 12:00:38,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:38,810 INFO L225 Difference]: With dead ends: 1117 [2019-10-02 12:00:38,810 INFO L226 Difference]: Without dead ends: 589 [2019-10-02 12:00:38,813 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:00:38,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-02 12:00:38,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 587. [2019-10-02 12:00:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-02 12:00:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 906 transitions. [2019-10-02 12:00:38,835 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 906 transitions. Word has length 160 [2019-10-02 12:00:38,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:38,835 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 906 transitions. [2019-10-02 12:00:38,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:00:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 906 transitions. [2019-10-02 12:00:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:00:38,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:38,840 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:38,840 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:38,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:38,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1236703458, now seen corresponding path program 1 times [2019-10-02 12:00:38,840 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:38,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:38,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:38,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:38,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:00:39,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:39,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:00:39,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:00:39,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:00:39,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:00:39,035 INFO L87 Difference]: Start difference. First operand 587 states and 906 transitions. Second operand 11 states. [2019-10-02 12:00:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:39,295 INFO L93 Difference]: Finished difference Result 1071 states and 1695 transitions. [2019-10-02 12:00:39,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:00:39,296 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-10-02 12:00:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:39,304 INFO L225 Difference]: With dead ends: 1071 [2019-10-02 12:00:39,304 INFO L226 Difference]: Without dead ends: 587 [2019-10-02 12:00:39,307 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:00:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-02 12:00:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-02 12:00:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-02 12:00:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 905 transitions. [2019-10-02 12:00:39,334 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 905 transitions. Word has length 161 [2019-10-02 12:00:39,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:39,334 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 905 transitions. [2019-10-02 12:00:39,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:00:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 905 transitions. [2019-10-02 12:00:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:00:39,338 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:39,339 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:39,339 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:39,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:39,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2003437219, now seen corresponding path program 1 times [2019-10-02 12:00:39,340 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:39,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:39,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:39,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:00:39,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:39,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:00:39,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:00:39,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:00:39,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:00:39,565 INFO L87 Difference]: Start difference. First operand 587 states and 905 transitions. Second operand 11 states. [2019-10-02 12:00:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:39,794 INFO L93 Difference]: Finished difference Result 1117 states and 1748 transitions. [2019-10-02 12:00:39,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:00:39,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 162 [2019-10-02 12:00:39,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:39,799 INFO L225 Difference]: With dead ends: 1117 [2019-10-02 12:00:39,799 INFO L226 Difference]: Without dead ends: 584 [2019-10-02 12:00:39,802 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:00:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-02 12:00:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-02 12:00:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-02 12:00:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 897 transitions. [2019-10-02 12:00:39,819 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 897 transitions. Word has length 162 [2019-10-02 12:00:39,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:39,821 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 897 transitions. [2019-10-02 12:00:39,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:00:39,821 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 897 transitions. [2019-10-02 12:00:39,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 12:00:39,825 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:39,825 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:39,825 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:39,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:39,826 INFO L82 PathProgramCache]: Analyzing trace with hash -394050151, now seen corresponding path program 1 times [2019-10-02 12:00:39,826 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:39,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:39,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:39,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:39,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:00:40,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:40,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:00:40,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:00:40,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:00:40,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:00:40,036 INFO L87 Difference]: Start difference. First operand 584 states and 897 transitions. Second operand 9 states. [2019-10-02 12:00:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:43,515 INFO L93 Difference]: Finished difference Result 1065 states and 1701 transitions. [2019-10-02 12:00:43,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:00:43,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 163 [2019-10-02 12:00:43,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:43,520 INFO L225 Difference]: With dead ends: 1065 [2019-10-02 12:00:43,521 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 12:00:43,523 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:00:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 12:00:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 588. [2019-10-02 12:00:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-02 12:00:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 916 transitions. [2019-10-02 12:00:43,546 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 916 transitions. Word has length 163 [2019-10-02 12:00:43,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:43,547 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 916 transitions. [2019-10-02 12:00:43,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:00:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 916 transitions. [2019-10-02 12:00:43,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:00:43,551 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:43,551 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:43,552 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:43,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:43,552 INFO L82 PathProgramCache]: Analyzing trace with hash -335232507, now seen corresponding path program 1 times [2019-10-02 12:00:43,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:43,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:43,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:43,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:43,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:00:43,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:43,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:00:43,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:00:43,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:00:43,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:00:43,715 INFO L87 Difference]: Start difference. First operand 588 states and 916 transitions. Second operand 8 states. [2019-10-02 12:00:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:49,450 INFO L93 Difference]: Finished difference Result 1949 states and 3218 transitions. [2019-10-02 12:00:49,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:00:49,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 164 [2019-10-02 12:00:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:49,460 INFO L225 Difference]: With dead ends: 1949 [2019-10-02 12:00:49,461 INFO L226 Difference]: Without dead ends: 1470 [2019-10-02 12:00:49,464 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:00:49,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-10-02 12:00:49,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1431. [2019-10-02 12:00:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-10-02 12:00:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2285 transitions. [2019-10-02 12:00:49,522 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2285 transitions. Word has length 164 [2019-10-02 12:00:49,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:49,523 INFO L475 AbstractCegarLoop]: Abstraction has 1431 states and 2285 transitions. [2019-10-02 12:00:49,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:00:49,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2285 transitions. [2019-10-02 12:00:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:00:49,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:49,526 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:49,527 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash 879368408, now seen corresponding path program 1 times [2019-10-02 12:00:49,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:49,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:49,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:49,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:49,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:00:49,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:49,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:00:49,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:00:49,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:00:49,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:00:49,683 INFO L87 Difference]: Start difference. First operand 1431 states and 2285 transitions. Second operand 9 states. [2019-10-02 12:00:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:56,689 INFO L93 Difference]: Finished difference Result 4508 states and 7468 transitions. [2019-10-02 12:00:56,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:00:56,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2019-10-02 12:00:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:56,712 INFO L225 Difference]: With dead ends: 4508 [2019-10-02 12:00:56,712 INFO L226 Difference]: Without dead ends: 3186 [2019-10-02 12:00:56,721 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:00:56,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2019-10-02 12:00:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 2963. [2019-10-02 12:00:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2963 states. [2019-10-02 12:00:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 4814 transitions. [2019-10-02 12:00:56,887 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 4814 transitions. Word has length 170 [2019-10-02 12:00:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:56,888 INFO L475 AbstractCegarLoop]: Abstraction has 2963 states and 4814 transitions. [2019-10-02 12:00:56,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:00:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 4814 transitions. [2019-10-02 12:00:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:00:56,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:56,892 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:56,892 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:56,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:56,893 INFO L82 PathProgramCache]: Analyzing trace with hash 871609049, now seen corresponding path program 1 times [2019-10-02 12:00:56,893 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:56,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:56,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:56,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:56,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:00:57,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:57,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:00:57,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:00:57,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:00:57,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:00:57,054 INFO L87 Difference]: Start difference. First operand 2963 states and 4814 transitions. Second operand 7 states. [2019-10-02 12:01:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:01,324 INFO L93 Difference]: Finished difference Result 7565 states and 12542 transitions. [2019-10-02 12:01:01,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:01:01,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-10-02 12:01:01,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:01,369 INFO L225 Difference]: With dead ends: 7565 [2019-10-02 12:01:01,370 INFO L226 Difference]: Without dead ends: 5463 [2019-10-02 12:01:01,385 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:01:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2019-10-02 12:01:01,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 5370. [2019-10-02 12:01:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5370 states. [2019-10-02 12:01:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5370 states to 5370 states and 8816 transitions. [2019-10-02 12:01:01,656 INFO L78 Accepts]: Start accepts. Automaton has 5370 states and 8816 transitions. Word has length 170 [2019-10-02 12:01:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:01,657 INFO L475 AbstractCegarLoop]: Abstraction has 5370 states and 8816 transitions. [2019-10-02 12:01:01,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:01:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 5370 states and 8816 transitions. [2019-10-02 12:01:01,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:01:01,660 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:01,660 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:01:01,661 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:01,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:01,661 INFO L82 PathProgramCache]: Analyzing trace with hash 444088872, now seen corresponding path program 1 times [2019-10-02 12:01:01,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:01,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:01,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:01,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:01,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:01:01,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:01:01,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:01:01,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:01:01,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:01:01,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:01:01,823 INFO L87 Difference]: Start difference. First operand 5370 states and 8816 transitions. Second operand 5 states. [2019-10-02 12:01:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:02,119 INFO L93 Difference]: Finished difference Result 9887 states and 16338 transitions. [2019-10-02 12:01:02,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:01:02,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-10-02 12:01:02,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:02,173 INFO L225 Difference]: With dead ends: 9887 [2019-10-02 12:01:02,174 INFO L226 Difference]: Without dead ends: 5488 [2019-10-02 12:01:02,200 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:01:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2019-10-02 12:01:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 5422. [2019-10-02 12:01:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5422 states. [2019-10-02 12:01:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5422 states to 5422 states and 8889 transitions. [2019-10-02 12:01:02,447 INFO L78 Accepts]: Start accepts. Automaton has 5422 states and 8889 transitions. Word has length 175 [2019-10-02 12:01:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:02,448 INFO L475 AbstractCegarLoop]: Abstraction has 5422 states and 8889 transitions. [2019-10-02 12:01:02,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:01:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 5422 states and 8889 transitions. [2019-10-02 12:01:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:01:02,452 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:02,452 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:01:02,452 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:02,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:02,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1893422493, now seen corresponding path program 1 times [2019-10-02 12:01:02,453 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:02,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:02,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:02,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:02,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:01:02,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:01:02,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:01:02,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:01:02,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:01:02,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:01:02,621 INFO L87 Difference]: Start difference. First operand 5422 states and 8889 transitions. Second operand 7 states. [2019-10-02 12:01:02,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:02,983 INFO L93 Difference]: Finished difference Result 10463 states and 17454 transitions. [2019-10-02 12:01:02,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:01:02,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-10-02 12:01:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:03,032 INFO L225 Difference]: With dead ends: 10463 [2019-10-02 12:01:03,033 INFO L226 Difference]: Without dead ends: 5422 [2019-10-02 12:01:03,053 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:01:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5422 states. [2019-10-02 12:01:03,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5422 to 5422. [2019-10-02 12:01:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5422 states. [2019-10-02 12:01:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5422 states to 5422 states and 8797 transitions. [2019-10-02 12:01:03,293 INFO L78 Accepts]: Start accepts. Automaton has 5422 states and 8797 transitions. Word has length 182 [2019-10-02 12:01:03,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:03,294 INFO L475 AbstractCegarLoop]: Abstraction has 5422 states and 8797 transitions. [2019-10-02 12:01:03,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:01:03,294 INFO L276 IsEmpty]: Start isEmpty. Operand 5422 states and 8797 transitions. [2019-10-02 12:01:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 12:01:03,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:03,298 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:01:03,298 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:03,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:03,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1756483171, now seen corresponding path program 1 times [2019-10-02 12:01:03,299 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:03,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:03,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:03,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:03,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:03,471 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 12:01:03,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:01:03,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:01:03,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:01:03,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:01:03,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:01:03,473 INFO L87 Difference]: Start difference. First operand 5422 states and 8797 transitions. Second operand 7 states. [2019-10-02 12:01:08,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:08,372 INFO L93 Difference]: Finished difference Result 10203 states and 16633 transitions. [2019-10-02 12:01:08,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:01:08,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 187 [2019-10-02 12:01:08,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:08,421 INFO L225 Difference]: With dead ends: 10203 [2019-10-02 12:01:08,421 INFO L226 Difference]: Without dead ends: 5769 [2019-10-02 12:01:08,446 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:01:08,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2019-10-02 12:01:08,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 5654. [2019-10-02 12:01:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5654 states. [2019-10-02 12:01:08,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5654 states to 5654 states and 9111 transitions. [2019-10-02 12:01:08,824 INFO L78 Accepts]: Start accepts. Automaton has 5654 states and 9111 transitions. Word has length 187 [2019-10-02 12:01:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:08,825 INFO L475 AbstractCegarLoop]: Abstraction has 5654 states and 9111 transitions. [2019-10-02 12:01:08,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:01:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 5654 states and 9111 transitions. [2019-10-02 12:01:08,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 12:01:08,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:08,833 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:01:08,834 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:08,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:08,834 INFO L82 PathProgramCache]: Analyzing trace with hash 94995430, now seen corresponding path program 1 times [2019-10-02 12:01:08,834 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:08,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:08,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:08,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:08,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:01:09,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:01:09,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:01:09,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:01:09,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:01:09,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:01:09,167 INFO L87 Difference]: Start difference. First operand 5654 states and 9111 transitions. Second operand 11 states. [2019-10-02 12:01:16,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:16,693 INFO L93 Difference]: Finished difference Result 11750 states and 18909 transitions. [2019-10-02 12:01:16,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:01:16,694 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 194 [2019-10-02 12:01:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:16,737 INFO L225 Difference]: With dead ends: 11750 [2019-10-02 12:01:16,737 INFO L226 Difference]: Without dead ends: 6963 [2019-10-02 12:01:16,757 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:01:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6963 states. [2019-10-02 12:01:17,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6963 to 6814. [2019-10-02 12:01:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6814 states. [2019-10-02 12:01:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6814 states to 6814 states and 10803 transitions. [2019-10-02 12:01:17,066 INFO L78 Accepts]: Start accepts. Automaton has 6814 states and 10803 transitions. Word has length 194 [2019-10-02 12:01:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:17,067 INFO L475 AbstractCegarLoop]: Abstraction has 6814 states and 10803 transitions. [2019-10-02 12:01:17,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:01:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 6814 states and 10803 transitions. [2019-10-02 12:01:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 12:01:17,071 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:17,072 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:01:17,072 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:17,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:17,072 INFO L82 PathProgramCache]: Analyzing trace with hash 864165445, now seen corresponding path program 1 times [2019-10-02 12:01:17,072 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:17,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:17,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:17,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:17,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:01:17,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:01:17,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:01:17,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:01:17,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:01:17,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:01:17,218 INFO L87 Difference]: Start difference. First operand 6814 states and 10803 transitions. Second operand 6 states. [2019-10-02 12:01:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:17,593 INFO L93 Difference]: Finished difference Result 15759 states and 25227 transitions. [2019-10-02 12:01:17,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:01:17,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2019-10-02 12:01:17,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:17,659 INFO L225 Difference]: With dead ends: 15759 [2019-10-02 12:01:17,660 INFO L226 Difference]: Without dead ends: 9933 [2019-10-02 12:01:17,684 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:01:17,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9933 states. [2019-10-02 12:01:18,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9933 to 8706. [2019-10-02 12:01:18,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8706 states. [2019-10-02 12:01:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8706 states to 8706 states and 13931 transitions. [2019-10-02 12:01:18,117 INFO L78 Accepts]: Start accepts. Automaton has 8706 states and 13931 transitions. Word has length 194 [2019-10-02 12:01:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:18,117 INFO L475 AbstractCegarLoop]: Abstraction has 8706 states and 13931 transitions. [2019-10-02 12:01:18,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:01:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 8706 states and 13931 transitions. [2019-10-02 12:01:18,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 12:01:18,123 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:18,123 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:01:18,123 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:18,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:18,124 INFO L82 PathProgramCache]: Analyzing trace with hash 696513874, now seen corresponding path program 1 times [2019-10-02 12:01:18,124 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:18,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:18,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:18,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:18,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:01:18,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:01:18,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:01:18,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:01:18,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:01:18,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:01:18,408 INFO L87 Difference]: Start difference. First operand 8706 states and 13931 transitions. Second operand 4 states. [2019-10-02 12:01:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:19,240 INFO L93 Difference]: Finished difference Result 17242 states and 27832 transitions. [2019-10-02 12:01:19,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:01:19,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-10-02 12:01:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:19,296 INFO L225 Difference]: With dead ends: 17242 [2019-10-02 12:01:19,296 INFO L226 Difference]: Without dead ends: 8645 [2019-10-02 12:01:19,333 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-10-02 12:01:19,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8645 states. [2019-10-02 12:01:19,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8645 to 8645. [2019-10-02 12:01:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8645 states. [2019-10-02 12:01:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8645 states to 8645 states and 13809 transitions. [2019-10-02 12:01:19,822 INFO L78 Accepts]: Start accepts. Automaton has 8645 states and 13809 transitions. Word has length 192 [2019-10-02 12:01:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:19,822 INFO L475 AbstractCegarLoop]: Abstraction has 8645 states and 13809 transitions. [2019-10-02 12:01:19,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:01:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 8645 states and 13809 transitions. [2019-10-02 12:01:19,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 12:01:19,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:19,829 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:01:19,829 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:19,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:19,829 INFO L82 PathProgramCache]: Analyzing trace with hash 116810103, now seen corresponding path program 1 times [2019-10-02 12:01:19,830 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:19,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:19,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:19,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:19,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:01:20,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:01:20,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:01:20,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:01:20,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:01:20,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:01:20,047 INFO L87 Difference]: Start difference. First operand 8645 states and 13809 transitions. Second operand 6 states. [2019-10-02 12:01:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:21,290 INFO L93 Difference]: Finished difference Result 8712 states and 13920 transitions. [2019-10-02 12:01:21,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:01:21,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 193 [2019-10-02 12:01:21,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:21,341 INFO L225 Difference]: With dead ends: 8712 [2019-10-02 12:01:21,341 INFO L226 Difference]: Without dead ends: 8696 [2019-10-02 12:01:21,350 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:01:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8696 states. [2019-10-02 12:01:21,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8696 to 8657. [2019-10-02 12:01:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8657 states. [2019-10-02 12:01:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8657 states to 8657 states and 13821 transitions. [2019-10-02 12:01:21,925 INFO L78 Accepts]: Start accepts. Automaton has 8657 states and 13821 transitions. Word has length 193 [2019-10-02 12:01:21,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:21,925 INFO L475 AbstractCegarLoop]: Abstraction has 8657 states and 13821 transitions. [2019-10-02 12:01:21,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:01:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 8657 states and 13821 transitions. [2019-10-02 12:01:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:01:21,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:21,929 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:01:21,930 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:21,930 INFO L82 PathProgramCache]: Analyzing trace with hash -420965913, now seen corresponding path program 1 times [2019-10-02 12:01:21,930 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:21,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:21,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:21,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:21,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:01:22,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:01:22,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:01:22,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:01:22,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:01:22,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:01:22,080 INFO L87 Difference]: Start difference. First operand 8657 states and 13821 transitions. Second operand 8 states. [2019-10-02 12:01:22,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:22,353 INFO L93 Difference]: Finished difference Result 8681 states and 13851 transitions. [2019-10-02 12:01:22,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:01:22,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 201 [2019-10-02 12:01:22,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:22,399 INFO L225 Difference]: With dead ends: 8681 [2019-10-02 12:01:22,399 INFO L226 Difference]: Without dead ends: 8665 [2019-10-02 12:01:22,408 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:01:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8665 states. [2019-10-02 12:01:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8665 to 8657. [2019-10-02 12:01:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8657 states. [2019-10-02 12:01:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8657 states to 8657 states and 13807 transitions. [2019-10-02 12:01:22,781 INFO L78 Accepts]: Start accepts. Automaton has 8657 states and 13807 transitions. Word has length 201 [2019-10-02 12:01:22,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:22,782 INFO L475 AbstractCegarLoop]: Abstraction has 8657 states and 13807 transitions. [2019-10-02 12:01:22,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:01:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 8657 states and 13807 transitions. [2019-10-02 12:01:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 12:01:22,788 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:22,788 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:01:22,788 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:22,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:22,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1353206530, now seen corresponding path program 1 times [2019-10-02 12:01:22,789 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:22,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:22,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:22,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:22,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:01:22,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:01:22,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:01:22,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:01:22,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:01:22,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:01:22,964 INFO L87 Difference]: Start difference. First operand 8657 states and 13807 transitions. Second operand 9 states. [2019-10-02 12:01:27,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:27,011 INFO L93 Difference]: Finished difference Result 17217 states and 27602 transitions. [2019-10-02 12:01:27,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:01:27,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 217 [2019-10-02 12:01:27,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:27,055 INFO L225 Difference]: With dead ends: 17217 [2019-10-02 12:01:27,056 INFO L226 Difference]: Without dead ends: 8685 [2019-10-02 12:01:27,083 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:01:27,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8685 states. [2019-10-02 12:01:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8685 to 8657. [2019-10-02 12:01:27,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8657 states. [2019-10-02 12:01:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8657 states to 8657 states and 13793 transitions. [2019-10-02 12:01:27,402 INFO L78 Accepts]: Start accepts. Automaton has 8657 states and 13793 transitions. Word has length 217 [2019-10-02 12:01:27,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:27,402 INFO L475 AbstractCegarLoop]: Abstraction has 8657 states and 13793 transitions. [2019-10-02 12:01:27,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:01:27,402 INFO L276 IsEmpty]: Start isEmpty. Operand 8657 states and 13793 transitions. [2019-10-02 12:01:27,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:01:27,406 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:27,406 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:01:27,406 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:27,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:27,406 INFO L82 PathProgramCache]: Analyzing trace with hash 233246925, now seen corresponding path program 1 times [2019-10-02 12:01:27,406 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:27,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:27,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:27,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:27,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:01:27,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:01:27,622 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:01:27,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:28,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 3397 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 12:01:28,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:01:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 12:01:28,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:01:28,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-10-02 12:01:28,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:01:28,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:01:28,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:01:28,377 INFO L87 Difference]: Start difference. First operand 8657 states and 13793 transitions. Second operand 15 states. [2019-10-02 12:01:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:37,408 INFO L93 Difference]: Finished difference Result 17899 states and 28545 transitions. [2019-10-02 12:01:37,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 12:01:37,408 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 228 [2019-10-02 12:01:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:37,454 INFO L225 Difference]: With dead ends: 17899 [2019-10-02 12:01:37,454 INFO L226 Difference]: Without dead ends: 10115 [2019-10-02 12:01:37,479 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:01:37,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10115 states. [2019-10-02 12:01:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10115 to 9922. [2019-10-02 12:01:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9922 states. [2019-10-02 12:01:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9922 states to 9922 states and 15425 transitions. [2019-10-02 12:01:37,834 INFO L78 Accepts]: Start accepts. Automaton has 9922 states and 15425 transitions. Word has length 228 [2019-10-02 12:01:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:37,834 INFO L475 AbstractCegarLoop]: Abstraction has 9922 states and 15425 transitions. [2019-10-02 12:01:37,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:01:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 9922 states and 15425 transitions. [2019-10-02 12:01:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-02 12:01:37,840 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:37,840 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:01:37,841 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:37,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:37,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1638137082, now seen corresponding path program 1 times [2019-10-02 12:01:37,841 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:37,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:37,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:37,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:37,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:38,102 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-02 12:01:38,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:01:38,105 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:01:38,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:38,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 3449 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 12:01:38,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:01:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 12:01:38,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:01:38,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-02 12:01:38,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:01:38,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:01:38,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:01:38,945 INFO L87 Difference]: Start difference. First operand 9922 states and 15425 transitions. Second operand 19 states. [2019-10-02 12:01:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:48,719 INFO L93 Difference]: Finished difference Result 30852 states and 48720 transitions. [2019-10-02 12:01:48,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:01:48,719 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 254 [2019-10-02 12:01:48,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:48,844 INFO L225 Difference]: With dead ends: 30852 [2019-10-02 12:01:48,845 INFO L226 Difference]: Without dead ends: 21053 [2019-10-02 12:01:48,871 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:01:48,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21053 states. [2019-10-02 12:01:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21053 to 20901. [2019-10-02 12:01:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20901 states. [2019-10-02 12:01:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20901 states to 20901 states and 32991 transitions. [2019-10-02 12:01:49,652 INFO L78 Accepts]: Start accepts. Automaton has 20901 states and 32991 transitions. Word has length 254 [2019-10-02 12:01:49,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:49,653 INFO L475 AbstractCegarLoop]: Abstraction has 20901 states and 32991 transitions. [2019-10-02 12:01:49,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:01:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand 20901 states and 32991 transitions. [2019-10-02 12:01:49,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 12:01:49,664 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:49,664 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:01:49,664 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:49,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1964729506, now seen corresponding path program 1 times [2019-10-02 12:01:49,665 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:49,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:49,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:49,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:49,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 12:01:49,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:01:49,821 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:01:50,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:50,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 3450 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:01:50,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:01:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:01:50,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:01:50,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:01:50,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:01:50,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:01:50,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:01:50,714 INFO L87 Difference]: Start difference. First operand 20901 states and 32991 transitions. Second operand 6 states. [2019-10-02 12:01:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:51,635 INFO L93 Difference]: Finished difference Result 42251 states and 67387 transitions. [2019-10-02 12:01:51,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:01:51,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2019-10-02 12:01:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:51,758 INFO L225 Difference]: With dead ends: 42251 [2019-10-02 12:01:51,759 INFO L226 Difference]: Without dead ends: 21199 [2019-10-02 12:01:51,829 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:01:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21199 states. [2019-10-02 12:01:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21199 to 21197. [2019-10-02 12:01:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21197 states. [2019-10-02 12:01:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21197 states to 21197 states and 32916 transitions. [2019-10-02 12:01:52,891 INFO L78 Accepts]: Start accepts. Automaton has 21197 states and 32916 transitions. Word has length 255 [2019-10-02 12:01:52,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:52,891 INFO L475 AbstractCegarLoop]: Abstraction has 21197 states and 32916 transitions. [2019-10-02 12:01:52,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:01:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 21197 states and 32916 transitions. [2019-10-02 12:01:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-02 12:01:52,901 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:52,902 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:01:52,902 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:52,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:52,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1152999554, now seen corresponding path program 1 times [2019-10-02 12:01:52,902 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:52,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:52,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:52,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:52,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-02 12:01:53,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:01:53,078 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:01:53,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:53,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 4130 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:01:53,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:01:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 12:01:53,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:01:53,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-02 12:01:53,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:01:53,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:01:53,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:01:53,815 INFO L87 Difference]: Start difference. First operand 21197 states and 32916 transitions. Second operand 7 states. [2019-10-02 12:01:54,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:54,814 INFO L93 Difference]: Finished difference Result 43493 states and 68457 transitions. [2019-10-02 12:01:54,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:01:54,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 336 [2019-10-02 12:01:54,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:54,913 INFO L225 Difference]: With dead ends: 43493 [2019-10-02 12:01:54,914 INFO L226 Difference]: Without dead ends: 22413 [2019-10-02 12:01:54,990 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:01:55,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22413 states. [2019-10-02 12:01:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22413 to 22401. [2019-10-02 12:01:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22401 states. [2019-10-02 12:01:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22401 states to 22401 states and 35084 transitions. [2019-10-02 12:01:57,078 INFO L78 Accepts]: Start accepts. Automaton has 22401 states and 35084 transitions. Word has length 336 [2019-10-02 12:01:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:57,079 INFO L475 AbstractCegarLoop]: Abstraction has 22401 states and 35084 transitions. [2019-10-02 12:01:57,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:01:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 22401 states and 35084 transitions. [2019-10-02 12:01:57,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-10-02 12:01:57,092 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:57,092 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:01:57,092 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:57,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:57,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1517259905, now seen corresponding path program 1 times [2019-10-02 12:01:57,093 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:57,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:57,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:57,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:57,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:57,317 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-02 12:01:57,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:01:57,317 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:01:57,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:57,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 4135 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 12:01:57,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:01:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-10-02 12:01:58,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:01:58,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 12:01:58,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:01:58,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:01:58,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:01:58,172 INFO L87 Difference]: Start difference. First operand 22401 states and 35084 transitions. Second operand 15 states. [2019-10-02 12:02:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:10,874 INFO L93 Difference]: Finished difference Result 91378 states and 148143 transitions. [2019-10-02 12:02:10,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 12:02:10,875 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 342 [2019-10-02 12:02:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:11,218 INFO L225 Difference]: With dead ends: 91378 [2019-10-02 12:02:11,219 INFO L226 Difference]: Without dead ends: 68698 [2019-10-02 12:02:11,306 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 12:02:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68698 states. [2019-10-02 12:02:13,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68698 to 67483. [2019-10-02 12:02:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67483 states. [2019-10-02 12:02:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67483 states to 67483 states and 107309 transitions. [2019-10-02 12:02:14,029 INFO L78 Accepts]: Start accepts. Automaton has 67483 states and 107309 transitions. Word has length 342 [2019-10-02 12:02:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:14,030 INFO L475 AbstractCegarLoop]: Abstraction has 67483 states and 107309 transitions. [2019-10-02 12:02:14,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:02:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 67483 states and 107309 transitions. [2019-10-02 12:02:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-02 12:02:14,036 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:14,036 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:02:14,037 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:14,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1329488564, now seen corresponding path program 1 times [2019-10-02 12:02:14,037 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:14,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:14,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:14,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:14,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:14,219 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-02 12:02:14,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:02:14,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:02:14,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:02:14,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:02:14,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:02:14,221 INFO L87 Difference]: Start difference. First operand 67483 states and 107309 transitions. Second operand 8 states. [2019-10-02 12:02:18,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:18,425 INFO L93 Difference]: Finished difference Result 130795 states and 209985 transitions. [2019-10-02 12:02:18,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:02:18,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 292 [2019-10-02 12:02:18,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:18,851 INFO L225 Difference]: With dead ends: 130795 [2019-10-02 12:02:18,851 INFO L226 Difference]: Without dead ends: 63519 [2019-10-02 12:02:19,031 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:02:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63519 states. [2019-10-02 12:02:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63519 to 63499. [2019-10-02 12:02:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63499 states. [2019-10-02 12:02:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63499 states to 63499 states and 101623 transitions. [2019-10-02 12:02:21,692 INFO L78 Accepts]: Start accepts. Automaton has 63499 states and 101623 transitions. Word has length 292 [2019-10-02 12:02:21,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:21,693 INFO L475 AbstractCegarLoop]: Abstraction has 63499 states and 101623 transitions. [2019-10-02 12:02:21,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:02:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 63499 states and 101623 transitions. [2019-10-02 12:02:21,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 12:02:21,701 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:21,701 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:02:21,701 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:21,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:21,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1481189409, now seen corresponding path program 1 times [2019-10-02 12:02:21,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:21,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:21,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:21,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:21,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 23 proven. 19 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-02 12:02:21,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:21,932 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:02:22,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:22,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 3803 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:02:22,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 12:02:22,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:02:22,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-02 12:02:22,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:02:22,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:02:22,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:02:22,716 INFO L87 Difference]: Start difference. First operand 63499 states and 101623 transitions. Second operand 15 states. [2019-10-02 12:02:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:42,293 INFO L93 Difference]: Finished difference Result 152619 states and 248565 transitions. [2019-10-02 12:02:42,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 12:02:42,293 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 303 [2019-10-02 12:02:42,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:42,722 INFO L225 Difference]: With dead ends: 152619 [2019-10-02 12:02:42,723 INFO L226 Difference]: Without dead ends: 89217 [2019-10-02 12:02:42,876 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=372, Invalid=2280, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 12:02:42,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89217 states. [2019-10-02 12:02:49,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89217 to 85635. [2019-10-02 12:02:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85635 states. [2019-10-02 12:02:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85635 states to 85635 states and 134594 transitions. [2019-10-02 12:02:49,805 INFO L78 Accepts]: Start accepts. Automaton has 85635 states and 134594 transitions. Word has length 303 [2019-10-02 12:02:49,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:49,805 INFO L475 AbstractCegarLoop]: Abstraction has 85635 states and 134594 transitions. [2019-10-02 12:02:49,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:02:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 85635 states and 134594 transitions. [2019-10-02 12:02:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-02 12:02:49,817 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:49,817 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:02:49,817 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:49,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:49,818 INFO L82 PathProgramCache]: Analyzing trace with hash 342278673, now seen corresponding path program 1 times [2019-10-02 12:02:49,818 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:49,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:49,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:49,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:49,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-02 12:02:50,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:50,027 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:02:50,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:50,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 3801 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:02:50,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 12:02:51,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:51,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-10-02 12:02:51,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:02:51,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:02:51,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:02:51,137 INFO L87 Difference]: Start difference. First operand 85635 states and 134594 transitions. Second operand 8 states. [2019-10-02 12:03:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:05,318 INFO L93 Difference]: Finished difference Result 224066 states and 357423 transitions. [2019-10-02 12:03:05,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 12:03:05,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 304 [2019-10-02 12:03:05,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:06,524 INFO L225 Difference]: With dead ends: 224066 [2019-10-02 12:03:06,524 INFO L226 Difference]: Without dead ends: 138297 [2019-10-02 12:03:06,734 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:03:06,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138297 states. [2019-10-02 12:03:15,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138297 to 135061. [2019-10-02 12:03:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135061 states. [2019-10-02 12:03:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135061 states to 135061 states and 213704 transitions. [2019-10-02 12:03:15,864 INFO L78 Accepts]: Start accepts. Automaton has 135061 states and 213704 transitions. Word has length 304 [2019-10-02 12:03:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:15,864 INFO L475 AbstractCegarLoop]: Abstraction has 135061 states and 213704 transitions. [2019-10-02 12:03:15,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:03:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 135061 states and 213704 transitions. [2019-10-02 12:03:15,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-02 12:03:15,881 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:15,881 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:03:15,881 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:15,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1587114854, now seen corresponding path program 1 times [2019-10-02 12:03:15,882 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:15,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:15,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:15,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:15,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-10-02 12:03:16,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:16,107 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:16,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:16,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 3802 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:03:16,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:03:16,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:03:16,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-10-02 12:03:16,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:03:16,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:03:16,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:03:16,889 INFO L87 Difference]: Start difference. First operand 135061 states and 213704 transitions. Second operand 15 states. [2019-10-02 12:03:38,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:38,182 INFO L93 Difference]: Finished difference Result 306799 states and 484198 transitions. [2019-10-02 12:03:38,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 12:03:38,183 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 306 [2019-10-02 12:03:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:39,313 INFO L225 Difference]: With dead ends: 306799 [2019-10-02 12:03:39,313 INFO L226 Difference]: Without dead ends: 169042 [2019-10-02 12:03:39,704 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-10-02 12:03:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169042 states. [2019-10-02 12:03:50,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169042 to 168036. [2019-10-02 12:03:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168036 states. [2019-10-02 12:03:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168036 states to 168036 states and 264520 transitions. [2019-10-02 12:03:51,844 INFO L78 Accepts]: Start accepts. Automaton has 168036 states and 264520 transitions. Word has length 306 [2019-10-02 12:03:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:51,845 INFO L475 AbstractCegarLoop]: Abstraction has 168036 states and 264520 transitions. [2019-10-02 12:03:51,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:03:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 168036 states and 264520 transitions. [2019-10-02 12:03:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-10-02 12:03:51,862 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:51,863 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:03:51,863 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:51,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:51,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1216139042, now seen corresponding path program 1 times [2019-10-02 12:03:51,863 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:51,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:51,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:51,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:51,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-10-02 12:03:52,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:52,127 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:52,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:52,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 3807 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:03:52,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-02 12:03:52,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:52,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-10-02 12:03:52,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:03:52,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:03:52,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:03:52,862 INFO L87 Difference]: Start difference. First operand 168036 states and 264520 transitions. Second operand 13 states. [2019-10-02 12:04:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:33,628 INFO L93 Difference]: Finished difference Result 575795 states and 929313 transitions. [2019-10-02 12:04:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:04:33,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 307 [2019-10-02 12:04:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:35,863 INFO L225 Difference]: With dead ends: 575795 [2019-10-02 12:04:35,863 INFO L226 Difference]: Without dead ends: 408002 [2019-10-02 12:04:43,224 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:04:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408002 states. [2019-10-02 12:05:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408002 to 404304. [2019-10-02 12:05:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404304 states. [2019-10-02 12:05:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404304 states to 404304 states and 650607 transitions. [2019-10-02 12:05:13,284 INFO L78 Accepts]: Start accepts. Automaton has 404304 states and 650607 transitions. Word has length 307 [2019-10-02 12:05:13,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:13,284 INFO L475 AbstractCegarLoop]: Abstraction has 404304 states and 650607 transitions. [2019-10-02 12:05:13,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:05:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 404304 states and 650607 transitions. [2019-10-02 12:05:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-02 12:05:13,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:13,324 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:05:13,324 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:13,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:13,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1834047227, now seen corresponding path program 1 times [2019-10-02 12:05:13,325 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:13,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:13,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:13,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:13,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 12:05:13,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:13,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:05:13,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:05:13,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:05:13,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:05:13,514 INFO L87 Difference]: Start difference. First operand 404304 states and 650607 transitions. Second operand 7 states. [2019-10-02 12:05:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:58,767 INFO L93 Difference]: Finished difference Result 909323 states and 1486867 transitions. [2019-10-02 12:05:58,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:05:58,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 310 [2019-10-02 12:05:58,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:02,748 INFO L225 Difference]: With dead ends: 909323 [2019-10-02 12:06:02,748 INFO L226 Difference]: Without dead ends: 504461 [2019-10-02 12:06:03,843 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:06:04,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504461 states. [2019-10-02 12:06:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504461 to 501665. [2019-10-02 12:06:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501665 states. [2019-10-02 12:07:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501665 states to 501665 states and 815170 transitions. [2019-10-02 12:07:00,316 INFO L78 Accepts]: Start accepts. Automaton has 501665 states and 815170 transitions. Word has length 310 [2019-10-02 12:07:00,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:00,317 INFO L475 AbstractCegarLoop]: Abstraction has 501665 states and 815170 transitions. [2019-10-02 12:07:00,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:07:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 501665 states and 815170 transitions. [2019-10-02 12:07:00,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-02 12:07:00,347 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:00,348 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:07:00,348 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:00,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:00,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1595761367, now seen corresponding path program 1 times [2019-10-02 12:07:00,348 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:00,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:00,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:00,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:00,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 12:07:00,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:00,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:07:00,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:07:00,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:07:00,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:07:00,526 INFO L87 Difference]: Start difference. First operand 501665 states and 815170 transitions. Second operand 7 states. [2019-10-02 12:07:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:57,454 INFO L93 Difference]: Finished difference Result 1087137 states and 1796823 transitions. [2019-10-02 12:07:57,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:07:57,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 311 [2019-10-02 12:07:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:02,558 INFO L225 Difference]: With dead ends: 1087137 [2019-10-02 12:08:02,558 INFO L226 Difference]: Without dead ends: 584466 [2019-10-02 12:08:05,350 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:08:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584466 states. [2019-10-02 12:09:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584466 to 580917. [2019-10-02 12:09:09,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580917 states. [2019-10-02 12:09:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580917 states to 580917 states and 942239 transitions. [2019-10-02 12:09:15,416 INFO L78 Accepts]: Start accepts. Automaton has 580917 states and 942239 transitions. Word has length 311 [2019-10-02 12:09:15,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:15,416 INFO L475 AbstractCegarLoop]: Abstraction has 580917 states and 942239 transitions. [2019-10-02 12:09:15,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:09:15,416 INFO L276 IsEmpty]: Start isEmpty. Operand 580917 states and 942239 transitions. [2019-10-02 12:09:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-02 12:09:15,457 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:15,458 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:09:15,458 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:15,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:15,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1492443014, now seen corresponding path program 1 times [2019-10-02 12:09:15,458 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:15,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:15,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:15,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:15,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-10-02 12:09:15,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:15,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:09:15,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:09:15,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:09:15,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:09:15,646 INFO L87 Difference]: Start difference. First operand 580917 states and 942239 transitions. Second operand 9 states. [2019-10-02 12:09:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:58,388 INFO L93 Difference]: Finished difference Result 854140 states and 1368466 transitions. [2019-10-02 12:09:59,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:09:59,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 311 [2019-10-02 12:09:59,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:03,005 INFO L225 Difference]: With dead ends: 854140 [2019-10-02 12:10:03,005 INFO L226 Difference]: Without dead ends: 575587 [2019-10-02 12:10:04,975 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:10:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575587 states.