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_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:13:13,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:13:13,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:13:13,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:13:13,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:13:13,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:13:13,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:13:13,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:13:13,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:13:13,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:13:13,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:13:13,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:13:13,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:13:13,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:13:13,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:13:13,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:13:13,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:13:13,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:13:13,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:13:13,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:13:13,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:13:13,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:13:13,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:13:13,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:13:13,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:13:13,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:13:13,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:13:13,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:13:13,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:13:13,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:13:13,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:13:13,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:13:13,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:13:13,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:13:13,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:13:13,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:13:13,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:13:13,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:13:13,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:13:13,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:13:13,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:13:13,689 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:13:13,704 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:13:13,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:13:13,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:13:13,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:13:13,706 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:13:13,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:13:13,707 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:13:13,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:13:13,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:13:13,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:13:13,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:13:13,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:13:13,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:13:13,708 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:13:13,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:13:13,708 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:13:13,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:13:13,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:13:13,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:13:13,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:13:13,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:13:13,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:13:13,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:13:13,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:13:13,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:13:13,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:13:13,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:13:13,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:13:13,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:13:13,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:13:13,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:13:13,761 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:13:13,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:13:13,765 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:13:13,766 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_productSimulator.cil.c [2019-10-02 12:13:13,842 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88df43fb4/82b1ce7b433c47a0822df39dbba24374/FLAGac7d33d03 [2019-10-02 12:13:14,550 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:13:14,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_productSimulator.cil.c [2019-10-02 12:13:14,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88df43fb4/82b1ce7b433c47a0822df39dbba24374/FLAGac7d33d03 [2019-10-02 12:13:14,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88df43fb4/82b1ce7b433c47a0822df39dbba24374 [2019-10-02 12:13:14,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:13:14,817 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:13:14,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:13:14,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:13:14,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:13:14,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:13:14" (1/1) ... [2019-10-02 12:13:14,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2471a011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:14, skipping insertion in model container [2019-10-02 12:13:14,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:13:14" (1/1) ... [2019-10-02 12:13:14,833 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:13:14,924 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:13:15,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:13:15,671 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:13:15,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:13:16,003 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:13:16,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:16 WrapperNode [2019-10-02 12:13:16,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:13:16,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:13:16,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:13:16,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:13:16,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:16" (1/1) ... [2019-10-02 12:13:16,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:16" (1/1) ... [2019-10-02 12:13:16,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:16" (1/1) ... [2019-10-02 12:13:16,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:16" (1/1) ... [2019-10-02 12:13:16,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:16" (1/1) ... [2019-10-02 12:13:16,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:16" (1/1) ... [2019-10-02 12:13:16,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:16" (1/1) ... [2019-10-02 12:13:16,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:13:16,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:13:16,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:13:16,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:13:16,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:16" (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:13:16,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:13:16,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:13:16,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:13:16,349 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:13:16,351 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:13:16,351 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:13:16,351 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:13:16,352 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:13:16,353 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:13:16,353 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:13:16,353 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:13:16,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:13:16,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:13:16,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:13:16,356 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:13:16,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:13:16,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:13:16,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:13:16,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:13:16,360 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:13:16,360 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:13:16,360 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:13:16,361 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:13:16,361 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:13:16,361 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:13:16,361 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:13:16,361 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:13:16,362 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:13:16,362 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:13:16,362 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__before__overloaded [2019-10-02 12:13:16,363 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__role__overloaded [2019-10-02 12:13:16,363 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:13:16,363 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__before__weight [2019-10-02 12:13:16,363 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__role__weight [2019-10-02 12:13:16,364 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:13:16,364 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__weight [2019-10-02 12:13:16,364 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__weight [2019-10-02 12:13:16,364 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__empty [2019-10-02 12:13:16,364 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__empty [2019-10-02 12:13:16,365 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:13:16,365 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:13:16,365 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:13:16,365 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:13:16,365 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:13:16,365 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:13:16,365 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:13:16,366 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:13:16,366 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:13:16,366 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:13:16,366 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-02 12:13:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-02 12:13:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__executivefloor [2019-10-02 12:13:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__executivefloor [2019-10-02 12:13:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:13:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:13:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:13:16,368 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-02 12:13:16,368 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-02 12:13:16,368 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-02 12:13:16,368 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-02 12:13:16,368 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:13:16,368 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:13:16,369 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:13:16,369 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__before__overloaded [2019-10-02 12:13:16,369 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__role__overloaded [2019-10-02 12:13:16,369 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:13:16,370 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__before__overloaded [2019-10-02 12:13:16,370 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__role__overloaded [2019-10-02 12:13:16,370 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:13:16,371 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:13:16,371 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:13:16,371 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:13:16,371 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:13:16,371 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:13:16,372 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:13:16,372 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:13:16,372 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:13:16,372 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:13:16,373 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:13:16,373 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:13:16,373 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:13:16,373 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:13:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:13:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:13:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:13:16,375 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:13:16,375 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:13:16,376 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:13:16,376 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:13:16,376 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:13:16,377 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:13:16,377 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:13:16,378 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:13:16,378 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:13:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:13:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:13:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:13:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:13:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:13:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:13:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:13:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:13:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:13:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:13:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:13:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:13:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:13:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:13:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:13:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:13:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:13:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:13:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:13:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:13:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:13:16,384 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:13:16,384 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:13:16,384 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:13:16,385 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:13:16,385 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:13:16,385 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:13:16,385 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:13:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:13:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:13:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:13:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:13:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:13:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:13:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:13:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:13:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:13:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:13:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:13:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:13:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:13:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:13:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:13:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:13:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:13:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:13:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:13:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:13:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:13:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:13:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:13:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:13:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:13:16,403 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:13:16,403 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:13:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__before__overloaded [2019-10-02 12:13:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__role__overloaded [2019-10-02 12:13:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__before__weight [2019-10-02 12:13:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__role__weight [2019-10-02 12:13:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__weight [2019-10-02 12:13:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__weight [2019-10-02 12:13:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__empty [2019-10-02 12:13:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__empty [2019-10-02 12:13:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:13:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:13:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:13:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:13:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:13:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-02 12:13:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-02 12:13:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__executivefloor [2019-10-02 12:13:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__executivefloor [2019-10-02 12:13:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:13:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:13:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-02 12:13:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-02 12:13:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-02 12:13:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-02 12:13:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:13:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:13:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:13:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__before__overloaded [2019-10-02 12:13:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__role__overloaded [2019-10-02 12:13:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure printState__before__overloaded [2019-10-02 12:13:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure printState__role__overloaded [2019-10-02 12:13:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:13:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:13:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:13:16,410 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:13:16,410 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:13:16,410 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:13:16,410 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:13:16,410 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:13:16,410 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:13:16,410 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:13:16,411 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:13:16,411 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:13:16,411 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:13:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:13:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:13:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:13:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:13:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:13:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:13:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:13:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:13:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:13:19,126 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:13:19,126 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:13:19,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:13:19 BoogieIcfgContainer [2019-10-02 12:13:19,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:13:19,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:13:19,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:13:19,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:13:19,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:13:14" (1/3) ... [2019-10-02 12:13:19,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6dbfce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:13:19, skipping insertion in model container [2019-10-02 12:13:19,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:16" (2/3) ... [2019-10-02 12:13:19,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6dbfce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:13:19, skipping insertion in model container [2019-10-02 12:13:19,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:13:19" (3/3) ... [2019-10-02 12:13:19,140 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_productSimulator.cil.c [2019-10-02 12:13:19,151 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:13:19,169 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:13:19,188 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:13:19,245 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:13:19,246 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:13:19,246 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:13:19,246 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:13:19,246 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:13:19,246 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:13:19,247 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:13:19,247 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:13:19,247 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:13:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states. [2019-10-02 12:13:19,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 12:13:19,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:19,358 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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:13:19,361 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:19,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:19,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1052026056, now seen corresponding path program 1 times [2019-10-02 12:13:19,373 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:19,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:19,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:19,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:19,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:13:20,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:20,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:13:20,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:13:20,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:13:20,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:13:20,279 INFO L87 Difference]: Start difference. First operand 927 states. Second operand 6 states. [2019-10-02 12:13:20,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:20,506 INFO L93 Difference]: Finished difference Result 1511 states and 2355 transitions. [2019-10-02 12:13:20,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:13:20,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-02 12:13:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:20,549 INFO L225 Difference]: With dead ends: 1511 [2019-10-02 12:13:20,549 INFO L226 Difference]: Without dead ends: 761 [2019-10-02 12:13:20,565 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:13:20,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-02 12:13:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-02 12:13:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-02 12:13:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1174 transitions. [2019-10-02 12:13:20,728 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1174 transitions. Word has length 150 [2019-10-02 12:13:20,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:20,736 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 1174 transitions. [2019-10-02 12:13:20,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:13:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1174 transitions. [2019-10-02 12:13:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 12:13:20,751 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:20,754 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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:13:20,755 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:20,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:20,756 INFO L82 PathProgramCache]: Analyzing trace with hash 716196849, now seen corresponding path program 1 times [2019-10-02 12:13:20,756 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:20,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:20,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:20,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:20,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:13:21,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:13:21,091 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:13:21,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:21,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 3583 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:13:21,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:13:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:13:22,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:13:22,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 12:13:22,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:13:22,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:13:22,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:13:22,073 INFO L87 Difference]: Start difference. First operand 761 states and 1174 transitions. Second operand 5 states. [2019-10-02 12:13:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:22,430 INFO L93 Difference]: Finished difference Result 2182 states and 3417 transitions. [2019-10-02 12:13:22,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:13:22,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-02 12:13:22,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:22,452 INFO L225 Difference]: With dead ends: 2182 [2019-10-02 12:13:22,453 INFO L226 Difference]: Without dead ends: 1468 [2019-10-02 12:13:22,458 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:13:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2019-10-02 12:13:22,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1455. [2019-10-02 12:13:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-10-02 12:13:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2266 transitions. [2019-10-02 12:13:22,527 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2266 transitions. Word has length 153 [2019-10-02 12:13:22,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:22,528 INFO L475 AbstractCegarLoop]: Abstraction has 1455 states and 2266 transitions. [2019-10-02 12:13:22,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:13:22,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2266 transitions. [2019-10-02 12:13:22,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 12:13:22,532 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:22,533 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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:13:22,533 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:22,533 INFO L82 PathProgramCache]: Analyzing trace with hash 662613507, now seen corresponding path program 1 times [2019-10-02 12:13:22,533 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:22,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:22,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:22,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:22,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:13:22,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:13:22,711 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:13:22,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:23,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 3585 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:13:23,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:13:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:13:23,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:13:23,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:13:23,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:13:23,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:13:23,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:13:23,609 INFO L87 Difference]: Start difference. First operand 1455 states and 2266 transitions. Second operand 6 states. [2019-10-02 12:13:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:23,754 INFO L93 Difference]: Finished difference Result 2843 states and 4460 transitions. [2019-10-02 12:13:23,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:13:23,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-10-02 12:13:23,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:23,772 INFO L225 Difference]: With dead ends: 2843 [2019-10-02 12:13:23,772 INFO L226 Difference]: Without dead ends: 1455 [2019-10-02 12:13:23,779 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 155 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:13:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2019-10-02 12:13:23,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1455. [2019-10-02 12:13:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-10-02 12:13:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2264 transitions. [2019-10-02 12:13:23,846 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2264 transitions. Word has length 156 [2019-10-02 12:13:23,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:23,846 INFO L475 AbstractCegarLoop]: Abstraction has 1455 states and 2264 transitions. [2019-10-02 12:13:23,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:13:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2264 transitions. [2019-10-02 12:13:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:13:23,854 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:23,854 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:13:23,854 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:23,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:23,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1295948095, now seen corresponding path program 1 times [2019-10-02 12:13:23,855 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:23,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:23,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:23,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:23,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:13:24,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:13:24,083 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:13:24,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:24,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 3587 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:13:24,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:13:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:13:25,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:13:25,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:13:25,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:13:25,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:13:25,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:13:25,008 INFO L87 Difference]: Start difference. First operand 1455 states and 2264 transitions. Second operand 6 states. [2019-10-02 12:13:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:25,122 INFO L93 Difference]: Finished difference Result 2851 states and 4466 transitions. [2019-10-02 12:13:25,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:13:25,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-10-02 12:13:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:25,135 INFO L225 Difference]: With dead ends: 2851 [2019-10-02 12:13:25,135 INFO L226 Difference]: Without dead ends: 1467 [2019-10-02 12:13:25,143 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 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:13:25,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2019-10-02 12:13:25,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1467. [2019-10-02 12:13:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1467 states. [2019-10-02 12:13:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2274 transitions. [2019-10-02 12:13:25,198 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2274 transitions. Word has length 158 [2019-10-02 12:13:25,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:25,199 INFO L475 AbstractCegarLoop]: Abstraction has 1467 states and 2274 transitions. [2019-10-02 12:13:25,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:13:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2274 transitions. [2019-10-02 12:13:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:13:25,204 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:25,204 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:13:25,204 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:25,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:25,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2004070236, now seen corresponding path program 1 times [2019-10-02 12:13:25,205 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:25,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:25,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:25,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:25,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:13:25,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:13:25,351 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:13:25,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:26,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 3588 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:13:26,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:13:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 12:13:26,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:13:26,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:13:26,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:13:26,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:13:26,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:13:26,222 INFO L87 Difference]: Start difference. First operand 1467 states and 2274 transitions. Second operand 6 states. [2019-10-02 12:13:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:26,364 INFO L93 Difference]: Finished difference Result 2849 states and 4448 transitions. [2019-10-02 12:13:26,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:13:26,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-02 12:13:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:26,377 INFO L225 Difference]: With dead ends: 2849 [2019-10-02 12:13:26,377 INFO L226 Difference]: Without dead ends: 1467 [2019-10-02 12:13:26,385 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 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:13:26,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2019-10-02 12:13:26,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1467. [2019-10-02 12:13:26,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1467 states. [2019-10-02 12:13:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2272 transitions. [2019-10-02 12:13:26,464 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2272 transitions. Word has length 159 [2019-10-02 12:13:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:26,465 INFO L475 AbstractCegarLoop]: Abstraction has 1467 states and 2272 transitions. [2019-10-02 12:13:26,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:13:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2272 transitions. [2019-10-02 12:13:26,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 12:13:26,469 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:26,470 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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:13:26,470 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:26,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:26,471 INFO L82 PathProgramCache]: Analyzing trace with hash 714002147, now seen corresponding path program 1 times [2019-10-02 12:13:26,471 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:26,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:26,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:26,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:26,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:13:26,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:13:26,646 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:13:26,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:27,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 3589 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:13:27,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:13:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 12:13:27,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:13:27,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:13:27,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:13:27,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:13:27,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:13:27,563 INFO L87 Difference]: Start difference. First operand 1467 states and 2272 transitions. Second operand 6 states. [2019-10-02 12:13:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:27,702 INFO L93 Difference]: Finished difference Result 2849 states and 4446 transitions. [2019-10-02 12:13:27,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:13:27,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2019-10-02 12:13:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:27,717 INFO L225 Difference]: With dead ends: 2849 [2019-10-02 12:13:27,718 INFO L226 Difference]: Without dead ends: 1467 [2019-10-02 12:13:27,727 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 160 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:13:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2019-10-02 12:13:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1467. [2019-10-02 12:13:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1467 states. [2019-10-02 12:13:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2270 transitions. [2019-10-02 12:13:27,805 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2270 transitions. Word has length 160 [2019-10-02 12:13:27,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:27,806 INFO L475 AbstractCegarLoop]: Abstraction has 1467 states and 2270 transitions. [2019-10-02 12:13:27,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:13:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2270 transitions. [2019-10-02 12:13:27,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:13:27,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:27,812 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:13:27,812 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:27,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:27,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1904546368, now seen corresponding path program 1 times [2019-10-02 12:13:27,813 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:27,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:27,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:27,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:27,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:13:28,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:13:28,020 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:13:28,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:28,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 3590 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 12:13:28,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:13:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:13:28,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:13:28,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 12:13:28,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:13:28,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:13:28,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:13:28,911 INFO L87 Difference]: Start difference. First operand 1467 states and 2270 transitions. Second operand 14 states. [2019-10-02 12:13:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:29,423 INFO L93 Difference]: Finished difference Result 2859 states and 4460 transitions. [2019-10-02 12:13:29,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:13:29,424 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 161 [2019-10-02 12:13:29,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:29,435 INFO L225 Difference]: With dead ends: 2859 [2019-10-02 12:13:29,436 INFO L226 Difference]: Without dead ends: 1485 [2019-10-02 12:13:29,443 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-10-02 12:13:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-10-02 12:13:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1481. [2019-10-02 12:13:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-10-02 12:13:29,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2290 transitions. [2019-10-02 12:13:29,519 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2290 transitions. Word has length 161 [2019-10-02 12:13:29,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:29,520 INFO L475 AbstractCegarLoop]: Abstraction has 1481 states and 2290 transitions. [2019-10-02 12:13:29,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:13:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2290 transitions. [2019-10-02 12:13:29,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:13:29,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:29,525 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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:13:29,526 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:29,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:29,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1593140418, now seen corresponding path program 1 times [2019-10-02 12:13:29,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:29,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:29,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:29,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:29,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 12:13:29,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:13:29,708 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:13:29,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:30,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 3591 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:13:30,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:13:30,508 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:13:30,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:13:30,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:13:30,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:13:30,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:13:30,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:13:30,530 INFO L87 Difference]: Start difference. First operand 1481 states and 2290 transitions. Second operand 8 states. [2019-10-02 12:13:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:30,886 INFO L93 Difference]: Finished difference Result 2873 states and 4486 transitions. [2019-10-02 12:13:30,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:13:30,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 162 [2019-10-02 12:13:30,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:30,899 INFO L225 Difference]: With dead ends: 2873 [2019-10-02 12:13:30,900 INFO L226 Difference]: Without dead ends: 1481 [2019-10-02 12:13:30,908 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 164 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:13:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-10-02 12:13:30,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-10-02 12:13:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-10-02 12:13:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2280 transitions. [2019-10-02 12:13:30,972 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2280 transitions. Word has length 162 [2019-10-02 12:13:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:30,972 INFO L475 AbstractCegarLoop]: Abstraction has 1481 states and 2280 transitions. [2019-10-02 12:13:30,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:13:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2280 transitions. [2019-10-02 12:13:30,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 12:13:30,976 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:30,977 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:13:30,977 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:30,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:30,977 INFO L82 PathProgramCache]: Analyzing trace with hash -804498471, now seen corresponding path program 1 times [2019-10-02 12:13:30,978 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:30,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:30,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:30,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:30,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-02 12:13:31,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:13:31,209 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:13:31,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:32,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 3591 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:13:32,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:13:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:13:32,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:13:32,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:13:32,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:13:32,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:13:32,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:13:32,198 INFO L87 Difference]: Start difference. First operand 1481 states and 2280 transitions. Second operand 6 states. [2019-10-02 12:13:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:32,519 INFO L93 Difference]: Finished difference Result 2873 states and 4462 transitions. [2019-10-02 12:13:32,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:13:32,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-10-02 12:13:32,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:32,532 INFO L225 Difference]: With dead ends: 2873 [2019-10-02 12:13:32,533 INFO L226 Difference]: Without dead ends: 1473 [2019-10-02 12:13:32,540 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 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:13:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2019-10-02 12:13:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1473. [2019-10-02 12:13:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2019-10-02 12:13:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2256 transitions. [2019-10-02 12:13:32,603 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2256 transitions. Word has length 163 [2019-10-02 12:13:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:32,604 INFO L475 AbstractCegarLoop]: Abstraction has 1473 states and 2256 transitions. [2019-10-02 12:13:32,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:13:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2256 transitions. [2019-10-02 12:13:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:13:32,610 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:32,610 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:13:32,611 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:32,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:32,611 INFO L82 PathProgramCache]: Analyzing trace with hash 515079284, now seen corresponding path program 1 times [2019-10-02 12:13:32,611 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:32,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:32,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:32,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:32,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 12:13:32,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:13:32,754 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:13:32,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:33,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 3595 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:13:33,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:13:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:13:33,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:13:33,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:13:33,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:13:33,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:13:33,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:13:33,673 INFO L87 Difference]: Start difference. First operand 1473 states and 2256 transitions. Second operand 8 states. [2019-10-02 12:13:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:34,015 INFO L93 Difference]: Finished difference Result 2907 states and 4490 transitions. [2019-10-02 12:13:34,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:13:34,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-10-02 12:13:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:34,030 INFO L225 Difference]: With dead ends: 2907 [2019-10-02 12:13:34,030 INFO L226 Difference]: Without dead ends: 1509 [2019-10-02 12:13:34,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 167 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:13:34,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2019-10-02 12:13:34,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1503. [2019-10-02 12:13:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-10-02 12:13:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2282 transitions. [2019-10-02 12:13:34,106 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2282 transitions. Word has length 166 [2019-10-02 12:13:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:34,106 INFO L475 AbstractCegarLoop]: Abstraction has 1503 states and 2282 transitions. [2019-10-02 12:13:34,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:13:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2282 transitions. [2019-10-02 12:13:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:13:34,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:34,111 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:13:34,111 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:34,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:34,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1305702388, now seen corresponding path program 1 times [2019-10-02 12:13:34,111 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:34,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:34,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:34,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:34,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:13:34,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:13:34,303 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:13:34,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:35,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 3591 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:13:35,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:13:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:13:35,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:13:35,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:13:35,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:13:35,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:13:35,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:13:35,169 INFO L87 Difference]: Start difference. First operand 1503 states and 2282 transitions. Second operand 14 states. [2019-10-02 12:13:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:35,565 INFO L93 Difference]: Finished difference Result 2887 states and 4420 transitions. [2019-10-02 12:13:35,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:13:35,565 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 166 [2019-10-02 12:13:35,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:35,577 INFO L225 Difference]: With dead ends: 2887 [2019-10-02 12:13:35,577 INFO L226 Difference]: Without dead ends: 1491 [2019-10-02 12:13:35,584 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:13:35,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2019-10-02 12:13:35,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1481. [2019-10-02 12:13:35,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-10-02 12:13:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2242 transitions. [2019-10-02 12:13:35,645 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2242 transitions. Word has length 166 [2019-10-02 12:13:35,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:35,646 INFO L475 AbstractCegarLoop]: Abstraction has 1481 states and 2242 transitions. [2019-10-02 12:13:35,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:13:35,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2242 transitions. [2019-10-02 12:13:35,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:13:35,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:35,651 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:13:35,651 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:35,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:35,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1372140760, now seen corresponding path program 1 times [2019-10-02 12:13:35,652 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:35,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:35,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:35,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:35,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 12:13:35,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:13:35,838 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:13:36,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:36,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 3598 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:13:36,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:13:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:13:36,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:13:36,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:13:36,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:13:36,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:13:36,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:13:36,727 INFO L87 Difference]: Start difference. First operand 1481 states and 2242 transitions. Second operand 8 states. [2019-10-02 12:13:36,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:36,982 INFO L93 Difference]: Finished difference Result 2851 states and 4358 transitions. [2019-10-02 12:13:36,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:13:36,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 169 [2019-10-02 12:13:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:36,995 INFO L225 Difference]: With dead ends: 2851 [2019-10-02 12:13:36,995 INFO L226 Difference]: Without dead ends: 1481 [2019-10-02 12:13:37,002 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 171 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:13:37,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-10-02 12:13:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-10-02 12:13:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-10-02 12:13:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2240 transitions. [2019-10-02 12:13:37,056 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2240 transitions. Word has length 169 [2019-10-02 12:13:37,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:37,056 INFO L475 AbstractCegarLoop]: Abstraction has 1481 states and 2240 transitions. [2019-10-02 12:13:37,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:13:37,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2240 transitions. [2019-10-02 12:13:37,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:13:37,060 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:37,061 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:13:37,061 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:37,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:37,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1199905292, now seen corresponding path program 1 times [2019-10-02 12:13:37,062 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:37,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:37,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:37,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:37,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 12:13:37,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:13:37,232 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:13:37,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:38,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 3599 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:13:38,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:13:38,125 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:13:38,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:13:38,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:13:38,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:13:38,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:13:38,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:13:38,145 INFO L87 Difference]: Start difference. First operand 1481 states and 2240 transitions. Second operand 8 states. [2019-10-02 12:13:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:38,400 INFO L93 Difference]: Finished difference Result 2851 states and 4356 transitions. [2019-10-02 12:13:38,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:13:38,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2019-10-02 12:13:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:38,412 INFO L225 Difference]: With dead ends: 2851 [2019-10-02 12:13:38,412 INFO L226 Difference]: Without dead ends: 1481 [2019-10-02 12:13:38,420 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 172 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:13:38,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-10-02 12:13:38,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-10-02 12:13:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-10-02 12:13:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2238 transitions. [2019-10-02 12:13:38,492 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2238 transitions. Word has length 170 [2019-10-02 12:13:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:38,492 INFO L475 AbstractCegarLoop]: Abstraction has 1481 states and 2238 transitions. [2019-10-02 12:13:38,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:13:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2238 transitions. [2019-10-02 12:13:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 12:13:38,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:38,499 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:13:38,500 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:38,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:38,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1068736499, now seen corresponding path program 1 times [2019-10-02 12:13:38,501 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:38,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:38,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:38,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:38,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:38,865 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 12:13:38,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:13:38,865 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:13:39,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:39,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 3600 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:13:39,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:13:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:13:39,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:13:39,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2019-10-02 12:13:39,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 12:13:39,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 12:13:39,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:13:39,699 INFO L87 Difference]: Start difference. First operand 1481 states and 2238 transitions. Second operand 17 states. [2019-10-02 12:13:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:41,130 INFO L93 Difference]: Finished difference Result 2883 states and 4410 transitions. [2019-10-02 12:13:41,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:13:41,131 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 171 [2019-10-02 12:13:41,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:41,143 INFO L225 Difference]: With dead ends: 2883 [2019-10-02 12:13:41,143 INFO L226 Difference]: Without dead ends: 1511 [2019-10-02 12:13:41,150 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-10-02 12:13:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2019-10-02 12:13:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1503. [2019-10-02 12:13:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-10-02 12:13:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2254 transitions. [2019-10-02 12:13:41,208 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2254 transitions. Word has length 171 [2019-10-02 12:13:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:41,208 INFO L475 AbstractCegarLoop]: Abstraction has 1503 states and 2254 transitions. [2019-10-02 12:13:41,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 12:13:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2254 transitions. [2019-10-02 12:13:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 12:13:41,213 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:41,213 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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:13:41,214 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:41,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:41,214 INFO L82 PathProgramCache]: Analyzing trace with hash 733884632, now seen corresponding path program 1 times [2019-10-02 12:13:41,214 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:41,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:41,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:41,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:41,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 12:13:41,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:41,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:13:41,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:13:41,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:13:41,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:13:41,433 INFO L87 Difference]: Start difference. First operand 1503 states and 2254 transitions. Second operand 9 states. [2019-10-02 12:13:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:41,665 INFO L93 Difference]: Finished difference Result 2745 states and 4202 transitions. [2019-10-02 12:13:41,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:13:41,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 172 [2019-10-02 12:13:41,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:41,676 INFO L225 Difference]: With dead ends: 2745 [2019-10-02 12:13:41,676 INFO L226 Difference]: Without dead ends: 1497 [2019-10-02 12:13:41,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:13:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-10-02 12:13:41,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1497. [2019-10-02 12:13:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-10-02 12:13:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2244 transitions. [2019-10-02 12:13:41,733 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2244 transitions. Word has length 172 [2019-10-02 12:13:41,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:41,734 INFO L475 AbstractCegarLoop]: Abstraction has 1497 states and 2244 transitions. [2019-10-02 12:13:41,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:13:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2244 transitions. [2019-10-02 12:13:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 12:13:41,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:41,738 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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:13:41,738 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:41,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:41,739 INFO L82 PathProgramCache]: Analyzing trace with hash -461244277, now seen corresponding path program 1 times [2019-10-02 12:13:41,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:41,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:41,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:41,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:41,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 12:13:41,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:41,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:13:41,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:13:41,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:13:41,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:13:41,962 INFO L87 Difference]: Start difference. First operand 1497 states and 2244 transitions. Second operand 7 states. [2019-10-02 12:13:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:42,165 INFO L93 Difference]: Finished difference Result 2739 states and 4192 transitions. [2019-10-02 12:13:42,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:13:42,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 173 [2019-10-02 12:13:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:42,175 INFO L225 Difference]: With dead ends: 2739 [2019-10-02 12:13:42,175 INFO L226 Difference]: Without dead ends: 1455 [2019-10-02 12:13:42,182 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:13:42,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2019-10-02 12:13:42,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1451. [2019-10-02 12:13:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-10-02 12:13:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2184 transitions. [2019-10-02 12:13:42,238 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2184 transitions. Word has length 173 [2019-10-02 12:13:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:42,242 INFO L475 AbstractCegarLoop]: Abstraction has 1451 states and 2184 transitions. [2019-10-02 12:13:42,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:13:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2184 transitions. [2019-10-02 12:13:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 12:13:42,246 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:42,247 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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:13:42,247 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:42,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:42,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1263451731, now seen corresponding path program 1 times [2019-10-02 12:13:42,248 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:42,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:42,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:42,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:42,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:13:42,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:42,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:13:42,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:13:42,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:13:42,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:13:42,538 INFO L87 Difference]: Start difference. First operand 1451 states and 2184 transitions. Second operand 13 states. [2019-10-02 12:13:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:43,008 INFO L93 Difference]: Finished difference Result 2825 states and 4304 transitions. [2019-10-02 12:13:43,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:13:43,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 174 [2019-10-02 12:13:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:43,036 INFO L225 Difference]: With dead ends: 2825 [2019-10-02 12:13:43,036 INFO L226 Difference]: Without dead ends: 1479 [2019-10-02 12:13:43,045 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:13:43,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2019-10-02 12:13:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1475. [2019-10-02 12:13:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2019-10-02 12:13:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2214 transitions. [2019-10-02 12:13:43,100 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2214 transitions. Word has length 174 [2019-10-02 12:13:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:43,100 INFO L475 AbstractCegarLoop]: Abstraction has 1475 states and 2214 transitions. [2019-10-02 12:13:43,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:13:43,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2214 transitions. [2019-10-02 12:13:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 12:13:43,105 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:43,106 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:13:43,106 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:43,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:43,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1661164144, now seen corresponding path program 1 times [2019-10-02 12:13:43,106 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:43,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:43,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:43,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:43,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:13:43,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:43,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:13:43,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:13:43,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:13:43,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:13:43,385 INFO L87 Difference]: Start difference. First operand 1475 states and 2214 transitions. Second operand 13 states. [2019-10-02 12:13:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:43,788 INFO L93 Difference]: Finished difference Result 2719 states and 4158 transitions. [2019-10-02 12:13:43,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:13:43,789 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 173 [2019-10-02 12:13:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:43,798 INFO L225 Difference]: With dead ends: 2719 [2019-10-02 12:13:43,798 INFO L226 Difference]: Without dead ends: 1461 [2019-10-02 12:13:43,802 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:13:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2019-10-02 12:13:43,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1461. [2019-10-02 12:13:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2019-10-02 12:13:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2196 transitions. [2019-10-02 12:13:43,846 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2196 transitions. Word has length 173 [2019-10-02 12:13:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:43,846 INFO L475 AbstractCegarLoop]: Abstraction has 1461 states and 2196 transitions. [2019-10-02 12:13:43,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:13:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2196 transitions. [2019-10-02 12:13:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:13:43,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:43,849 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:13:43,850 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:43,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:43,850 INFO L82 PathProgramCache]: Analyzing trace with hash 694498677, now seen corresponding path program 1 times [2019-10-02 12:13:43,850 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:43,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:43,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:43,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:43,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:13:44,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:44,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:13:44,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:13:44,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:13:44,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:13:44,052 INFO L87 Difference]: Start difference. First operand 1461 states and 2196 transitions. Second operand 11 states. [2019-10-02 12:13:44,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:44,325 INFO L93 Difference]: Finished difference Result 2705 states and 4140 transitions. [2019-10-02 12:13:44,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:13:44,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 175 [2019-10-02 12:13:44,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:44,333 INFO L225 Difference]: With dead ends: 2705 [2019-10-02 12:13:44,334 INFO L226 Difference]: Without dead ends: 1461 [2019-10-02 12:13:44,338 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:13:44,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2019-10-02 12:13:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1461. [2019-10-02 12:13:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2019-10-02 12:13:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2194 transitions. [2019-10-02 12:13:44,380 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2194 transitions. Word has length 175 [2019-10-02 12:13:44,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:44,380 INFO L475 AbstractCegarLoop]: Abstraction has 1461 states and 2194 transitions. [2019-10-02 12:13:44,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:13:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2194 transitions. [2019-10-02 12:13:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:13:44,383 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:44,383 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:13:44,384 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:44,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:44,384 INFO L82 PathProgramCache]: Analyzing trace with hash -997282508, now seen corresponding path program 1 times [2019-10-02 12:13:44,384 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:44,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:44,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:44,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:44,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:13:44,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:44,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:13:44,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:13:44,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:13:44,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:13:44,602 INFO L87 Difference]: Start difference. First operand 1461 states and 2194 transitions. Second operand 11 states. [2019-10-02 12:13:44,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:44,950 INFO L93 Difference]: Finished difference Result 2797 states and 4246 transitions. [2019-10-02 12:13:44,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:13:44,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 176 [2019-10-02 12:13:44,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:44,958 INFO L225 Difference]: With dead ends: 2797 [2019-10-02 12:13:44,958 INFO L226 Difference]: Without dead ends: 1455 [2019-10-02 12:13:44,961 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:13:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2019-10-02 12:13:44,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1455. [2019-10-02 12:13:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-10-02 12:13:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2178 transitions. [2019-10-02 12:13:45,000 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2178 transitions. Word has length 176 [2019-10-02 12:13:45,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:45,001 INFO L475 AbstractCegarLoop]: Abstraction has 1455 states and 2178 transitions. [2019-10-02 12:13:45,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:13:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2178 transitions. [2019-10-02 12:13:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 12:13:45,004 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:45,004 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:13:45,004 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:45,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:45,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1189374960, now seen corresponding path program 1 times [2019-10-02 12:13:45,005 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:45,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:45,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:45,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:45,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:45,223 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:13:45,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:45,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:13:45,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:13:45,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:13:45,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:13:45,225 INFO L87 Difference]: Start difference. First operand 1455 states and 2178 transitions. Second operand 6 states. [2019-10-02 12:13:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:50,543 INFO L93 Difference]: Finished difference Result 4113 states and 6454 transitions. [2019-10-02 12:13:50,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:13:50,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 177 [2019-10-02 12:13:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:50,558 INFO L225 Difference]: With dead ends: 4113 [2019-10-02 12:13:50,558 INFO L226 Difference]: Without dead ends: 2888 [2019-10-02 12:13:50,562 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:13:50,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2019-10-02 12:13:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2839. [2019-10-02 12:13:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2839 states. [2019-10-02 12:13:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 4462 transitions. [2019-10-02 12:13:50,664 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 4462 transitions. Word has length 177 [2019-10-02 12:13:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:50,665 INFO L475 AbstractCegarLoop]: Abstraction has 2839 states and 4462 transitions. [2019-10-02 12:13:50,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:13:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 4462 transitions. [2019-10-02 12:13:50,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 12:13:50,676 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:50,676 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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:13:50,677 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:50,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:50,677 INFO L82 PathProgramCache]: Analyzing trace with hash 584097494, now seen corresponding path program 1 times [2019-10-02 12:13:50,677 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:50,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:50,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:50,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:50,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:13:50,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:50,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:13:50,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:13:50,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:13:50,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:13:50,896 INFO L87 Difference]: Start difference. First operand 2839 states and 4462 transitions. Second operand 9 states. [2019-10-02 12:13:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:55,956 INFO L93 Difference]: Finished difference Result 5473 states and 8828 transitions. [2019-10-02 12:13:55,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:13:55,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 222 [2019-10-02 12:13:55,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:55,975 INFO L225 Difference]: With dead ends: 5473 [2019-10-02 12:13:55,976 INFO L226 Difference]: Without dead ends: 2863 [2019-10-02 12:13:55,985 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 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:13:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2019-10-02 12:13:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2855. [2019-10-02 12:13:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2019-10-02 12:13:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 4542 transitions. [2019-10-02 12:13:56,115 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 4542 transitions. Word has length 222 [2019-10-02 12:13:56,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:56,115 INFO L475 AbstractCegarLoop]: Abstraction has 2855 states and 4542 transitions. [2019-10-02 12:13:56,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:13:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 4542 transitions. [2019-10-02 12:13:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 12:13:56,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:56,126 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:13:56,126 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:56,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:56,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1681279306, now seen corresponding path program 1 times [2019-10-02 12:13:56,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:56,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:56,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:56,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:56,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:13:56,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:56,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:13:56,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:13:56,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:13:56,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:13:56,351 INFO L87 Difference]: Start difference. First operand 2855 states and 4542 transitions. Second operand 4 states. [2019-10-02 12:13:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:57,629 INFO L93 Difference]: Finished difference Result 4158 states and 6656 transitions. [2019-10-02 12:13:57,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:13:57,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2019-10-02 12:13:57,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:57,645 INFO L225 Difference]: With dead ends: 4158 [2019-10-02 12:13:57,645 INFO L226 Difference]: Without dead ends: 2868 [2019-10-02 12:13:57,651 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:13:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2019-10-02 12:13:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2855. [2019-10-02 12:13:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2019-10-02 12:13:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 4528 transitions. [2019-10-02 12:13:57,783 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 4528 transitions. Word has length 224 [2019-10-02 12:13:57,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:57,784 INFO L475 AbstractCegarLoop]: Abstraction has 2855 states and 4528 transitions. [2019-10-02 12:13:57,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:13:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 4528 transitions. [2019-10-02 12:13:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-02 12:13:57,799 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:57,799 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:13:57,799 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:57,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:57,800 INFO L82 PathProgramCache]: Analyzing trace with hash 423494832, now seen corresponding path program 1 times [2019-10-02 12:13:57,800 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:57,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:57,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:13:58,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:58,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:13:58,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:13:58,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:13:58,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:13:58,052 INFO L87 Difference]: Start difference. First operand 2855 states and 4528 transitions. Second operand 8 states. [2019-10-02 12:14:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:08,452 INFO L93 Difference]: Finished difference Result 10463 states and 17354 transitions. [2019-10-02 12:14:08,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:14:08,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 223 [2019-10-02 12:14:08,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:08,489 INFO L225 Difference]: With dead ends: 10463 [2019-10-02 12:14:08,490 INFO L226 Difference]: Without dead ends: 7837 [2019-10-02 12:14:08,502 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 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:14:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7837 states. [2019-10-02 12:14:08,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7837 to 7763. [2019-10-02 12:14:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7763 states. [2019-10-02 12:14:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7763 states to 7763 states and 12436 transitions. [2019-10-02 12:14:08,908 INFO L78 Accepts]: Start accepts. Automaton has 7763 states and 12436 transitions. Word has length 223 [2019-10-02 12:14:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:08,909 INFO L475 AbstractCegarLoop]: Abstraction has 7763 states and 12436 transitions. [2019-10-02 12:14:08,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:14:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 7763 states and 12436 transitions. [2019-10-02 12:14:08,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 12:14:08,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:08,918 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:14:08,918 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:08,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:08,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1252176675, now seen corresponding path program 1 times [2019-10-02 12:14:08,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:08,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:08,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 12:14:09,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:09,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:14:09,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:14:09,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:14:09,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:14:09,093 INFO L87 Difference]: Start difference. First operand 7763 states and 12436 transitions. Second operand 6 states. [2019-10-02 12:14:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:10,303 INFO L93 Difference]: Finished difference Result 15321 states and 24916 transitions. [2019-10-02 12:14:10,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:14:10,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 227 [2019-10-02 12:14:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:10,346 INFO L225 Difference]: With dead ends: 15321 [2019-10-02 12:14:10,346 INFO L226 Difference]: Without dead ends: 7787 [2019-10-02 12:14:10,371 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:14:10,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7787 states. [2019-10-02 12:14:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7787 to 7787. [2019-10-02 12:14:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7787 states. [2019-10-02 12:14:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7787 states to 7787 states and 12448 transitions. [2019-10-02 12:14:10,847 INFO L78 Accepts]: Start accepts. Automaton has 7787 states and 12448 transitions. Word has length 227 [2019-10-02 12:14:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:10,848 INFO L475 AbstractCegarLoop]: Abstraction has 7787 states and 12448 transitions. [2019-10-02 12:14:10,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:14:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 7787 states and 12448 transitions. [2019-10-02 12:14:10,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 12:14:10,862 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:10,866 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:14:10,866 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:10,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:10,867 INFO L82 PathProgramCache]: Analyzing trace with hash 203404823, now seen corresponding path program 1 times [2019-10-02 12:14:10,867 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:10,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:10,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:10,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:10,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 12:14:11,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:11,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:14:11,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:14:11,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:14:11,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:14:11,990 INFO L87 Difference]: Start difference. First operand 7787 states and 12448 transitions. Second operand 4 states. [2019-10-02 12:14:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:13,597 INFO L93 Difference]: Finished difference Result 22632 states and 36998 transitions. [2019-10-02 12:14:13,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:14:13,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-10-02 12:14:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:13,692 INFO L225 Difference]: With dead ends: 22632 [2019-10-02 12:14:13,692 INFO L226 Difference]: Without dead ends: 15074 [2019-10-02 12:14:13,728 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:14:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15074 states. [2019-10-02 12:14:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15074 to 15061. [2019-10-02 12:14:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15061 states. [2019-10-02 12:14:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15061 states to 15061 states and 24080 transitions. [2019-10-02 12:14:14,499 INFO L78 Accepts]: Start accepts. Automaton has 15061 states and 24080 transitions. Word has length 227 [2019-10-02 12:14:14,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:14,499 INFO L475 AbstractCegarLoop]: Abstraction has 15061 states and 24080 transitions. [2019-10-02 12:14:14,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:14:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 15061 states and 24080 transitions. [2019-10-02 12:14:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:14:14,516 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:14,516 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:14:14,516 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:14,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:14,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1006289489, now seen corresponding path program 1 times [2019-10-02 12:14:14,517 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:14,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:14,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:14,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:14,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 12:14:14,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:14,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:14:14,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:14:14,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:14:14,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:14:14,714 INFO L87 Difference]: Start difference. First operand 15061 states and 24080 transitions. Second operand 6 states. [2019-10-02 12:14:16,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:16,066 INFO L93 Difference]: Finished difference Result 29816 states and 48792 transitions. [2019-10-02 12:14:16,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:14:16,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2019-10-02 12:14:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:16,141 INFO L225 Difference]: With dead ends: 29816 [2019-10-02 12:14:16,141 INFO L226 Difference]: Without dead ends: 15181 [2019-10-02 12:14:16,189 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:14:16,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15181 states. [2019-10-02 12:14:16,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15181 to 15181. [2019-10-02 12:14:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15181 states. [2019-10-02 12:14:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15181 states to 15181 states and 24152 transitions. [2019-10-02 12:14:16,789 INFO L78 Accepts]: Start accepts. Automaton has 15181 states and 24152 transitions. Word has length 228 [2019-10-02 12:14:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:16,790 INFO L475 AbstractCegarLoop]: Abstraction has 15181 states and 24152 transitions. [2019-10-02 12:14:16,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:14:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 15181 states and 24152 transitions. [2019-10-02 12:14:16,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 12:14:16,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:16,811 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:14:16,812 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:16,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:16,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1840766489, now seen corresponding path program 1 times [2019-10-02 12:14:16,812 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:16,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:16,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:16,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:16,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 12:14:16,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:16,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:14:16,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:14:16,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:14:16,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:14:16,975 INFO L87 Difference]: Start difference. First operand 15181 states and 24152 transitions. Second operand 6 states. [2019-10-02 12:14:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:18,337 INFO L93 Difference]: Finished difference Result 30080 states and 48928 transitions. [2019-10-02 12:14:18,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:14:18,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 229 [2019-10-02 12:14:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:18,408 INFO L225 Difference]: With dead ends: 30080 [2019-10-02 12:14:18,408 INFO L226 Difference]: Without dead ends: 15325 [2019-10-02 12:14:18,444 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:14:18,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15325 states. [2019-10-02 12:14:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15325 to 15325. [2019-10-02 12:14:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15325 states. [2019-10-02 12:14:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15325 states to 15325 states and 24248 transitions. [2019-10-02 12:14:18,985 INFO L78 Accepts]: Start accepts. Automaton has 15325 states and 24248 transitions. Word has length 229 [2019-10-02 12:14:18,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:18,986 INFO L475 AbstractCegarLoop]: Abstraction has 15325 states and 24248 transitions. [2019-10-02 12:14:18,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:14:18,986 INFO L276 IsEmpty]: Start isEmpty. Operand 15325 states and 24248 transitions. [2019-10-02 12:14:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 12:14:19,005 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:19,006 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:14:19,006 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:19,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:19,006 INFO L82 PathProgramCache]: Analyzing trace with hash -628165389, now seen corresponding path program 1 times [2019-10-02 12:14:19,007 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:19,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:19,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:19,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:19,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:14:19,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:19,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:14:19,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:14:19,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:14:19,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:14:19,206 INFO L87 Difference]: Start difference. First operand 15325 states and 24248 transitions. Second operand 9 states. [2019-10-02 12:14:30,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:30,247 INFO L93 Difference]: Finished difference Result 50443 states and 84322 transitions. [2019-10-02 12:14:30,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:14:30,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 229 [2019-10-02 12:14:30,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:30,432 INFO L225 Difference]: With dead ends: 50443 [2019-10-02 12:14:30,432 INFO L226 Difference]: Without dead ends: 35544 [2019-10-02 12:14:30,477 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 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:14:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35544 states. [2019-10-02 12:14:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35544 to 33203. [2019-10-02 12:14:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33203 states. [2019-10-02 12:14:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33203 states to 33203 states and 53940 transitions. [2019-10-02 12:14:33,109 INFO L78 Accepts]: Start accepts. Automaton has 33203 states and 53940 transitions. Word has length 229 [2019-10-02 12:14:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:33,110 INFO L475 AbstractCegarLoop]: Abstraction has 33203 states and 53940 transitions. [2019-10-02 12:14:33,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:14:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 33203 states and 53940 transitions. [2019-10-02 12:14:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 12:14:33,124 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:33,124 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:14:33,124 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:33,125 INFO L82 PathProgramCache]: Analyzing trace with hash -874478476, now seen corresponding path program 1 times [2019-10-02 12:14:33,125 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:33,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:33,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:33,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:33,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:14:33,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:33,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:14:33,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:14:33,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:14:33,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:14:33,354 INFO L87 Difference]: Start difference. First operand 33203 states and 53940 transitions. Second operand 11 states. [2019-10-02 12:14:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:44,772 INFO L93 Difference]: Finished difference Result 85485 states and 139764 transitions. [2019-10-02 12:14:44,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:14:44,773 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 229 [2019-10-02 12:14:44,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:45,070 INFO L225 Difference]: With dead ends: 85485 [2019-10-02 12:14:45,070 INFO L226 Difference]: Without dead ends: 61092 [2019-10-02 12:14:45,155 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:14:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61092 states. [2019-10-02 12:14:48,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61092 to 60335. [2019-10-02 12:14:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60335 states. [2019-10-02 12:14:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60335 states to 60335 states and 97900 transitions. [2019-10-02 12:14:49,353 INFO L78 Accepts]: Start accepts. Automaton has 60335 states and 97900 transitions. Word has length 229 [2019-10-02 12:14:49,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:49,353 INFO L475 AbstractCegarLoop]: Abstraction has 60335 states and 97900 transitions. [2019-10-02 12:14:49,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:14:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 60335 states and 97900 transitions. [2019-10-02 12:14:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 12:14:49,364 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:49,365 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 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:14:49,365 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:49,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:49,365 INFO L82 PathProgramCache]: Analyzing trace with hash -734750940, now seen corresponding path program 1 times [2019-10-02 12:14:49,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:49,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:49,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:49,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:49,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-02 12:14:49,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:49,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:14:49,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:14:49,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:14:49,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:14:49,524 INFO L87 Difference]: Start difference. First operand 60335 states and 97900 transitions. Second operand 4 states. [2019-10-02 12:14:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:55,002 INFO L93 Difference]: Finished difference Result 173304 states and 288408 transitions. [2019-10-02 12:14:55,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:14:55,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-10-02 12:14:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:55,502 INFO L225 Difference]: With dead ends: 173304 [2019-10-02 12:14:55,502 INFO L226 Difference]: Without dead ends: 113411 [2019-10-02 12:14:55,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:14:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113411 states. [2019-10-02 12:15:02,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113411 to 113302. [2019-10-02 12:15:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113302 states. [2019-10-02 12:15:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113302 states to 113302 states and 185124 transitions. [2019-10-02 12:15:03,182 INFO L78 Accepts]: Start accepts. Automaton has 113302 states and 185124 transitions. Word has length 240 [2019-10-02 12:15:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:03,183 INFO L475 AbstractCegarLoop]: Abstraction has 113302 states and 185124 transitions. [2019-10-02 12:15:03,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:15:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 113302 states and 185124 transitions. [2019-10-02 12:15:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 12:15:03,198 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:03,198 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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:15:03,199 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:03,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:03,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1849426172, now seen corresponding path program 1 times [2019-10-02 12:15:03,199 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:03,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:03,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:03,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:03,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:15:03,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:03,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:15:03,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:15:03,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:15:03,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:15:03,410 INFO L87 Difference]: Start difference. First operand 113302 states and 185124 transitions. Second operand 9 states. [2019-10-02 12:15:09,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:09,841 INFO L93 Difference]: Finished difference Result 138455 states and 226852 transitions. [2019-10-02 12:15:09,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:15:09,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 234 [2019-10-02 12:15:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:10,432 INFO L225 Difference]: With dead ends: 138455 [2019-10-02 12:15:10,432 INFO L226 Difference]: Without dead ends: 114990 [2019-10-02 12:15:10,535 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:15:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114990 states. [2019-10-02 12:15:14,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114990 to 113790. [2019-10-02 12:15:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113790 states. [2019-10-02 12:15:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113790 states to 113790 states and 185739 transitions. [2019-10-02 12:15:15,281 INFO L78 Accepts]: Start accepts. Automaton has 113790 states and 185739 transitions. Word has length 234 [2019-10-02 12:15:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:15,282 INFO L475 AbstractCegarLoop]: Abstraction has 113790 states and 185739 transitions. [2019-10-02 12:15:15,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:15:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 113790 states and 185739 transitions. [2019-10-02 12:15:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 12:15:15,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:15,298 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:15,298 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:15,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:15,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1743761057, now seen corresponding path program 1 times [2019-10-02 12:15:15,299 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:15,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:15,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:15,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:15,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-02 12:15:15,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:15:15,483 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:15:15,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:16,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 3800 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:15:16,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:15:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-02 12:15:16,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:15:16,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:15:16,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:15:16,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:15:16,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:15:16,347 INFO L87 Difference]: Start difference. First operand 113790 states and 185739 transitions. Second operand 9 states. [2019-10-02 12:15:26,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:26,287 INFO L93 Difference]: Finished difference Result 228491 states and 379314 transitions. [2019-10-02 12:15:26,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:15:26,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 242 [2019-10-02 12:15:26,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:26,854 INFO L225 Difference]: With dead ends: 228491 [2019-10-02 12:15:26,854 INFO L226 Difference]: Without dead ends: 115190 [2019-10-02 12:15:27,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:15:27,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115190 states. [2019-10-02 12:15:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115190 to 115190. [2019-10-02 12:15:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115190 states. [2019-10-02 12:15:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115190 states to 115190 states and 186811 transitions. [2019-10-02 12:15:31,890 INFO L78 Accepts]: Start accepts. Automaton has 115190 states and 186811 transitions. Word has length 242 [2019-10-02 12:15:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:31,891 INFO L475 AbstractCegarLoop]: Abstraction has 115190 states and 186811 transitions. [2019-10-02 12:15:31,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:15:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 115190 states and 186811 transitions. [2019-10-02 12:15:31,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 12:15:31,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:31,917 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:31,917 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:31,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:31,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1733041557, now seen corresponding path program 1 times [2019-10-02 12:15:31,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:31,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:31,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:31,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:31,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 12:15:32,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:15:32,152 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:15:32,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:32,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 3802 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:15:32,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:15:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 12:15:33,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:15:33,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:15:33,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:15:33,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:15:33,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:15:33,062 INFO L87 Difference]: Start difference. First operand 115190 states and 186811 transitions. Second operand 14 states. [2019-10-02 12:15:36,100 WARN L191 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-10-02 12:15:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:59,586 INFO L93 Difference]: Finished difference Result 311928 states and 521204 transitions. [2019-10-02 12:15:59,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 12:15:59,586 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 244 [2019-10-02 12:15:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:01,732 INFO L225 Difference]: With dead ends: 311928 [2019-10-02 12:16:01,732 INFO L226 Difference]: Without dead ends: 254371 [2019-10-02 12:16:01,975 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:16:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254371 states. [2019-10-02 12:16:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254371 to 252374. [2019-10-02 12:16:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252374 states. [2019-10-02 12:16:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252374 states to 252374 states and 417816 transitions. [2019-10-02 12:16:24,318 INFO L78 Accepts]: Start accepts. Automaton has 252374 states and 417816 transitions. Word has length 244 [2019-10-02 12:16:24,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:24,319 INFO L475 AbstractCegarLoop]: Abstraction has 252374 states and 417816 transitions. [2019-10-02 12:16:24,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:16:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 252374 states and 417816 transitions. [2019-10-02 12:16:24,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-02 12:16:24,383 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:24,383 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:24,384 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:24,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:24,384 INFO L82 PathProgramCache]: Analyzing trace with hash -566439867, now seen corresponding path program 1 times [2019-10-02 12:16:24,384 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:24,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:24,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:24,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:24,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-02 12:16:25,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:25,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:16:25,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:16:25,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:16:25,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:16:25,272 INFO L87 Difference]: Start difference. First operand 252374 states and 417816 transitions. Second operand 9 states. [2019-10-02 12:16:38,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:38,542 INFO L93 Difference]: Finished difference Result 366915 states and 603589 transitions. [2019-10-02 12:16:38,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:16:38,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 258 [2019-10-02 12:16:38,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:39,282 INFO L225 Difference]: With dead ends: 366915 [2019-10-02 12:16:39,282 INFO L226 Difference]: Without dead ends: 114926 [2019-10-02 12:16:40,325 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:16:40,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114926 states. [2019-10-02 12:16:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114926 to 114926. [2019-10-02 12:16:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114926 states. [2019-10-02 12:16:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114926 states to 114926 states and 186183 transitions. [2019-10-02 12:16:45,934 INFO L78 Accepts]: Start accepts. Automaton has 114926 states and 186183 transitions. Word has length 258 [2019-10-02 12:16:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:45,934 INFO L475 AbstractCegarLoop]: Abstraction has 114926 states and 186183 transitions. [2019-10-02 12:16:45,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:16:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 114926 states and 186183 transitions. [2019-10-02 12:16:45,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-02 12:16:45,954 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:45,954 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:16:45,954 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:45,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:45,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1580983552, now seen corresponding path program 1 times [2019-10-02 12:16:45,955 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:45,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:45,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:45,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:45,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 12:16:46,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:46,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:16:46,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:16:46,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:16:46,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:16:46,129 INFO L87 Difference]: Start difference. First operand 114926 states and 186183 transitions. Second operand 6 states. [2019-10-02 12:17:11,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:11,113 INFO L93 Difference]: Finished difference Result 389400 states and 664066 transitions. [2019-10-02 12:17:11,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:17:11,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-10-02 12:17:11,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:12,454 INFO L225 Difference]: With dead ends: 389400 [2019-10-02 12:17:12,454 INFO L226 Difference]: Without dead ends: 275067 [2019-10-02 12:17:12,773 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:17:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275067 states. [2019-10-02 12:17:32,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275067 to 253950. [2019-10-02 12:17:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253950 states. [2019-10-02 12:17:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253950 states to 253950 states and 422459 transitions. [2019-10-02 12:17:35,438 INFO L78 Accepts]: Start accepts. Automaton has 253950 states and 422459 transitions. Word has length 253 [2019-10-02 12:17:35,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:35,438 INFO L475 AbstractCegarLoop]: Abstraction has 253950 states and 422459 transitions. [2019-10-02 12:17:35,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:17:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 253950 states and 422459 transitions. [2019-10-02 12:17:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-02 12:17:35,466 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:35,466 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:17:35,466 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:35,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:35,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1924392817, now seen corresponding path program 1 times [2019-10-02 12:17:35,467 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:35,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:35,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:35,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:35,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 12:17:35,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:17:35,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:17:35,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:17:35,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:17:35,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:17:35,644 INFO L87 Difference]: Start difference. First operand 253950 states and 422459 transitions. Second operand 6 states. [2019-10-02 12:18:32,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:18:32,376 INFO L93 Difference]: Finished difference Result 894712 states and 1579002 transitions. [2019-10-02 12:18:32,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:18:32,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 254 [2019-10-02 12:18:32,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:18:36,323 INFO L225 Difference]: With dead ends: 894712 [2019-10-02 12:18:36,324 INFO L226 Difference]: Without dead ends: 641483 [2019-10-02 12:18:38,143 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:18:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641483 states. [2019-10-02 12:19:39,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641483 to 579966. [2019-10-02 12:19:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579966 states. [2019-10-02 12:19:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579966 states to 579966 states and 999211 transitions. [2019-10-02 12:19:58,075 INFO L78 Accepts]: Start accepts. Automaton has 579966 states and 999211 transitions. Word has length 254 [2019-10-02 12:19:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:19:58,076 INFO L475 AbstractCegarLoop]: Abstraction has 579966 states and 999211 transitions. [2019-10-02 12:19:58,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:19:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 579966 states and 999211 transitions. [2019-10-02 12:19:58,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 12:19:58,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:19:58,110 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:19:58,110 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:19:58,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:19:58,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1619879452, now seen corresponding path program 1 times [2019-10-02 12:19:58,111 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:19:58,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:19:58,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:19:58,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:19:58,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:19:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:19:58,323 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 12:19:58,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:19:58,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:19:58,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:19:58,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:19:58,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:19:58,325 INFO L87 Difference]: Start difference. First operand 579966 states and 999211 transitions. Second operand 6 states.