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_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:52:52,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:52:52,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:52:52,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:52:52,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:52:52,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:52:52,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:52:52,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:52:52,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:52:52,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:52:52,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:52:52,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:52:52,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:52:52,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:52:52,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:52:52,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:52:52,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:52:52,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:52:52,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:52:52,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:52:52,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:52:52,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:52:52,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:52:52,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:52:52,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:52:52,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:52:52,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:52:52,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:52:52,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:52:52,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:52:52,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:52:52,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:52:52,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:52:52,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:52:52,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:52:52,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:52:52,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:52:52,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:52:52,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:52:52,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:52:52,709 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:52:52,709 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 03:52:52,725 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:52:52,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:52:52,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:52:52,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:52:52,727 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:52:52,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:52:52,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:52:52,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:52:52,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:52:52,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:52:52,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:52:52,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:52:52,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:52:52,728 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:52:52,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:52:52,729 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:52:52,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:52:52,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:52:52,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:52:52,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:52:52,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:52:52,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:52:52,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:52:52,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:52:52,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:52:52,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:52:52,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:52:52,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:52:52,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:52:52,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:52:52,773 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:52:52,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:52:52,778 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:52:52,779 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:52:52,779 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product26.cil.c [2019-09-08 03:52:52,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8693f14/d75ebb899288472a9baa829f4a632164/FLAGf041ac6d5 [2019-09-08 03:52:53,501 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:52:53,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product26.cil.c [2019-09-08 03:52:53,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8693f14/d75ebb899288472a9baa829f4a632164/FLAGf041ac6d5 [2019-09-08 03:52:53,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8693f14/d75ebb899288472a9baa829f4a632164 [2019-09-08 03:52:53,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:52:53,724 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:52:53,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:52:53,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:52:53,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:52:53,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:52:53" (1/1) ... [2019-09-08 03:52:53,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357a5375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:53, skipping insertion in model container [2019-09-08 03:52:53,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:52:53" (1/1) ... [2019-09-08 03:52:53,745 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:52:53,844 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:52:54,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:52:54,640 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:52:54,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:52:54,842 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:52:54,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:54 WrapperNode [2019-09-08 03:52:54,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:52:54,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:52:54,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:52:54,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:52:54,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:54" (1/1) ... [2019-09-08 03:52:54,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:54" (1/1) ... [2019-09-08 03:52:54,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:54" (1/1) ... [2019-09-08 03:52:54,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:54" (1/1) ... [2019-09-08 03:52:54,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:54" (1/1) ... [2019-09-08 03:52:54,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:54" (1/1) ... [2019-09-08 03:52:55,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:54" (1/1) ... [2019-09-08 03:52:55,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:52:55,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:52:55,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:52:55,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:52:55,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:52:55,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:52:55,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:52:55,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:52:55,104 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:52:55,104 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:52:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:52:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:52:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 03:52:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:52:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:52:55,106 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 03:52:55,106 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:52:55,106 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:52:55,106 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:52:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:52:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:52:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:52:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:52:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:52:55,110 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:52:55,110 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:52:55,111 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:52:55,111 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:52:55,111 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:52:55,111 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:52:55,111 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:52:55,112 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:52:55,112 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2019-09-08 03:52:55,112 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:52:55,112 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__empty [2019-09-08 03:52:55,112 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:52:55,112 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:52:55,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:52:55,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:52:55,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:52:55,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:52:55,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:52:55,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:52:55,114 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:52:55,115 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:52:55,115 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:52:55,115 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:52:55,115 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:52:55,116 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:52:55,116 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:52:55,116 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:52:55,116 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:52:55,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:52:55,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:52:55,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:52:55,117 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:52:55,117 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:52:55,117 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:52:55,117 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:52:55,117 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:52:55,117 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:52:55,118 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:52:55,118 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:52:55,119 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:52:55,120 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:52:55,120 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:52:55,120 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:52:55,120 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:52:55,120 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:52:55,121 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:52:55,121 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:52:55,121 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:52:55,121 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:52:55,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:52:55,122 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:52:55,122 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:52:55,122 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:52:55,122 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:52:55,123 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:52:55,123 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:52:55,124 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:52:55,124 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:52:55,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:52:55,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:52:55,125 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:52:55,125 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:52:55,125 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:52:55,126 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:52:55,126 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:52:55,126 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:52:55,127 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:52:55,127 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:52:55,127 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:52:55,127 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:52:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:52:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:52:55,129 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:52:55,129 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:52:55,129 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:52:55,129 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:52:55,129 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:52:55,130 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:52:55,130 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:52:55,130 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:52:55,130 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:52:55,131 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:52:55,131 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:52:55,131 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:52:55,131 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:52:55,131 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 03:52:55,131 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:52:55,132 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 03:52:55,132 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:52:55,132 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:52:55,132 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:52:55,132 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:52:55,133 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:52:55,133 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:52:55,133 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:52:55,133 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:52:55,134 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:52:55,134 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:52:55,134 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2019-09-08 03:52:55,134 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:52:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__empty [2019-09-08 03:52:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:52:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:52:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:52:55,136 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:52:55,137 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:52:55,137 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:52:55,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:52:55,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:52:55,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:52:55,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:52:55,138 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:52:55,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:52:55,139 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:52:55,139 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:52:55,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:52:55,143 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:52:55,143 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:52:55,143 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:52:55,144 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:52:55,145 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:52:55,148 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:52:55,148 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:52:55,149 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:52:55,149 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:52:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:52:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:52:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:52:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:52:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:52:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:52:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:52:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:52:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:52:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:52:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:52:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:52:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:52:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:52:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:52:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:52:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:52:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:52:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:52:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:52:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:52:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:52:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:52:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:52:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:52:57,401 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:52:57,402 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:52:57,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:52:57 BoogieIcfgContainer [2019-09-08 03:52:57,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:52:57,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:52:57,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:52:57,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:52:57,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:52:53" (1/3) ... [2019-09-08 03:52:57,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddb4914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:52:57, skipping insertion in model container [2019-09-08 03:52:57,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:54" (2/3) ... [2019-09-08 03:52:57,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddb4914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:52:57, skipping insertion in model container [2019-09-08 03:52:57,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:52:57" (3/3) ... [2019-09-08 03:52:57,414 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product26.cil.c [2019-09-08 03:52:57,425 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:52:57,438 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:52:57,458 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:52:57,521 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:52:57,522 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:52:57,522 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:52:57,522 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:52:57,522 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:52:57,522 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:52:57,523 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:52:57,523 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:52:57,523 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:52:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2019-09-08 03:52:57,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 03:52:57,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:57,609 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:57,614 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:57,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:57,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1704372100, now seen corresponding path program 1 times [2019-09-08 03:52:57,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:57,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:57,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:57,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:57,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:52:58,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:58,282 INFO L223 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-09-08 03:52:58,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:58,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 3170 conjuncts, 1 conjunts are in the unsatisfiable core [2019-09-08 03:52:58,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:52:58,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:58,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-09-08 03:52:58,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:52:58,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:52:58,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:52:58,884 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 4 states. [2019-09-08 03:52:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:59,098 INFO L93 Difference]: Finished difference Result 1220 states and 1977 transitions. [2019-09-08 03:52:59,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:52:59,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-08 03:52:59,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:59,155 INFO L225 Difference]: With dead ends: 1220 [2019-09-08 03:52:59,156 INFO L226 Difference]: Without dead ends: 614 [2019-09-08 03:52:59,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:52:59,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-08 03:52:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-08 03:52:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-08 03:52:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 982 transitions. [2019-09-08 03:52:59,335 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 982 transitions. Word has length 116 [2019-09-08 03:52:59,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:59,337 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 982 transitions. [2019-09-08 03:52:59,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:52:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 982 transitions. [2019-09-08 03:52:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 03:52:59,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:59,343 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:59,344 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1224648271, now seen corresponding path program 1 times [2019-09-08 03:52:59,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:59,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:59,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:59,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:59,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:52:59,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:59,621 INFO L223 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) [2019-09-08 03:52:59,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:53:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:00,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 3175 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:53:00,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:53:00,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:53:00,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:53:00,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:53:00,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:53:00,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:53:00,201 INFO L87 Difference]: Start difference. First operand 614 states and 982 transitions. Second operand 6 states. [2019-09-08 03:53:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:00,361 INFO L93 Difference]: Finished difference Result 1200 states and 1937 transitions. [2019-09-08 03:53:00,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:53:00,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-09-08 03:53:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:00,373 INFO L225 Difference]: With dead ends: 1200 [2019-09-08 03:53:00,373 INFO L226 Difference]: Without dead ends: 614 [2019-09-08 03:53:00,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 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-09-08 03:53:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-08 03:53:00,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-08 03:53:00,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-08 03:53:00,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 981 transitions. [2019-09-08 03:53:00,454 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 981 transitions. Word has length 120 [2019-09-08 03:53:00,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:00,457 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 981 transitions. [2019-09-08 03:53:00,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:53:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 981 transitions. [2019-09-08 03:53:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 03:53:00,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:00,508 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:00,509 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:00,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:00,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2135037313, now seen corresponding path program 1 times [2019-09-08 03:53:00,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:00,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:00,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:00,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:00,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:53:00,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:00,742 INFO L223 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-09-08 03:53:00,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:01,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 3177 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:53:01,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:53:01,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:53:01,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:53:01,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:53:01,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:53:01,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:53:01,260 INFO L87 Difference]: Start difference. First operand 614 states and 981 transitions. Second operand 6 states. [2019-09-08 03:53:01,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:01,357 INFO L93 Difference]: Finished difference Result 1204 states and 1940 transitions. [2019-09-08 03:53:01,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:53:01,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-09-08 03:53:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:01,364 INFO L225 Difference]: With dead ends: 1204 [2019-09-08 03:53:01,364 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 03:53:01,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 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-09-08 03:53:01,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 03:53:01,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 03:53:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 03:53:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 986 transitions. [2019-09-08 03:53:01,400 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 986 transitions. Word has length 122 [2019-09-08 03:53:01,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:01,401 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 986 transitions. [2019-09-08 03:53:01,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:53:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 986 transitions. [2019-09-08 03:53:01,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 03:53:01,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:01,404 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:01,404 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:01,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:01,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2064176466, now seen corresponding path program 1 times [2019-09-08 03:53:01,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:01,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:01,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:01,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:01,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:53:01,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:01,646 INFO L223 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) [2019-09-08 03:53:01,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:53:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:02,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 3178 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:53:02,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:53:02,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:53:02,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:53:02,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:53:02,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:53:02,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:53:02,197 INFO L87 Difference]: Start difference. First operand 620 states and 986 transitions. Second operand 6 states. [2019-09-08 03:53:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:02,296 INFO L93 Difference]: Finished difference Result 1203 states and 1931 transitions. [2019-09-08 03:53:02,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:53:02,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-09-08 03:53:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:02,304 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 03:53:02,305 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 03:53:02,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 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-09-08 03:53:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 03:53:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 03:53:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 03:53:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 985 transitions. [2019-09-08 03:53:02,344 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 985 transitions. Word has length 123 [2019-09-08 03:53:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:02,345 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 985 transitions. [2019-09-08 03:53:02,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:53:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 985 transitions. [2019-09-08 03:53:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 03:53:02,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:02,352 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:02,352 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:02,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:02,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1849317603, now seen corresponding path program 1 times [2019-09-08 03:53:02,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:02,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:02,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:02,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:02,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:53:02,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:02,479 INFO L223 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) [2019-09-08 03:53:02,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:53:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:03,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:53:03,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:03,216 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:53:03,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:53:03,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:53:03,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:53:03,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:53:03,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:53:03,230 INFO L87 Difference]: Start difference. First operand 620 states and 985 transitions. Second operand 6 states. [2019-09-08 03:53:03,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:03,324 INFO L93 Difference]: Finished difference Result 1203 states and 1930 transitions. [2019-09-08 03:53:03,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:53:03,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-09-08 03:53:03,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:03,333 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 03:53:03,334 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 03:53:03,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 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-09-08 03:53:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 03:53:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 03:53:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 03:53:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 984 transitions. [2019-09-08 03:53:03,368 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 984 transitions. Word has length 124 [2019-09-08 03:53:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:03,368 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 984 transitions. [2019-09-08 03:53:03,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:53:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 984 transitions. [2019-09-08 03:53:03,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 03:53:03,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:03,371 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:03,372 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:03,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:03,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2057806986, now seen corresponding path program 1 times [2019-09-08 03:53:03,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:03,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:03,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:03,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:03,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:53:03,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:03,565 INFO L223 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) [2019-09-08 03:53:03,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:53:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:04,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 3180 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:53:04,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:53:04,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:53:04,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-09-08 03:53:04,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:53:04,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:53:04,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:53:04,225 INFO L87 Difference]: Start difference. First operand 620 states and 984 transitions. Second operand 12 states. [2019-09-08 03:53:04,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:04,782 INFO L93 Difference]: Finished difference Result 1214 states and 1950 transitions. [2019-09-08 03:53:04,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:53:04,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2019-09-08 03:53:04,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:04,789 INFO L225 Difference]: With dead ends: 1214 [2019-09-08 03:53:04,789 INFO L226 Difference]: Without dead ends: 629 [2019-09-08 03:53:04,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:53:04,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-08 03:53:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2019-09-08 03:53:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-09-08 03:53:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 989 transitions. [2019-09-08 03:53:04,831 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 989 transitions. Word has length 125 [2019-09-08 03:53:04,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:04,831 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 989 transitions. [2019-09-08 03:53:04,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:53:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 989 transitions. [2019-09-08 03:53:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 03:53:04,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:04,837 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:04,837 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:04,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:04,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1904530473, now seen corresponding path program 1 times [2019-09-08 03:53:04,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:04,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:04,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:04,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:04,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:53:05,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:05,007 INFO L223 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) [2019-09-08 03:53:05,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:53:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:05,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 3183 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:53:05,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:53:05,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:53:05,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:53:05,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:53:05,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:53:05,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:53:05,731 INFO L87 Difference]: Start difference. First operand 627 states and 989 transitions. Second operand 8 states. [2019-09-08 03:53:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:05,992 INFO L93 Difference]: Finished difference Result 1215 states and 1940 transitions. [2019-09-08 03:53:05,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:53:05,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2019-09-08 03:53:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:05,999 INFO L225 Difference]: With dead ends: 1215 [2019-09-08 03:53:05,999 INFO L226 Difference]: Without dead ends: 627 [2019-09-08 03:53:06,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 130 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-09-08 03:53:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-09-08 03:53:06,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-09-08 03:53:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-09-08 03:53:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 984 transitions. [2019-09-08 03:53:06,030 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 984 transitions. Word has length 128 [2019-09-08 03:53:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:06,031 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 984 transitions. [2019-09-08 03:53:06,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:53:06,031 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 984 transitions. [2019-09-08 03:53:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 03:53:06,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:06,034 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:06,034 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:06,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash 872861201, now seen corresponding path program 1 times [2019-09-08 03:53:06,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:06,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:06,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:06,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:53:06,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:06,157 INFO L223 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) [2019-09-08 03:53:06,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:53:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:06,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 3185 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:53:06,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:53:06,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:53:06,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:53:06,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:53:06,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:53:06,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:53:06,662 INFO L87 Difference]: Start difference. First operand 627 states and 984 transitions. Second operand 8 states. [2019-09-08 03:53:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:06,951 INFO L93 Difference]: Finished difference Result 1236 states and 1961 transitions. [2019-09-08 03:53:06,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:53:06,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 130 [2019-09-08 03:53:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:06,958 INFO L225 Difference]: With dead ends: 1236 [2019-09-08 03:53:06,959 INFO L226 Difference]: Without dead ends: 654 [2019-09-08 03:53:06,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 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-09-08 03:53:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-09-08 03:53:06,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 651. [2019-09-08 03:53:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-08 03:53:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1011 transitions. [2019-09-08 03:53:06,991 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1011 transitions. Word has length 130 [2019-09-08 03:53:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:06,991 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1011 transitions. [2019-09-08 03:53:06,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:53:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1011 transitions. [2019-09-08 03:53:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 03:53:06,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:06,995 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:06,995 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:06,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:06,996 INFO L82 PathProgramCache]: Analyzing trace with hash 472678801, now seen corresponding path program 1 times [2019-09-08 03:53:06,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:06,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:06,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:06,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:06,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:53:07,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:07,272 INFO L223 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-09-08 03:53:07,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:07,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 3181 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:53:07,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:53:08,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:53:08,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 03:53:08,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:53:08,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:53:08,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:53:08,002 INFO L87 Difference]: Start difference. First operand 651 states and 1011 transitions. Second operand 14 states. [2019-09-08 03:53:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:08,310 INFO L93 Difference]: Finished difference Result 1237 states and 1942 transitions. [2019-09-08 03:53:08,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:53:08,311 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2019-09-08 03:53:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:08,317 INFO L225 Difference]: With dead ends: 1237 [2019-09-08 03:53:08,317 INFO L226 Difference]: Without dead ends: 673 [2019-09-08 03:53:08,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:53:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-09-08 03:53:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 662. [2019-09-08 03:53:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-08 03:53:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1032 transitions. [2019-09-08 03:53:08,351 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1032 transitions. Word has length 130 [2019-09-08 03:53:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:08,352 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 1032 transitions. [2019-09-08 03:53:08,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:53:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1032 transitions. [2019-09-08 03:53:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 03:53:08,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:08,355 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:08,356 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:08,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2020002127, now seen corresponding path program 1 times [2019-09-08 03:53:08,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:08,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:08,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:08,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:08,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:53:08,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:08,485 INFO L223 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-09-08 03:53:08,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:08,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 3184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:53:08,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:53:09,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:53:09,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:53:09,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:53:09,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:53:09,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:53:09,047 INFO L87 Difference]: Start difference. First operand 662 states and 1032 transitions. Second operand 6 states. [2019-09-08 03:53:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:09,365 INFO L93 Difference]: Finished difference Result 1286 states and 2026 transitions. [2019-09-08 03:53:09,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:53:09,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-09-08 03:53:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:09,373 INFO L225 Difference]: With dead ends: 1286 [2019-09-08 03:53:09,373 INFO L226 Difference]: Without dead ends: 627 [2019-09-08 03:53:09,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 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-09-08 03:53:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-09-08 03:53:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-09-08 03:53:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-09-08 03:53:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 969 transitions. [2019-09-08 03:53:09,419 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 969 transitions. Word has length 130 [2019-09-08 03:53:09,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:09,420 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 969 transitions. [2019-09-08 03:53:09,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:53:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 969 transitions. [2019-09-08 03:53:09,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 03:53:09,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:09,423 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:09,423 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:09,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:09,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1301374821, now seen corresponding path program 1 times [2019-09-08 03:53:09,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:09,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:09,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:09,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:09,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:53:09,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:09,600 INFO L223 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-09-08 03:53:09,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:10,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 3189 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:53:10,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:53:10,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:53:10,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:53:10,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:53:10,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:53:10,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:53:10,111 INFO L87 Difference]: Start difference. First operand 627 states and 969 transitions. Second operand 8 states. [2019-09-08 03:53:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:10,272 INFO L93 Difference]: Finished difference Result 1204 states and 1885 transitions. [2019-09-08 03:53:10,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:53:10,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2019-09-08 03:53:10,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:10,281 INFO L225 Difference]: With dead ends: 1204 [2019-09-08 03:53:10,281 INFO L226 Difference]: Without dead ends: 627 [2019-09-08 03:53:10,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 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-09-08 03:53:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-09-08 03:53:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-09-08 03:53:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-09-08 03:53:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 968 transitions. [2019-09-08 03:53:10,323 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 968 transitions. Word has length 134 [2019-09-08 03:53:10,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:10,326 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 968 transitions. [2019-09-08 03:53:10,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:53:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 968 transitions. [2019-09-08 03:53:10,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 03:53:10,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:10,333 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:10,334 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:10,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:10,334 INFO L82 PathProgramCache]: Analyzing trace with hash -97931237, now seen corresponding path program 1 times [2019-09-08 03:53:10,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:10,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:10,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:10,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:10,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:53:10,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:10,534 INFO L223 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-09-08 03:53:10,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:11,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 3187 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 03:53:11,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 03:53:11,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:53:11,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2019-09-08 03:53:11,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:53:11,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:53:11,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:53:11,308 INFO L87 Difference]: Start difference. First operand 627 states and 968 transitions. Second operand 8 states. [2019-09-08 03:53:11,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:11,663 INFO L93 Difference]: Finished difference Result 1222 states and 1921 transitions. [2019-09-08 03:53:11,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:53:11,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2019-09-08 03:53:11,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:11,672 INFO L225 Difference]: With dead ends: 1222 [2019-09-08 03:53:11,672 INFO L226 Difference]: Without dead ends: 643 [2019-09-08 03:53:11,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:53:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-09-08 03:53:11,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2019-09-08 03:53:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-08 03:53:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 984 transitions. [2019-09-08 03:53:11,769 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 984 transitions. Word has length 135 [2019-09-08 03:53:11,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:11,769 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 984 transitions. [2019-09-08 03:53:11,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:53:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 984 transitions. [2019-09-08 03:53:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 03:53:11,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:11,774 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:11,774 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:11,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:11,775 INFO L82 PathProgramCache]: Analyzing trace with hash 209811714, now seen corresponding path program 1 times [2019-09-08 03:53:11,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:11,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:11,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:11,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:11,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:53:12,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:12,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:53:12,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:53:12,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:53:12,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:53:12,016 INFO L87 Difference]: Start difference. First operand 641 states and 984 transitions. Second operand 9 states. [2019-09-08 03:53:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:12,247 INFO L93 Difference]: Finished difference Result 1154 states and 1815 transitions. [2019-09-08 03:53:12,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:53:12,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 03:53:12,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:12,255 INFO L225 Difference]: With dead ends: 1154 [2019-09-08 03:53:12,256 INFO L226 Difference]: Without dead ends: 638 [2019-09-08 03:53:12,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:53:12,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-08 03:53:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-09-08 03:53:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-08 03:53:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 979 transitions. [2019-09-08 03:53:12,293 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 979 transitions. Word has length 136 [2019-09-08 03:53:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:12,294 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 979 transitions. [2019-09-08 03:53:12,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:53:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 979 transitions. [2019-09-08 03:53:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 03:53:12,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:12,299 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:12,299 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:12,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:12,300 INFO L82 PathProgramCache]: Analyzing trace with hash -696975105, now seen corresponding path program 1 times [2019-09-08 03:53:12,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:12,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:12,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:12,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:12,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:53:12,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:12,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:53:12,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:53:12,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:53:12,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:53:12,500 INFO L87 Difference]: Start difference. First operand 638 states and 979 transitions. Second operand 7 states. [2019-09-08 03:53:12,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:12,642 INFO L93 Difference]: Finished difference Result 1151 states and 1810 transitions. [2019-09-08 03:53:12,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:53:12,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-08 03:53:12,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:12,651 INFO L225 Difference]: With dead ends: 1151 [2019-09-08 03:53:12,651 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 03:53:12,656 INFO L628 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-09-08 03:53:12,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 03:53:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-08 03:53:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 03:53:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 940 transitions. [2019-09-08 03:53:12,687 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 940 transitions. Word has length 137 [2019-09-08 03:53:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:12,688 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 940 transitions. [2019-09-08 03:53:12,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:53:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 940 transitions. [2019-09-08 03:53:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 03:53:12,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:12,692 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:12,692 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:12,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:12,693 INFO L82 PathProgramCache]: Analyzing trace with hash -161039434, now seen corresponding path program 1 times [2019-09-08 03:53:12,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:12,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:12,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:12,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:12,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 03:53:13,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:13,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:53:13,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:53:13,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:53:13,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:53:13,009 INFO L87 Difference]: Start difference. First operand 612 states and 940 transitions. Second operand 13 states. [2019-09-08 03:53:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:13,387 INFO L93 Difference]: Finished difference Result 1191 states and 1858 transitions. [2019-09-08 03:53:13,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:53:13,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2019-09-08 03:53:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:13,392 INFO L225 Difference]: With dead ends: 1191 [2019-09-08 03:53:13,393 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 03:53:13,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 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-09-08 03:53:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 03:53:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2019-09-08 03:53:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-09-08 03:53:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 955 transitions. [2019-09-08 03:53:13,418 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 955 transitions. Word has length 138 [2019-09-08 03:53:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:13,418 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 955 transitions. [2019-09-08 03:53:13,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:53:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 955 transitions. [2019-09-08 03:53:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 03:53:13,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:13,421 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:13,421 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:13,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:13,422 INFO L82 PathProgramCache]: Analyzing trace with hash -94970133, now seen corresponding path program 1 times [2019-09-08 03:53:13,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:13,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:13,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:13,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:13,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 03:53:13,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:13,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:53:13,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:53:13,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:53:13,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:53:13,637 INFO L87 Difference]: Start difference. First operand 624 states and 955 transitions. Second operand 13 states. [2019-09-08 03:53:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:13,926 INFO L93 Difference]: Finished difference Result 1138 states and 1785 transitions. [2019-09-08 03:53:13,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:53:13,927 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 137 [2019-09-08 03:53:13,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:13,932 INFO L225 Difference]: With dead ends: 1138 [2019-09-08 03:53:13,932 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 03:53:13,935 INFO L628 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-09-08 03:53:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 03:53:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-09-08 03:53:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-09-08 03:53:13,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 946 transitions. [2019-09-08 03:53:13,956 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 946 transitions. Word has length 137 [2019-09-08 03:53:13,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:13,957 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 946 transitions. [2019-09-08 03:53:13,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:53:13,957 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 946 transitions. [2019-09-08 03:53:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 03:53:13,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:13,960 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:13,960 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:13,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2046982736, now seen corresponding path program 1 times [2019-09-08 03:53:13,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:13,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:13,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:13,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:13,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 03:53:14,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:14,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:53:14,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:53:14,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:53:14,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:53:14,188 INFO L87 Difference]: Start difference. First operand 617 states and 946 transitions. Second operand 11 states. [2019-09-08 03:53:14,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:14,493 INFO L93 Difference]: Finished difference Result 1131 states and 1776 transitions. [2019-09-08 03:53:14,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:53:14,494 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2019-09-08 03:53:14,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:14,501 INFO L225 Difference]: With dead ends: 1131 [2019-09-08 03:53:14,501 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 03:53:14,507 INFO L628 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-09-08 03:53:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 03:53:14,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-09-08 03:53:14,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-09-08 03:53:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 945 transitions. [2019-09-08 03:53:14,555 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 945 transitions. Word has length 139 [2019-09-08 03:53:14,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:14,555 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 945 transitions. [2019-09-08 03:53:14,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:53:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 945 transitions. [2019-09-08 03:53:14,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 03:53:14,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:14,560 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:14,561 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:14,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:14,562 INFO L82 PathProgramCache]: Analyzing trace with hash -188434084, now seen corresponding path program 1 times [2019-09-08 03:53:14,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:14,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:14,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:14,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:14,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 03:53:14,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:14,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:53:14,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:53:14,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:53:14,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:53:14,905 INFO L87 Difference]: Start difference. First operand 617 states and 945 transitions. Second operand 11 states. [2019-09-08 03:53:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:15,248 INFO L93 Difference]: Finished difference Result 1177 states and 1829 transitions. [2019-09-08 03:53:15,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:53:15,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 140 [2019-09-08 03:53:15,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:15,256 INFO L225 Difference]: With dead ends: 1177 [2019-09-08 03:53:15,257 INFO L226 Difference]: Without dead ends: 614 [2019-09-08 03:53:15,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 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-09-08 03:53:15,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-08 03:53:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-08 03:53:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-08 03:53:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 937 transitions. [2019-09-08 03:53:15,294 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 937 transitions. Word has length 140 [2019-09-08 03:53:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:15,295 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 937 transitions. [2019-09-08 03:53:15,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:53:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 937 transitions. [2019-09-08 03:53:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 03:53:15,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:15,300 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:15,300 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:15,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1906319339, now seen corresponding path program 1 times [2019-09-08 03:53:15,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:15,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:15,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:15,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:15,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:53:15,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:15,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:53:15,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:53:15,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:53:15,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:53:15,628 INFO L87 Difference]: Start difference. First operand 614 states and 937 transitions. Second operand 6 states. [2019-09-08 03:53:19,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:19,458 INFO L93 Difference]: Finished difference Result 1720 states and 2751 transitions. [2019-09-08 03:53:19,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:53:19,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-08 03:53:19,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:19,466 INFO L225 Difference]: With dead ends: 1720 [2019-09-08 03:53:19,466 INFO L226 Difference]: Without dead ends: 1215 [2019-09-08 03:53:19,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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-09-08 03:53:19,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-09-08 03:53:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1097. [2019-09-08 03:53:19,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-09-08 03:53:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1740 transitions. [2019-09-08 03:53:19,532 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1740 transitions. Word has length 141 [2019-09-08 03:53:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:19,534 INFO L475 AbstractCegarLoop]: Abstraction has 1097 states and 1740 transitions. [2019-09-08 03:53:19,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:53:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1740 transitions. [2019-09-08 03:53:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 03:53:19,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:19,541 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:19,541 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:19,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:19,541 INFO L82 PathProgramCache]: Analyzing trace with hash 465407297, now seen corresponding path program 1 times [2019-09-08 03:53:19,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:19,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:19,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:19,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:19,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:53:19,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:19,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 03:53:19,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:53:19,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:53:19,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:53:19,747 INFO L87 Difference]: Start difference. First operand 1097 states and 1740 transitions. Second operand 12 states. [2019-09-08 03:53:29,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:29,465 INFO L93 Difference]: Finished difference Result 3409 states and 5497 transitions. [2019-09-08 03:53:29,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 03:53:29,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 173 [2019-09-08 03:53:29,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:29,485 INFO L225 Difference]: With dead ends: 3409 [2019-09-08 03:53:29,485 INFO L226 Difference]: Without dead ends: 2421 [2019-09-08 03:53:29,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-09-08 03:53:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2019-09-08 03:53:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2363. [2019-09-08 03:53:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-09-08 03:53:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3767 transitions. [2019-09-08 03:53:29,642 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3767 transitions. Word has length 173 [2019-09-08 03:53:29,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:29,642 INFO L475 AbstractCegarLoop]: Abstraction has 2363 states and 3767 transitions. [2019-09-08 03:53:29,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:53:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3767 transitions. [2019-09-08 03:53:29,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 03:53:29,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:29,653 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:29,654 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:29,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:29,654 INFO L82 PathProgramCache]: Analyzing trace with hash 908454671, now seen corresponding path program 1 times [2019-09-08 03:53:29,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:29,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:29,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:29,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:29,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:53:29,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:29,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:53:29,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:53:29,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:53:29,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:53:29,874 INFO L87 Difference]: Start difference. First operand 2363 states and 3767 transitions. Second operand 9 states. [2019-09-08 03:53:33,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:33,430 INFO L93 Difference]: Finished difference Result 4657 states and 7606 transitions. [2019-09-08 03:53:33,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:53:33,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 174 [2019-09-08 03:53:33,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:33,445 INFO L225 Difference]: With dead ends: 4657 [2019-09-08 03:53:33,446 INFO L226 Difference]: Without dead ends: 2403 [2019-09-08 03:53:33,459 INFO L628 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-09-08 03:53:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2019-09-08 03:53:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2387. [2019-09-08 03:53:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2387 states. [2019-09-08 03:53:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2387 states and 3851 transitions. [2019-09-08 03:53:33,586 INFO L78 Accepts]: Start accepts. Automaton has 2387 states and 3851 transitions. Word has length 174 [2019-09-08 03:53:33,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:33,586 INFO L475 AbstractCegarLoop]: Abstraction has 2387 states and 3851 transitions. [2019-09-08 03:53:33,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:53:33,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 3851 transitions. [2019-09-08 03:53:33,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 03:53:33,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:33,593 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:33,593 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:33,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:33,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1174448998, now seen corresponding path program 1 times [2019-09-08 03:53:33,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:33,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:33,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:33,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:33,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:33,784 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:53:33,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:33,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:53:33,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:53:33,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:53:33,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:53:33,786 INFO L87 Difference]: Start difference. First operand 2387 states and 3851 transitions. Second operand 8 states. [2019-09-08 03:53:39,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:39,837 INFO L93 Difference]: Finished difference Result 7990 states and 13371 transitions. [2019-09-08 03:53:39,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:53:39,839 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-09-08 03:53:39,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:39,878 INFO L225 Difference]: With dead ends: 7990 [2019-09-08 03:53:39,878 INFO L226 Difference]: Without dead ends: 5712 [2019-09-08 03:53:39,898 INFO L628 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-09-08 03:53:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5712 states. [2019-09-08 03:53:40,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5712 to 5664. [2019-09-08 03:53:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5664 states. [2019-09-08 03:53:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5664 states to 5664 states and 9065 transitions. [2019-09-08 03:53:40,243 INFO L78 Accepts]: Start accepts. Automaton has 5664 states and 9065 transitions. Word has length 175 [2019-09-08 03:53:40,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:40,244 INFO L475 AbstractCegarLoop]: Abstraction has 5664 states and 9065 transitions. [2019-09-08 03:53:40,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:53:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 5664 states and 9065 transitions. [2019-09-08 03:53:40,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 03:53:40,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:40,249 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:40,250 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:40,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:40,250 INFO L82 PathProgramCache]: Analyzing trace with hash -397088451, now seen corresponding path program 1 times [2019-09-08 03:53:40,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:40,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:40,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:40,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:40,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:53:40,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:40,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:53:40,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:53:40,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:53:40,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:53:40,492 INFO L87 Difference]: Start difference. First operand 5664 states and 9065 transitions. Second operand 9 states. [2019-09-08 03:53:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:48,786 INFO L93 Difference]: Finished difference Result 15096 states and 24883 transitions. [2019-09-08 03:53:48,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:53:48,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 181 [2019-09-08 03:53:48,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:48,856 INFO L225 Difference]: With dead ends: 15096 [2019-09-08 03:53:48,857 INFO L226 Difference]: Without dead ends: 9535 [2019-09-08 03:53:48,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:53:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9535 states. [2019-09-08 03:53:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9535 to 8925. [2019-09-08 03:53:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8925 states. [2019-09-08 03:53:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8925 states to 8925 states and 14314 transitions. [2019-09-08 03:53:49,351 INFO L78 Accepts]: Start accepts. Automaton has 8925 states and 14314 transitions. Word has length 181 [2019-09-08 03:53:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:49,351 INFO L475 AbstractCegarLoop]: Abstraction has 8925 states and 14314 transitions. [2019-09-08 03:53:49,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:53:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 8925 states and 14314 transitions. [2019-09-08 03:53:49,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 03:53:49,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:49,356 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:49,356 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:49,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:49,357 INFO L82 PathProgramCache]: Analyzing trace with hash 736102142, now seen corresponding path program 1 times [2019-09-08 03:53:49,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:49,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:49,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:49,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:49,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:53:49,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:49,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:53:49,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:53:49,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:53:49,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:53:49,549 INFO L87 Difference]: Start difference. First operand 8925 states and 14314 transitions. Second operand 7 states. [2019-09-08 03:53:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:55,338 INFO L93 Difference]: Finished difference Result 25636 states and 42432 transitions. [2019-09-08 03:53:55,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:53:55,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 181 [2019-09-08 03:53:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:55,509 INFO L225 Difference]: With dead ends: 25636 [2019-09-08 03:53:55,509 INFO L226 Difference]: Without dead ends: 18053 [2019-09-08 03:53:55,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:53:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18053 states. [2019-09-08 03:53:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18053 to 17671. [2019-09-08 03:53:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17671 states. [2019-09-08 03:53:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17671 states to 17671 states and 28743 transitions. [2019-09-08 03:53:57,519 INFO L78 Accepts]: Start accepts. Automaton has 17671 states and 28743 transitions. Word has length 181 [2019-09-08 03:53:57,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:57,520 INFO L475 AbstractCegarLoop]: Abstraction has 17671 states and 28743 transitions. [2019-09-08 03:53:57,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:53:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 17671 states and 28743 transitions. [2019-09-08 03:53:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 03:53:57,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:57,526 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:57,527 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:57,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:57,527 INFO L82 PathProgramCache]: Analyzing trace with hash -173829336, now seen corresponding path program 1 times [2019-09-08 03:53:57,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:57,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:57,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:57,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:57,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:53:57,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:57,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:53:57,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:53:57,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:53:57,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:53:57,667 INFO L87 Difference]: Start difference. First operand 17671 states and 28743 transitions. Second operand 5 states. [2019-09-08 03:53:58,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:58,281 INFO L93 Difference]: Finished difference Result 34240 states and 56304 transitions. [2019-09-08 03:53:58,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:53:58,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-09-08 03:53:58,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:58,400 INFO L225 Difference]: With dead ends: 34240 [2019-09-08 03:53:58,400 INFO L226 Difference]: Without dead ends: 18076 [2019-09-08 03:53:58,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:53:58,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18076 states. [2019-09-08 03:53:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18076 to 17860. [2019-09-08 03:53:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17860 states. [2019-09-08 03:53:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17860 states to 17860 states and 29007 transitions. [2019-09-08 03:53:59,582 INFO L78 Accepts]: Start accepts. Automaton has 17860 states and 29007 transitions. Word has length 186 [2019-09-08 03:53:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:59,583 INFO L475 AbstractCegarLoop]: Abstraction has 17860 states and 29007 transitions. [2019-09-08 03:53:59,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:53:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand 17860 states and 29007 transitions. [2019-09-08 03:53:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 03:53:59,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:59,589 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:59,589 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:59,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:59,590 INFO L82 PathProgramCache]: Analyzing trace with hash -357076030, now seen corresponding path program 1 times [2019-09-08 03:53:59,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:59,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:59,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:59,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:59,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:53:59,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:59,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:53:59,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:53:59,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:53:59,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:53:59,745 INFO L87 Difference]: Start difference. First operand 17860 states and 29007 transitions. Second operand 7 states. [2019-09-08 03:54:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:00,525 INFO L93 Difference]: Finished difference Result 36406 states and 60702 transitions. [2019-09-08 03:54:00,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:54:00,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2019-09-08 03:54:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:01,613 INFO L225 Difference]: With dead ends: 36406 [2019-09-08 03:54:01,613 INFO L226 Difference]: Without dead ends: 17860 [2019-09-08 03:54:01,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:54:01,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17860 states. [2019-09-08 03:54:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17860 to 17860. [2019-09-08 03:54:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17860 states. [2019-09-08 03:54:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17860 states to 17860 states and 28617 transitions. [2019-09-08 03:54:02,379 INFO L78 Accepts]: Start accepts. Automaton has 17860 states and 28617 transitions. Word has length 193 [2019-09-08 03:54:02,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:02,380 INFO L475 AbstractCegarLoop]: Abstraction has 17860 states and 28617 transitions. [2019-09-08 03:54:02,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:54:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 17860 states and 28617 transitions. [2019-09-08 03:54:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 03:54:02,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:02,385 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:54:02,386 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:02,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:02,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1417725667, now seen corresponding path program 1 times [2019-09-08 03:54:02,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:02,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:02,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:02,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:02,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:54:02,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:54:02,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:54:02,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:54:02,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:54:02,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:54:02,567 INFO L87 Difference]: Start difference. First operand 17860 states and 28617 transitions. Second operand 7 states. [2019-09-08 03:54:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:07,216 INFO L93 Difference]: Finished difference Result 35794 states and 57930 transitions. [2019-09-08 03:54:07,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:54:07,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2019-09-08 03:54:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:07,309 INFO L225 Difference]: With dead ends: 35794 [2019-09-08 03:54:07,310 INFO L226 Difference]: Without dead ends: 19463 [2019-09-08 03:54:07,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:54:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19463 states. [2019-09-08 03:54:08,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19463 to 18922. [2019-09-08 03:54:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18922 states. [2019-09-08 03:54:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18922 states to 18922 states and 30057 transitions. [2019-09-08 03:54:08,283 INFO L78 Accepts]: Start accepts. Automaton has 18922 states and 30057 transitions. Word has length 198 [2019-09-08 03:54:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:08,284 INFO L475 AbstractCegarLoop]: Abstraction has 18922 states and 30057 transitions. [2019-09-08 03:54:08,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:54:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 18922 states and 30057 transitions. [2019-09-08 03:54:08,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 03:54:08,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:08,289 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:54:08,290 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:08,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:08,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1870636041, now seen corresponding path program 1 times [2019-09-08 03:54:08,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:08,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:08,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:08,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:08,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:54:08,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:54:08,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:54:08,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:54:08,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:54:08,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:54:08,454 INFO L87 Difference]: Start difference. First operand 18922 states and 30057 transitions. Second operand 4 states. [2019-09-08 03:54:09,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:09,560 INFO L93 Difference]: Finished difference Result 37500 states and 60371 transitions. [2019-09-08 03:54:09,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:54:09,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-09-08 03:54:09,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:09,674 INFO L225 Difference]: With dead ends: 37500 [2019-09-08 03:54:09,674 INFO L226 Difference]: Without dead ends: 18687 [2019-09-08 03:54:09,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:54:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18687 states. [2019-09-08 03:54:10,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18687 to 18687. [2019-09-08 03:54:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18687 states. [2019-09-08 03:54:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18687 states to 18687 states and 29587 transitions. [2019-09-08 03:54:10,708 INFO L78 Accepts]: Start accepts. Automaton has 18687 states and 29587 transitions. Word has length 203 [2019-09-08 03:54:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:10,709 INFO L475 AbstractCegarLoop]: Abstraction has 18687 states and 29587 transitions. [2019-09-08 03:54:10,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:54:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 18687 states and 29587 transitions. [2019-09-08 03:54:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 03:54:10,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:10,714 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:54:10,714 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:10,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:10,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2139526221, now seen corresponding path program 1 times [2019-09-08 03:54:10,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:10,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:10,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:10,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:10,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:54:10,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:54:10,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:54:10,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:54:10,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:54:10,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:54:10,893 INFO L87 Difference]: Start difference. First operand 18687 states and 29587 transitions. Second operand 6 states. [2019-09-08 03:54:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:12,186 INFO L93 Difference]: Finished difference Result 18774 states and 29742 transitions. [2019-09-08 03:54:12,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:54:12,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-09-08 03:54:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:12,259 INFO L225 Difference]: With dead ends: 18774 [2019-09-08 03:54:12,260 INFO L226 Difference]: Without dead ends: 18758 [2019-09-08 03:54:12,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:54:12,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18758 states. [2019-09-08 03:54:13,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18758 to 18702. [2019-09-08 03:54:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18702 states. [2019-09-08 03:54:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18702 states to 18702 states and 29602 transitions. [2019-09-08 03:54:13,217 INFO L78 Accepts]: Start accepts. Automaton has 18702 states and 29602 transitions. Word has length 204 [2019-09-08 03:54:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:13,217 INFO L475 AbstractCegarLoop]: Abstraction has 18702 states and 29602 transitions. [2019-09-08 03:54:13,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:54:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 18702 states and 29602 transitions. [2019-09-08 03:54:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 03:54:13,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:13,222 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:54:13,223 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:13,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:13,223 INFO L82 PathProgramCache]: Analyzing trace with hash 396546002, now seen corresponding path program 1 times [2019-09-08 03:54:13,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:13,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:13,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:13,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:13,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:54:13,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:54:13,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:54:13,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:54:13,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:54:13,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:54:13,406 INFO L87 Difference]: Start difference. First operand 18702 states and 29602 transitions. Second operand 9 states. [2019-09-08 03:54:14,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:14,459 INFO L93 Difference]: Finished difference Result 20012 states and 31492 transitions. [2019-09-08 03:54:14,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:54:14,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 210 [2019-09-08 03:54:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:14,569 INFO L225 Difference]: With dead ends: 20012 [2019-09-08 03:54:14,569 INFO L226 Difference]: Without dead ends: 19932 [2019-09-08 03:54:14,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:54:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19932 states. [2019-09-08 03:54:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19932 to 19572. [2019-09-08 03:54:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19572 states. [2019-09-08 03:54:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19572 states to 19572 states and 30852 transitions. [2019-09-08 03:54:15,361 INFO L78 Accepts]: Start accepts. Automaton has 19572 states and 30852 transitions. Word has length 210 [2019-09-08 03:54:15,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:15,362 INFO L475 AbstractCegarLoop]: Abstraction has 19572 states and 30852 transitions. [2019-09-08 03:54:15,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:54:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 19572 states and 30852 transitions. [2019-09-08 03:54:15,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 03:54:15,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:15,367 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:54:15,367 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:15,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:15,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1626073054, now seen corresponding path program 1 times [2019-09-08 03:54:15,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:15,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:15,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:15,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:15,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:15,822 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:54:15,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:54:15,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:54:15,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:54:15,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:54:15,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:54:15,823 INFO L87 Difference]: Start difference. First operand 19572 states and 30852 transitions. Second operand 9 states. [2019-09-08 03:54:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:19,844 INFO L93 Difference]: Finished difference Result 39103 states and 61989 transitions. [2019-09-08 03:54:19,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:54:19,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 228 [2019-09-08 03:54:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:19,934 INFO L225 Difference]: With dead ends: 39103 [2019-09-08 03:54:19,934 INFO L226 Difference]: Without dead ends: 19660 [2019-09-08 03:54:19,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 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-09-08 03:54:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19660 states. [2019-09-08 03:54:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19660 to 19572. [2019-09-08 03:54:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19572 states. [2019-09-08 03:54:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19572 states to 19572 states and 30795 transitions. [2019-09-08 03:54:20,928 INFO L78 Accepts]: Start accepts. Automaton has 19572 states and 30795 transitions. Word has length 228 [2019-09-08 03:54:20,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:20,928 INFO L475 AbstractCegarLoop]: Abstraction has 19572 states and 30795 transitions. [2019-09-08 03:54:20,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:54:20,929 INFO L276 IsEmpty]: Start isEmpty. Operand 19572 states and 30795 transitions. [2019-09-08 03:54:20,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 03:54:20,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:20,933 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:54:20,934 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:20,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:20,934 INFO L82 PathProgramCache]: Analyzing trace with hash -31064416, now seen corresponding path program 1 times [2019-09-08 03:54:20,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:20,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:20,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:20,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:20,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 03:54:21,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:54:21,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 03:54:21,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:54:21,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:54:21,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:54:21,153 INFO L87 Difference]: Start difference. First operand 19572 states and 30795 transitions. Second operand 10 states. [2019-09-08 03:54:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:21,675 INFO L93 Difference]: Finished difference Result 19864 states and 31138 transitions. [2019-09-08 03:54:21,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:54:21,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 237 [2019-09-08 03:54:21,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:21,750 INFO L225 Difference]: With dead ends: 19864 [2019-09-08 03:54:21,750 INFO L226 Difference]: Without dead ends: 19848 [2019-09-08 03:54:21,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:54:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19848 states. [2019-09-08 03:54:22,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19848 to 19817. [2019-09-08 03:54:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19817 states. [2019-09-08 03:54:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19817 states to 19817 states and 31018 transitions. [2019-09-08 03:54:22,423 INFO L78 Accepts]: Start accepts. Automaton has 19817 states and 31018 transitions. Word has length 237 [2019-09-08 03:54:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:22,423 INFO L475 AbstractCegarLoop]: Abstraction has 19817 states and 31018 transitions. [2019-09-08 03:54:22,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:54:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 19817 states and 31018 transitions. [2019-09-08 03:54:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 03:54:22,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:22,430 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:54:22,431 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:22,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:22,431 INFO L82 PathProgramCache]: Analyzing trace with hash 96143138, now seen corresponding path program 1 times [2019-09-08 03:54:22,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:22,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:22,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:22,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:22,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-09-08 03:54:22,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:22,924 INFO L223 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-09-08 03:54:22,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:23,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 3743 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 03:54:23,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 03:54:23,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:54:23,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-09-08 03:54:23,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:54:23,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:54:23,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:54:23,763 INFO L87 Difference]: Start difference. First operand 19817 states and 31018 transitions. Second operand 19 states. [2019-09-08 03:54:38,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:38,982 INFO L93 Difference]: Finished difference Result 61075 states and 97072 transitions. [2019-09-08 03:54:38,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:54:38,982 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 265 [2019-09-08 03:54:38,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:39,205 INFO L225 Difference]: With dead ends: 61075 [2019-09-08 03:54:39,205 INFO L226 Difference]: Without dead ends: 41385 [2019-09-08 03:54:39,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-09-08 03:54:39,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41385 states. [2019-09-08 03:54:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41385 to 41049. [2019-09-08 03:54:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41049 states. [2019-09-08 03:54:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41049 states to 41049 states and 65145 transitions. [2019-09-08 03:54:41,083 INFO L78 Accepts]: Start accepts. Automaton has 41049 states and 65145 transitions. Word has length 265 [2019-09-08 03:54:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:41,084 INFO L475 AbstractCegarLoop]: Abstraction has 41049 states and 65145 transitions. [2019-09-08 03:54:41,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 03:54:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 41049 states and 65145 transitions. [2019-09-08 03:54:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 03:54:41,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:41,096 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:54:41,096 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:41,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:41,097 INFO L82 PathProgramCache]: Analyzing trace with hash -314399195, now seen corresponding path program 1 times [2019-09-08 03:54:41,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:41,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:41,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:41,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:41,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-08 03:54:41,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:41,256 INFO L223 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-09-08 03:54:41,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:41,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 3767 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:54:41,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 03:54:41,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:41,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:54:41,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:54:41,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:54:41,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:54:41,866 INFO L87 Difference]: Start difference. First operand 41049 states and 65145 transitions. Second operand 6 states. [2019-09-08 03:54:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:44,514 INFO L93 Difference]: Finished difference Result 82613 states and 133769 transitions. [2019-09-08 03:54:44,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:54:44,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 268 [2019-09-08 03:54:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:44,720 INFO L225 Difference]: With dead ends: 82613 [2019-09-08 03:54:44,720 INFO L226 Difference]: Without dead ends: 41111 [2019-09-08 03:54:44,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 269 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-09-08 03:54:44,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41111 states. [2019-09-08 03:54:48,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41111 to 41053. [2019-09-08 03:54:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41053 states. [2019-09-08 03:54:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41053 states to 41053 states and 63926 transitions. [2019-09-08 03:54:48,814 INFO L78 Accepts]: Start accepts. Automaton has 41053 states and 63926 transitions. Word has length 268 [2019-09-08 03:54:48,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:48,814 INFO L475 AbstractCegarLoop]: Abstraction has 41053 states and 63926 transitions. [2019-09-08 03:54:48,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:54:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 41053 states and 63926 transitions. [2019-09-08 03:54:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-08 03:54:48,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:48,825 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:54:48,826 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:48,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:48,826 INFO L82 PathProgramCache]: Analyzing trace with hash 673666789, now seen corresponding path program 1 times [2019-09-08 03:54:48,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:48,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:48,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:48,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:48,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-08 03:54:49,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:49,000 INFO L223 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) [2019-09-08 03:54:49,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:49,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 4658 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:54:49,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:54:49,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:49,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-08 03:54:49,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:54:49,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:54:49,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:54:49,758 INFO L87 Difference]: Start difference. First operand 41053 states and 63926 transitions. Second operand 7 states. [2019-09-08 03:54:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:51,915 INFO L93 Difference]: Finished difference Result 83471 states and 132426 transitions. [2019-09-08 03:54:51,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:54:51,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 358 [2019-09-08 03:54:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:52,053 INFO L225 Difference]: With dead ends: 83471 [2019-09-08 03:54:52,053 INFO L226 Difference]: Without dead ends: 42535 [2019-09-08 03:54:52,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 358 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-09-08 03:54:52,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42535 states. [2019-09-08 03:54:53,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42535 to 42535. [2019-09-08 03:54:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42535 states. [2019-09-08 03:54:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42535 states to 42535 states and 66464 transitions. [2019-09-08 03:54:53,569 INFO L78 Accepts]: Start accepts. Automaton has 42535 states and 66464 transitions. Word has length 358 [2019-09-08 03:54:53,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:53,570 INFO L475 AbstractCegarLoop]: Abstraction has 42535 states and 66464 transitions. [2019-09-08 03:54:53,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:54:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 42535 states and 66464 transitions. [2019-09-08 03:54:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-08 03:54:53,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:53,587 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:54:53,587 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:53,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:53,587 INFO L82 PathProgramCache]: Analyzing trace with hash 954239677, now seen corresponding path program 1 times [2019-09-08 03:54:53,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:53,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:53,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:53,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:53,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-09-08 03:54:53,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:53,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:54:53,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:54,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 4663 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:54:54,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Stream Closed [2019-09-08 03:54:54,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:54:54,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-08 03:54:54,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:54:54,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:54:54,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:54:54,702 INFO L87 Difference]: Start difference. First operand 42535 states and 66464 transitions. Second operand 15 states. [2019-09-08 03:55:13,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:13,466 INFO L93 Difference]: Finished difference Result 158572 states and 262682 transitions. [2019-09-08 03:55:13,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 03:55:13,466 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 364 [2019-09-08 03:55:13,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:13,924 INFO L225 Difference]: With dead ends: 158572 [2019-09-08 03:55:13,924 INFO L226 Difference]: Without dead ends: 115389 [2019-09-08 03:55:14,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 03:55:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115389 states. [2019-09-08 03:55:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115389 to 111469. [2019-09-08 03:55:18,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111469 states. [2019-09-08 03:55:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111469 states to 111469 states and 176069 transitions. [2019-09-08 03:55:18,689 INFO L78 Accepts]: Start accepts. Automaton has 111469 states and 176069 transitions. Word has length 364 [2019-09-08 03:55:18,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:18,689 INFO L475 AbstractCegarLoop]: Abstraction has 111469 states and 176069 transitions. [2019-09-08 03:55:18,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:55:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 111469 states and 176069 transitions. [2019-09-08 03:55:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 03:55:18,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:18,699 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:55:18,700 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:18,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:18,700 INFO L82 PathProgramCache]: Analyzing trace with hash -396135728, now seen corresponding path program 1 times [2019-09-08 03:55:18,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:18,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:18,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:18,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:18,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 26 proven. 15 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 03:55:21,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:21,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:55:21,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:22,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 4299 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:55:22,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-08 03:55:22,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:22,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 03:55:22,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:55:22,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:55:22,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:55:22,448 INFO L87 Difference]: Start difference. First operand 111469 states and 176069 transitions. Second operand 14 states. [2019-09-08 03:55:46,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:46,099 INFO L93 Difference]: Finished difference Result 366262 states and 639561 transitions. [2019-09-08 03:55:46,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 03:55:46,099 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 313 [2019-09-08 03:55:46,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:47,317 INFO L225 Difference]: With dead ends: 366262 [2019-09-08 03:55:47,317 INFO L226 Difference]: Without dead ends: 246998 [2019-09-08 03:55:47,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=522, Invalid=1830, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 03:55:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246998 states. [2019-09-08 03:56:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246998 to 243191. [2019-09-08 03:56:03,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243191 states. [2019-09-08 03:56:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243191 states to 243191 states and 395478 transitions. [2019-09-08 03:56:04,352 INFO L78 Accepts]: Start accepts. Automaton has 243191 states and 395478 transitions. Word has length 313 [2019-09-08 03:56:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:56:04,353 INFO L475 AbstractCegarLoop]: Abstraction has 243191 states and 395478 transitions. [2019-09-08 03:56:04,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:56:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 243191 states and 395478 transitions. [2019-09-08 03:56:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 03:56:04,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:56:04,373 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:56:04,373 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:56:04,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:56:04,374 INFO L82 PathProgramCache]: Analyzing trace with hash -858671167, now seen corresponding path program 1 times [2019-09-08 03:56:04,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:56:04,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:56:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:04,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:56:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:04,664 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 26 proven. 11 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-08 03:56:04,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:56:04,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:56:04,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:56:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:05,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 4343 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 03:56:05,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:56:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 41 proven. 43 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-08 03:56:06,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:56:06,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-09-08 03:56:06,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:56:06,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:56:06,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:56:06,383 INFO L87 Difference]: Start difference. First operand 243191 states and 395478 transitions. Second operand 19 states. [2019-09-08 03:56:55,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:56:55,635 INFO L93 Difference]: Finished difference Result 648885 states and 1148342 transitions. [2019-09-08 03:56:55,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-08 03:56:55,636 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 324 [2019-09-08 03:56:55,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:56:57,683 INFO L225 Difference]: With dead ends: 648885 [2019-09-08 03:56:57,683 INFO L226 Difference]: Without dead ends: 391451 [2019-09-08 03:56:58,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=912, Invalid=4344, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 03:56:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391451 states. [2019-09-08 03:57:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391451 to 383347. [2019-09-08 03:57:24,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383347 states. [2019-09-08 03:57:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383347 states to 383347 states and 627454 transitions. [2019-09-08 03:57:27,911 INFO L78 Accepts]: Start accepts. Automaton has 383347 states and 627454 transitions. Word has length 324 [2019-09-08 03:57:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:57:27,912 INFO L475 AbstractCegarLoop]: Abstraction has 383347 states and 627454 transitions. [2019-09-08 03:57:27,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 03:57:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 383347 states and 627454 transitions. [2019-09-08 03:57:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 03:57:27,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:57:27,927 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-08 03:57:27,927 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:57:27,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:57:27,928 INFO L82 PathProgramCache]: Analyzing trace with hash -234325492, now seen corresponding path program 1 times [2019-09-08 03:57:27,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:57:27,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:57:27,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:57:27,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:57:27,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:57:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:57:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-08 03:57:28,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:57:28,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:57:28,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:57:28,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:57:28,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:57:28,190 INFO L87 Difference]: Start difference. First operand 383347 states and 627454 transitions. Second operand 8 states. [2019-09-08 03:58:01,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:58:01,899 INFO L93 Difference]: Finished difference Result 751113 states and 1253572 transitions. [2019-09-08 03:58:01,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:58:01,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 330 [2019-09-08 03:58:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:58:05,077 INFO L225 Difference]: With dead ends: 751113 [2019-09-08 03:58:05,077 INFO L226 Difference]: Without dead ends: 367971 [2019-09-08 03:58:06,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:58:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367971 states. [2019-09-08 03:58:37,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367971 to 367519. [2019-09-08 03:58:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367519 states. [2019-09-08 03:58:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367519 states to 367519 states and 600604 transitions. [2019-09-08 03:58:40,250 INFO L78 Accepts]: Start accepts. Automaton has 367519 states and 600604 transitions. Word has length 330 [2019-09-08 03:58:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:58:40,251 INFO L475 AbstractCegarLoop]: Abstraction has 367519 states and 600604 transitions. [2019-09-08 03:58:40,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:58:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 367519 states and 600604 transitions. [2019-09-08 03:58:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 03:58:40,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:58:40,265 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 03:58:40,266 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:58:40,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:58:40,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1560386600, now seen corresponding path program 1 times [2019-09-08 03:58:40,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:58:40,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:58:40,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:58:40,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:58:40,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:58:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:58:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 03:58:40,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:58:40,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:58:40,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:58:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:58:41,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 4326 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 03:58:41,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:58:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 40 proven. 38 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 03:58:41,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:58:41,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-09-08 03:58:41,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:58:41,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:58:41,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:58:41,313 INFO L87 Difference]: Start difference. First operand 367519 states and 600604 transitions. Second operand 15 states. [2019-09-08 03:59:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:59:38,509 INFO L93 Difference]: Finished difference Result 943690 states and 1562998 transitions. [2019-09-08 03:59:38,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 03:59:38,509 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 327 [2019-09-08 03:59:38,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:59:42,067 INFO L225 Difference]: With dead ends: 943690 [2019-09-08 03:59:42,067 INFO L226 Difference]: Without dead ends: 561085 [2019-09-08 03:59:42,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-09-08 03:59:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561085 states. [2019-09-08 04:00:26,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561085 to 556479. [2019-09-08 04:00:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556479 states. [2019-09-08 04:00:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556479 states to 556479 states and 904568 transitions. [2019-09-08 04:00:31,203 INFO L78 Accepts]: Start accepts. Automaton has 556479 states and 904568 transitions. Word has length 327 [2019-09-08 04:00:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:31,204 INFO L475 AbstractCegarLoop]: Abstraction has 556479 states and 904568 transitions. [2019-09-08 04:00:31,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:00:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 556479 states and 904568 transitions. [2019-09-08 04:00:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 04:00:31,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:31,218 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:31,218 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:31,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:31,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1791679462, now seen corresponding path program 1 times [2019-09-08 04:00:31,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:31,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:31,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:31,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:31,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 23 proven. 18 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-09-08 04:00:31,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:00:31,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:00:31,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:32,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 4385 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 04:00:32,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:00:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 94 proven. 4 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-08 04:00:45,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:00:45,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-09-08 04:00:45,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 04:00:45,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 04:00:45,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:00:45,020 INFO L87 Difference]: Start difference. First operand 556479 states and 904568 transitions. Second operand 19 states. [2019-09-08 04:01:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:22,327 INFO L93 Difference]: Finished difference Result 1068944 states and 1745043 transitions. [2019-09-08 04:01:22,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 04:01:22,327 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 336 [2019-09-08 04:01:22,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:39,514 INFO L225 Difference]: With dead ends: 1068944 [2019-09-08 04:01:39,515 INFO L226 Difference]: Without dead ends: 512664 [2019-09-08 04:01:41,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-09-08 04:01:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512664 states. [2019-09-08 04:02:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512664 to 510431. [2019-09-08 04:02:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510431 states. [2019-09-08 04:02:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510431 states to 510431 states and 825518 transitions. [2019-09-08 04:02:29,096 INFO L78 Accepts]: Start accepts. Automaton has 510431 states and 825518 transitions. Word has length 336 [2019-09-08 04:02:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:29,097 INFO L475 AbstractCegarLoop]: Abstraction has 510431 states and 825518 transitions. [2019-09-08 04:02:29,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 04:02:29,097 INFO L276 IsEmpty]: Start isEmpty. Operand 510431 states and 825518 transitions. [2019-09-08 04:02:29,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-08 04:02:29,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:29,108 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 04:02:29,108 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:29,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:29,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1976361922, now seen corresponding path program 1 times [2019-09-08 04:02:29,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:29,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:29,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:29,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-08 04:02:29,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:02:29,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:02:29,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:02:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:29,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 4361 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 04:02:29,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:02:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-08 04:02:30,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:02:30,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 04:02:30,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:02:30,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:02:30,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:02:30,069 INFO L87 Difference]: Start difference. First operand 510431 states and 825518 transitions. Second operand 12 states.