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_spec14_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:43:15,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:43:15,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:43:15,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:43:15,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:43:15,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:43:15,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:43:15,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:43:15,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:43:15,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:43:15,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:43:15,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:43:15,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:43:15,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:43:15,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:43:15,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:43:15,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:43:15,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:43:15,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:43:15,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:43:15,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:43:15,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:43:15,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:43:15,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:43:15,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:43:15,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:43:15,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:43:15,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:43:15,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:43:15,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:43:15,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:43:15,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:43:15,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:43:15,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:43:15,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:43:15,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:43:15,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:43:15,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:43:15,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:43:15,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:43:15,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:43:15,789 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:43:15,803 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:43:15,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:43:15,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:43:15,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:43:15,805 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:43:15,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:43:15,805 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:43:15,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:43:15,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:43:15,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:43:15,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:43:15,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:43:15,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:43:15,806 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:43:15,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:43:15,807 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:43:15,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:43:15,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:43:15,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:43:15,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:43:15,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:43:15,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:43:15,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:43:15,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:43:15,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:43:15,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:43:15,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:43:15,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:43:15,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:43:15,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:43:15,847 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:43:15,851 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:43:15,852 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:43:15,852 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:43:15,853 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_productSimulator.cil.c [2019-09-08 03:43:15,908 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd26c87d5/4cd35dbca3444be48abe4816e89f684b/FLAGac12f1cf3 [2019-09-08 03:43:16,488 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:43:16,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_productSimulator.cil.c [2019-09-08 03:43:16,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd26c87d5/4cd35dbca3444be48abe4816e89f684b/FLAGac12f1cf3 [2019-09-08 03:43:16,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd26c87d5/4cd35dbca3444be48abe4816e89f684b [2019-09-08 03:43:16,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:43:16,743 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:43:16,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:43:16,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:43:16,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:43:16,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:43:16" (1/1) ... [2019-09-08 03:43:16,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8c2810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:16, skipping insertion in model container [2019-09-08 03:43:16,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:43:16" (1/1) ... [2019-09-08 03:43:16,762 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:43:16,839 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:43:17,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:43:17,606 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:43:17,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:43:17,865 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:43:17,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:17 WrapperNode [2019-09-08 03:43:17,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:43:17,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:43:17,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:43:17,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:43:17,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:17" (1/1) ... [2019-09-08 03:43:17,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:17" (1/1) ... [2019-09-08 03:43:17,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:17" (1/1) ... [2019-09-08 03:43:17,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:17" (1/1) ... [2019-09-08 03:43:18,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:17" (1/1) ... [2019-09-08 03:43:18,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:17" (1/1) ... [2019-09-08 03:43:18,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:17" (1/1) ... [2019-09-08 03:43:18,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:43:18,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:43:18,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:43:18,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:43:18,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:43:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:43:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:43:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:43:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-09-08 03:43:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:43:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:43:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:43:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:43:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:43:18,150 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:43:18,150 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:43:18,150 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:43:18,150 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:43:18,151 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:43:18,151 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:43:18,151 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:43:18,151 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:43:18,152 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:43:18,152 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:43:18,152 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:43:18,152 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:43:18,152 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:43:18,153 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:43:18,153 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:43:18,153 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:43:18,153 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:43:18,154 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:43:18,154 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:43:18,154 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:43:18,154 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:43:18,154 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:43:18,155 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:43:18,155 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:43:18,155 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:43:18,155 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:43:18,155 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:43:18,155 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:43:18,156 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:43:18,156 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:43:18,156 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:43:18,156 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:43:18,156 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__before__overloaded [2019-09-08 03:43:18,157 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__role__overloaded [2019-09-08 03:43:18,157 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:43:18,157 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__before__weight [2019-09-08 03:43:18,157 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__role__weight [2019-09-08 03:43:18,157 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:43:18,158 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__weight [2019-09-08 03:43:18,158 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__weight [2019-09-08 03:43:18,158 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__empty [2019-09-08 03:43:18,158 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__empty [2019-09-08 03:43:18,158 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:43:18,159 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:43:18,159 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:43:18,159 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:43:18,159 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:43:18,159 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:43:18,160 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:43:18,160 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:43:18,160 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:43:18,160 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:43:18,160 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__twothirdsfull [2019-09-08 03:43:18,161 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__twothirdsfull [2019-09-08 03:43:18,161 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__executivefloor [2019-09-08 03:43:18,161 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__executivefloor [2019-09-08 03:43:18,161 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:43:18,161 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:43:18,162 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:43:18,162 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-09-08 03:43:18,162 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-09-08 03:43:18,162 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-09-08 03:43:18,162 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-09-08 03:43:18,162 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:43:18,162 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:43:18,163 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:43:18,163 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__before__overloaded [2019-09-08 03:43:18,163 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__role__overloaded [2019-09-08 03:43:18,163 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:43:18,163 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__before__overloaded [2019-09-08 03:43:18,163 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__role__overloaded [2019-09-08 03:43:18,164 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:43:18,164 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:43:18,164 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 03:43:18,164 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 03:43:18,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:43:18,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:43:18,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:43:18,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:43:18,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:43:18,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:43:18,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:43:18,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:43:18,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:43:18,166 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:43:18,166 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:43:18,166 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:43:18,166 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 03:43:18,166 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 03:43:18,166 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-09-08 03:43:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:43:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:43:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:43:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:43:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:43:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:43:18,168 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:43:18,168 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:43:18,168 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:43:18,168 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:43:18,168 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:43:18,168 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:43:18,168 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:43:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:43:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:43:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:43:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:43:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:43:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:43:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:43:18,170 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:43:18,170 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:43:18,170 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:43:18,170 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:43:18,170 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:43:18,170 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:43:18,170 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:43:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:43:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:43:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:43:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:43:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:43:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:43:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:43:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:43:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:43:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:43:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:43:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:43:18,173 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:43:18,173 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:43:18,173 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:43:18,173 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:43:18,173 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:43:18,173 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:43:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:43:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:43:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__before__overloaded [2019-09-08 03:43:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__role__overloaded [2019-09-08 03:43:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__before__weight [2019-09-08 03:43:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__role__weight [2019-09-08 03:43:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__weight [2019-09-08 03:43:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__weight [2019-09-08 03:43:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__empty [2019-09-08 03:43:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__empty [2019-09-08 03:43:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:43:18,176 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:43:18,176 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:43:18,176 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:43:18,176 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:43:18,176 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__twothirdsfull [2019-09-08 03:43:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__twothirdsfull [2019-09-08 03:43:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__executivefloor [2019-09-08 03:43:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__executivefloor [2019-09-08 03:43:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:43:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:43:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-09-08 03:43:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-09-08 03:43:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-09-08 03:43:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-09-08 03:43:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:43:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:43:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:43:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__before__overloaded [2019-09-08 03:43:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__role__overloaded [2019-09-08 03:43:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure printState__before__overloaded [2019-09-08 03:43:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:43:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure printState__role__overloaded [2019-09-08 03:43:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:43:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:43:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:43:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:43:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:43:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:43:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:43:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:43:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:43:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:43:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:43:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:43:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:43:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:43:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:43:18,182 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:43:18,182 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:43:18,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:43:18,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:43:18,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:43:20,632 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:43:20,632 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:43:20,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:43:20 BoogieIcfgContainer [2019-09-08 03:43:20,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:43:20,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:43:20,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:43:20,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:43:20,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:43:16" (1/3) ... [2019-09-08 03:43:20,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e69177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:43:20, skipping insertion in model container [2019-09-08 03:43:20,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:17" (2/3) ... [2019-09-08 03:43:20,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e69177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:43:20, skipping insertion in model container [2019-09-08 03:43:20,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:43:20" (3/3) ... [2019-09-08 03:43:20,645 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_productSimulator.cil.c [2019-09-08 03:43:20,657 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:43:20,668 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:43:20,688 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:43:20,740 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:43:20,741 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:43:20,741 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:43:20,741 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:43:20,741 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:43:20,742 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:43:20,742 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:43:20,742 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:43:20,742 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:43:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states. [2019-09-08 03:43:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 03:43:20,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:20,815 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:20,818 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:20,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:20,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2107990238, now seen corresponding path program 1 times [2019-09-08 03:43:20,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:20,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:20,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:20,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:20,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:21,474 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:21,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:21,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:43:21,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:43:21,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:43:21,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:43:21,507 INFO L87 Difference]: Start difference. First operand 890 states. Second operand 6 states. [2019-09-08 03:43:21,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:21,726 INFO L93 Difference]: Finished difference Result 1446 states and 2245 transitions. [2019-09-08 03:43:21,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:43:21,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-09-08 03:43:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:21,758 INFO L225 Difference]: With dead ends: 1446 [2019-09-08 03:43:21,758 INFO L226 Difference]: Without dead ends: 726 [2019-09-08 03:43:21,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:43:21,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-08 03:43:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2019-09-08 03:43:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-09-08 03:43:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1115 transitions. [2019-09-08 03:43:21,899 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1115 transitions. Word has length 120 [2019-09-08 03:43:21,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:21,904 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1115 transitions. [2019-09-08 03:43:21,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:43:21,904 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1115 transitions. [2019-09-08 03:43:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 03:43:21,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:21,912 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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:43:21,912 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:21,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:21,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2135919125, now seen corresponding path program 1 times [2019-09-08 03:43:21,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:21,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:21,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:21,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:21,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:22,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:22,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:43:22,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:43:22,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:43:22,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:43:22,208 INFO L87 Difference]: Start difference. First operand 726 states and 1115 transitions. Second operand 4 states. [2019-09-08 03:43:22,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:22,295 INFO L93 Difference]: Finished difference Result 1410 states and 2184 transitions. [2019-09-08 03:43:22,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:43:22,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-08 03:43:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:22,303 INFO L225 Difference]: With dead ends: 1410 [2019-09-08 03:43:22,303 INFO L226 Difference]: Without dead ends: 730 [2019-09-08 03:43:22,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:43:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-09-08 03:43:22,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-09-08 03:43:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-08 03:43:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1118 transitions. [2019-09-08 03:43:22,345 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1118 transitions. Word has length 121 [2019-09-08 03:43:22,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:22,345 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1118 transitions. [2019-09-08 03:43:22,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:43:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1118 transitions. [2019-09-08 03:43:22,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 03:43:22,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:22,348 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-09-08 03:43:22,349 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:22,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:22,349 INFO L82 PathProgramCache]: Analyzing trace with hash -542373665, now seen corresponding path program 1 times [2019-09-08 03:43:22,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:22,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:22,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:22,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:22,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:22,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:22,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:43:22,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:43:22,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:43:22,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:43:22,483 INFO L87 Difference]: Start difference. First operand 730 states and 1118 transitions. Second operand 4 states. [2019-09-08 03:43:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:22,563 INFO L93 Difference]: Finished difference Result 1407 states and 2171 transitions. [2019-09-08 03:43:22,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:43:22,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-08 03:43:22,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:22,570 INFO L225 Difference]: With dead ends: 1407 [2019-09-08 03:43:22,570 INFO L226 Difference]: Without dead ends: 730 [2019-09-08 03:43:22,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:43:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-09-08 03:43:22,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-09-08 03:43:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-08 03:43:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1117 transitions. [2019-09-08 03:43:22,614 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1117 transitions. Word has length 122 [2019-09-08 03:43:22,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:22,615 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1117 transitions. [2019-09-08 03:43:22,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:43:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1117 transitions. [2019-09-08 03:43:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 03:43:22,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:22,619 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:22,619 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:22,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:22,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2073857327, now seen corresponding path program 1 times [2019-09-08 03:43:22,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:22,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:22,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:22,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:22,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:22,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:22,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:43:22,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:43:22,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:43:22,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:43:22,802 INFO L87 Difference]: Start difference. First operand 730 states and 1117 transitions. Second operand 4 states. [2019-09-08 03:43:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:22,936 INFO L93 Difference]: Finished difference Result 1407 states and 2170 transitions. [2019-09-08 03:43:22,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:43:22,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-08 03:43:22,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:22,954 INFO L225 Difference]: With dead ends: 1407 [2019-09-08 03:43:22,954 INFO L226 Difference]: Without dead ends: 730 [2019-09-08 03:43:22,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:43:22,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-09-08 03:43:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-09-08 03:43:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-08 03:43:22,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1116 transitions. [2019-09-08 03:43:22,997 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1116 transitions. Word has length 123 [2019-09-08 03:43:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:22,999 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1116 transitions. [2019-09-08 03:43:22,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:43:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1116 transitions. [2019-09-08 03:43:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 03:43:23,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:23,005 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:23,006 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:23,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:23,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1880970907, now seen corresponding path program 1 times [2019-09-08 03:43:23,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:23,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:23,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:23,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:23,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:23,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:23,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:43:23,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:43:23,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:43:23,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:43:23,176 INFO L87 Difference]: Start difference. First operand 730 states and 1116 transitions. Second operand 4 states. [2019-09-08 03:43:23,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:23,252 INFO L93 Difference]: Finished difference Result 1407 states and 2169 transitions. [2019-09-08 03:43:23,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:43:23,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-08 03:43:23,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:23,266 INFO L225 Difference]: With dead ends: 1407 [2019-09-08 03:43:23,266 INFO L226 Difference]: Without dead ends: 730 [2019-09-08 03:43:23,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:43:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-09-08 03:43:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-09-08 03:43:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-08 03:43:23,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1115 transitions. [2019-09-08 03:43:23,305 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1115 transitions. Word has length 124 [2019-09-08 03:43:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:23,307 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1115 transitions. [2019-09-08 03:43:23,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:43:23,308 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1115 transitions. [2019-09-08 03:43:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 03:43:23,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:23,312 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:23,312 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:23,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:23,312 INFO L82 PathProgramCache]: Analyzing trace with hash -182191219, now seen corresponding path program 1 times [2019-09-08 03:43:23,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:23,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:23,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:23,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:23,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:23,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:23,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:43:23,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:43:23,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:43:23,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:43:23,450 INFO L87 Difference]: Start difference. First operand 730 states and 1115 transitions. Second operand 4 states. [2019-09-08 03:43:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:23,517 INFO L93 Difference]: Finished difference Result 1407 states and 2168 transitions. [2019-09-08 03:43:23,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:43:23,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-08 03:43:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:23,524 INFO L225 Difference]: With dead ends: 1407 [2019-09-08 03:43:23,524 INFO L226 Difference]: Without dead ends: 730 [2019-09-08 03:43:23,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:43:23,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-09-08 03:43:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-09-08 03:43:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-08 03:43:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1114 transitions. [2019-09-08 03:43:23,559 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1114 transitions. Word has length 125 [2019-09-08 03:43:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:23,560 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1114 transitions. [2019-09-08 03:43:23,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:43:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1114 transitions. [2019-09-08 03:43:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 03:43:23,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:23,562 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-09-08 03:43:23,563 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:23,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:23,563 INFO L82 PathProgramCache]: Analyzing trace with hash 175506519, now seen corresponding path program 1 times [2019-09-08 03:43:23,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:23,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:23,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:23,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:23,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:23,822 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:23,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:23,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:43:23,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:43:23,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:43:23,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:43:23,825 INFO L87 Difference]: Start difference. First operand 730 states and 1114 transitions. Second operand 11 states. [2019-09-08 03:43:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:24,063 INFO L93 Difference]: Finished difference Result 1412 states and 2175 transitions. [2019-09-08 03:43:24,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:43:24,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2019-09-08 03:43:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:24,070 INFO L225 Difference]: With dead ends: 1412 [2019-09-08 03:43:24,071 INFO L226 Difference]: Without dead ends: 739 [2019-09-08 03:43:24,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:43:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-09-08 03:43:24,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2019-09-08 03:43:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-09-08 03:43:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1124 transitions. [2019-09-08 03:43:24,107 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1124 transitions. Word has length 126 [2019-09-08 03:43:24,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:24,107 INFO L475 AbstractCegarLoop]: Abstraction has 737 states and 1124 transitions. [2019-09-08 03:43:24,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:43:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1124 transitions. [2019-09-08 03:43:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 03:43:24,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:24,110 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-09-08 03:43:24,111 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:24,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:24,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1999173578, now seen corresponding path program 1 times [2019-09-08 03:43:24,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:24,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:24,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:24,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:24,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:24,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:24,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:43:24,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:43:24,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:43:24,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:43:24,231 INFO L87 Difference]: Start difference. First operand 737 states and 1124 transitions. Second operand 4 states. [2019-09-08 03:43:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:24,298 INFO L93 Difference]: Finished difference Result 1413 states and 2176 transitions. [2019-09-08 03:43:24,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:43:24,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-08 03:43:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:24,304 INFO L225 Difference]: With dead ends: 1413 [2019-09-08 03:43:24,304 INFO L226 Difference]: Without dead ends: 733 [2019-09-08 03:43:24,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:43:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-08 03:43:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2019-09-08 03:43:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-09-08 03:43:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1117 transitions. [2019-09-08 03:43:24,332 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1117 transitions. Word has length 126 [2019-09-08 03:43:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:24,333 INFO L475 AbstractCegarLoop]: Abstraction has 733 states and 1117 transitions. [2019-09-08 03:43:24,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:43:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1117 transitions. [2019-09-08 03:43:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 03:43:24,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:24,335 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:24,336 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:24,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1624055113, now seen corresponding path program 1 times [2019-09-08 03:43:24,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:24,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:24,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:24,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:24,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:24,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:24,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:43:24,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:43:24,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:43:24,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:43:24,493 INFO L87 Difference]: Start difference. First operand 733 states and 1117 transitions. Second operand 6 states. [2019-09-08 03:43:24,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:24,800 INFO L93 Difference]: Finished difference Result 1426 states and 2200 transitions. [2019-09-08 03:43:24,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:43:24,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-08 03:43:24,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:24,808 INFO L225 Difference]: With dead ends: 1426 [2019-09-08 03:43:24,808 INFO L226 Difference]: Without dead ends: 741 [2019-09-08 03:43:24,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:43:24,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-09-08 03:43:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 738. [2019-09-08 03:43:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-09-08 03:43:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1118 transitions. [2019-09-08 03:43:24,839 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1118 transitions. Word has length 127 [2019-09-08 03:43:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:24,840 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1118 transitions. [2019-09-08 03:43:24,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:43:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1118 transitions. [2019-09-08 03:43:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 03:43:24,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:24,842 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:24,842 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:24,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:24,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1494752762, now seen corresponding path program 1 times [2019-09-08 03:43:24,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:24,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:24,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:24,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:24,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:24,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:24,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:43:24,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:43:24,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:43:24,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:43:24,961 INFO L87 Difference]: Start difference. First operand 738 states and 1118 transitions. Second operand 6 states. [2019-09-08 03:43:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:25,219 INFO L93 Difference]: Finished difference Result 1389 states and 2115 transitions. [2019-09-08 03:43:25,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:43:25,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-08 03:43:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:25,226 INFO L225 Difference]: With dead ends: 1389 [2019-09-08 03:43:25,226 INFO L226 Difference]: Without dead ends: 738 [2019-09-08 03:43:25,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:43:25,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-09-08 03:43:25,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-09-08 03:43:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-09-08 03:43:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1114 transitions. [2019-09-08 03:43:25,257 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1114 transitions. Word has length 128 [2019-09-08 03:43:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:25,257 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1114 transitions. [2019-09-08 03:43:25,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:43:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1114 transitions. [2019-09-08 03:43:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 03:43:25,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:25,260 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:25,260 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:25,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:25,260 INFO L82 PathProgramCache]: Analyzing trace with hash 638673006, now seen corresponding path program 1 times [2019-09-08 03:43:25,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:25,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:25,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:25,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:25,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:25,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:25,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:43:25,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:43:25,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:43:25,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:43:25,437 INFO L87 Difference]: Start difference. First operand 738 states and 1114 transitions. Second operand 6 states. [2019-09-08 03:43:25,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:25,674 INFO L93 Difference]: Finished difference Result 1389 states and 2111 transitions. [2019-09-08 03:43:25,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:43:25,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-08 03:43:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:25,681 INFO L225 Difference]: With dead ends: 1389 [2019-09-08 03:43:25,681 INFO L226 Difference]: Without dead ends: 738 [2019-09-08 03:43:25,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:43:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-09-08 03:43:25,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-09-08 03:43:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-09-08 03:43:25,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1110 transitions. [2019-09-08 03:43:25,714 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1110 transitions. Word has length 129 [2019-09-08 03:43:25,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:25,715 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1110 transitions. [2019-09-08 03:43:25,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:43:25,715 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1110 transitions. [2019-09-08 03:43:25,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 03:43:25,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:25,717 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:25,718 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:25,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:25,718 INFO L82 PathProgramCache]: Analyzing trace with hash 805428462, now seen corresponding path program 1 times [2019-09-08 03:43:25,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:25,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:25,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:25,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:25,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:25,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:25,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:43:25,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:43:25,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:43:25,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:43:25,857 INFO L87 Difference]: Start difference. First operand 738 states and 1110 transitions. Second operand 7 states. [2019-09-08 03:43:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:25,989 INFO L93 Difference]: Finished difference Result 1392 states and 2111 transitions. [2019-09-08 03:43:25,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:43:25,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2019-09-08 03:43:25,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:25,995 INFO L225 Difference]: With dead ends: 1392 [2019-09-08 03:43:25,995 INFO L226 Difference]: Without dead ends: 720 [2019-09-08 03:43:25,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:43:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-09-08 03:43:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 717. [2019-09-08 03:43:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-08 03:43:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1073 transitions. [2019-09-08 03:43:26,026 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1073 transitions. Word has length 129 [2019-09-08 03:43:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:26,026 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1073 transitions. [2019-09-08 03:43:26,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:43:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1073 transitions. [2019-09-08 03:43:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 03:43:26,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:26,029 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:26,029 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:26,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:26,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1272669825, now seen corresponding path program 1 times [2019-09-08 03:43:26,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:26,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:26,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:26,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:26,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:26,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:26,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:43:26,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:43:26,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:43:26,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:43:26,187 INFO L87 Difference]: Start difference. First operand 717 states and 1073 transitions. Second operand 6 states. [2019-09-08 03:43:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:26,329 INFO L93 Difference]: Finished difference Result 1368 states and 2070 transitions. [2019-09-08 03:43:26,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:43:26,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-09-08 03:43:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:26,336 INFO L225 Difference]: With dead ends: 1368 [2019-09-08 03:43:26,336 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 03:43:26,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:43:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 03:43:26,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-09-08 03:43:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-08 03:43:26,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1072 transitions. [2019-09-08 03:43:26,362 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1072 transitions. Word has length 130 [2019-09-08 03:43:26,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:26,362 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1072 transitions. [2019-09-08 03:43:26,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:43:26,363 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1072 transitions. [2019-09-08 03:43:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 03:43:26,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:26,365 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-09-08 03:43:26,365 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:26,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:26,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1537429613, now seen corresponding path program 1 times [2019-09-08 03:43:26,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:26,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:26,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:26,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:26,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:26,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:26,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:43:26,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:43:26,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:43:26,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:43:26,533 INFO L87 Difference]: Start difference. First operand 717 states and 1072 transitions. Second operand 6 states. [2019-09-08 03:43:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:26,662 INFO L93 Difference]: Finished difference Result 1368 states and 2069 transitions. [2019-09-08 03:43:26,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:43:26,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-09-08 03:43:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:26,668 INFO L225 Difference]: With dead ends: 1368 [2019-09-08 03:43:26,668 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 03:43:26,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:43:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 03:43:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-09-08 03:43:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-08 03:43:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1071 transitions. [2019-09-08 03:43:26,692 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1071 transitions. Word has length 131 [2019-09-08 03:43:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:26,693 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1071 transitions. [2019-09-08 03:43:26,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:43:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1071 transitions. [2019-09-08 03:43:26,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 03:43:26,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:26,695 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:26,695 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:26,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:26,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1036805370, now seen corresponding path program 1 times [2019-09-08 03:43:26,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:26,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:26,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:26,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:26,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:26,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:26,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:43:26,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:43:26,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:43:26,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:43:26,793 INFO L87 Difference]: Start difference. First operand 717 states and 1071 transitions. Second operand 4 states. [2019-09-08 03:43:26,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:26,861 INFO L93 Difference]: Finished difference Result 1368 states and 2068 transitions. [2019-09-08 03:43:26,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:43:26,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-09-08 03:43:26,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:26,866 INFO L225 Difference]: With dead ends: 1368 [2019-09-08 03:43:26,866 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 03:43:26,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:43:26,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 03:43:26,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-09-08 03:43:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-08 03:43:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1070 transitions. [2019-09-08 03:43:26,890 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1070 transitions. Word has length 132 [2019-09-08 03:43:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:26,891 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1070 transitions. [2019-09-08 03:43:26,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:43:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1070 transitions. [2019-09-08 03:43:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 03:43:26,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:26,894 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:26,894 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:26,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:26,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1997244676, now seen corresponding path program 1 times [2019-09-08 03:43:26,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:26,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:26,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:26,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:26,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:27,114 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:27,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:27,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:43:27,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:43:27,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:43:27,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:43:27,116 INFO L87 Difference]: Start difference. First operand 717 states and 1070 transitions. Second operand 13 states. [2019-09-08 03:43:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:27,533 INFO L93 Difference]: Finished difference Result 1374 states and 2078 transitions. [2019-09-08 03:43:27,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:43:27,534 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2019-09-08 03:43:27,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:27,538 INFO L225 Difference]: With dead ends: 1374 [2019-09-08 03:43:27,538 INFO L226 Difference]: Without dead ends: 724 [2019-09-08 03:43:27,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:43:27,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-08 03:43:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 722. [2019-09-08 03:43:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-09-08 03:43:27,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1076 transitions. [2019-09-08 03:43:27,563 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1076 transitions. Word has length 132 [2019-09-08 03:43:27,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:27,563 INFO L475 AbstractCegarLoop]: Abstraction has 722 states and 1076 transitions. [2019-09-08 03:43:27,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:43:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1076 transitions. [2019-09-08 03:43:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 03:43:27,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:27,566 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:27,566 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:27,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2064235796, now seen corresponding path program 1 times [2019-09-08 03:43:27,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:27,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:27,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:27,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:27,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:27,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:27,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 03:43:27,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 03:43:27,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 03:43:27,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 03:43:27,673 INFO L87 Difference]: Start difference. First operand 722 states and 1076 transitions. Second operand 3 states. [2019-09-08 03:43:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:27,741 INFO L93 Difference]: Finished difference Result 2040 states and 3094 transitions. [2019-09-08 03:43:27,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 03:43:27,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-09-08 03:43:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:27,750 INFO L225 Difference]: With dead ends: 2040 [2019-09-08 03:43:27,750 INFO L226 Difference]: Without dead ends: 1391 [2019-09-08 03:43:27,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 03:43:27,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2019-09-08 03:43:27,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1388. [2019-09-08 03:43:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2019-09-08 03:43:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2089 transitions. [2019-09-08 03:43:27,804 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2089 transitions. Word has length 133 [2019-09-08 03:43:27,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:27,804 INFO L475 AbstractCegarLoop]: Abstraction has 1388 states and 2089 transitions. [2019-09-08 03:43:27,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 03:43:27,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2089 transitions. [2019-09-08 03:43:27,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 03:43:27,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:27,808 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:27,808 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:27,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:27,808 INFO L82 PathProgramCache]: Analyzing trace with hash 565322765, now seen corresponding path program 1 times [2019-09-08 03:43:27,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:27,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:27,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:27,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:27,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:43:27,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:27,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:43:27,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:43:27,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:43:27,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:43:27,995 INFO L87 Difference]: Start difference. First operand 1388 states and 2089 transitions. Second operand 5 states. [2019-09-08 03:43:32,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:32,556 INFO L93 Difference]: Finished difference Result 4171 states and 6512 transitions. [2019-09-08 03:43:32,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:43:32,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-08 03:43:32,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:32,574 INFO L225 Difference]: With dead ends: 4171 [2019-09-08 03:43:32,574 INFO L226 Difference]: Without dead ends: 2900 [2019-09-08 03:43:32,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:43:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2019-09-08 03:43:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2797. [2019-09-08 03:43:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-09-08 03:43:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4393 transitions. [2019-09-08 03:43:32,706 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4393 transitions. Word has length 134 [2019-09-08 03:43:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:32,706 INFO L475 AbstractCegarLoop]: Abstraction has 2797 states and 4393 transitions. [2019-09-08 03:43:32,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:43:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4393 transitions. [2019-09-08 03:43:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 03:43:32,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:32,716 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-09-08 03:43:32,716 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:32,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:32,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1531506531, now seen corresponding path program 1 times [2019-09-08 03:43:32,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:32,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:32,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:32,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:32,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:43:32,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:32,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 03:43:32,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 03:43:32,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 03:43:32,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 03:43:32,842 INFO L87 Difference]: Start difference. First operand 2797 states and 4393 transitions. Second operand 3 states. [2019-09-08 03:43:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:33,004 INFO L93 Difference]: Finished difference Result 4132 states and 6497 transitions. [2019-09-08 03:43:33,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 03:43:33,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 03:43:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:33,024 INFO L225 Difference]: With dead ends: 4132 [2019-09-08 03:43:33,024 INFO L226 Difference]: Without dead ends: 2800 [2019-09-08 03:43:33,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 03:43:33,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2019-09-08 03:43:33,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2797. [2019-09-08 03:43:33,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-09-08 03:43:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4367 transitions. [2019-09-08 03:43:33,164 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4367 transitions. Word has length 180 [2019-09-08 03:43:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:33,165 INFO L475 AbstractCegarLoop]: Abstraction has 2797 states and 4367 transitions. [2019-09-08 03:43:33,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 03:43:33,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4367 transitions. [2019-09-08 03:43:33,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 03:43:33,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:33,183 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-09-08 03:43:33,184 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:33,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:33,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1763835588, now seen corresponding path program 1 times [2019-09-08 03:43:33,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:33,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:33,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:33,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:33,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:43:33,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:33,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:43:33,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:43:33,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:43:33,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:43:33,426 INFO L87 Difference]: Start difference. First operand 2797 states and 4367 transitions. Second operand 9 states. [2019-09-08 03:43:35,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:35,143 INFO L93 Difference]: Finished difference Result 5465 states and 8645 transitions. [2019-09-08 03:43:35,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:43:35,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2019-09-08 03:43:35,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:35,162 INFO L225 Difference]: With dead ends: 5465 [2019-09-08 03:43:35,163 INFO L226 Difference]: Without dead ends: 2784 [2019-09-08 03:43:35,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:43:35,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2019-09-08 03:43:35,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2784. [2019-09-08 03:43:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2784 states. [2019-09-08 03:43:35,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4337 transitions. [2019-09-08 03:43:35,298 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4337 transitions. Word has length 179 [2019-09-08 03:43:35,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:35,299 INFO L475 AbstractCegarLoop]: Abstraction has 2784 states and 4337 transitions. [2019-09-08 03:43:35,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:43:35,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4337 transitions. [2019-09-08 03:43:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 03:43:35,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:35,309 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:35,309 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:35,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:35,310 INFO L82 PathProgramCache]: Analyzing trace with hash -485595940, now seen corresponding path program 1 times [2019-09-08 03:43:35,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:35,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:35,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:35,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:35,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 03:43:35,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:35,509 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:43:35,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:36,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 3110 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:43:36,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 03:43:36,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:36,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:43:36,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:43:36,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:43:36,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:43:36,459 INFO L87 Difference]: Start difference. First operand 2784 states and 4337 transitions. Second operand 9 states. [2019-09-08 03:43:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:38,039 INFO L93 Difference]: Finished difference Result 5465 states and 8747 transitions. [2019-09-08 03:43:38,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:43:38,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2019-09-08 03:43:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:38,068 INFO L225 Difference]: With dead ends: 5465 [2019-09-08 03:43:38,068 INFO L226 Difference]: Without dead ends: 2800 [2019-09-08 03:43:38,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:43:38,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2019-09-08 03:43:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2800. [2019-09-08 03:43:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2800 states. [2019-09-08 03:43:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 4353 transitions. [2019-09-08 03:43:38,232 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 4353 transitions. Word has length 193 [2019-09-08 03:43:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:38,233 INFO L475 AbstractCegarLoop]: Abstraction has 2800 states and 4353 transitions. [2019-09-08 03:43:38,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:43:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 4353 transitions. [2019-09-08 03:43:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 03:43:38,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:38,243 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:38,243 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:38,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1227005091, now seen corresponding path program 1 times [2019-09-08 03:43:38,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:38,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:38,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:38,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:38,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 03:43:38,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:38,483 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:43:38,501 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:43:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:39,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 3113 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:43:39,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 03:43:39,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:39,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:43:39,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:43:39,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:43:39,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:43:39,186 INFO L87 Difference]: Start difference. First operand 2800 states and 4353 transitions. Second operand 9 states. [2019-09-08 03:43:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:41,692 INFO L93 Difference]: Finished difference Result 5501 states and 8775 transitions. [2019-09-08 03:43:41,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:43:41,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 196 [2019-09-08 03:43:41,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:41,731 INFO L225 Difference]: With dead ends: 5501 [2019-09-08 03:43:41,732 INFO L226 Difference]: Without dead ends: 2820 [2019-09-08 03:43:41,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:43:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2019-09-08 03:43:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2820. [2019-09-08 03:43:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2820 states. [2019-09-08 03:43:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 4373 transitions. [2019-09-08 03:43:41,899 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 4373 transitions. Word has length 196 [2019-09-08 03:43:41,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:41,899 INFO L475 AbstractCegarLoop]: Abstraction has 2820 states and 4373 transitions. [2019-09-08 03:43:41,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:43:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 4373 transitions. [2019-09-08 03:43:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 03:43:41,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:41,910 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:41,910 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:41,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1959931264, now seen corresponding path program 1 times [2019-09-08 03:43:41,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:41,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:41,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:41,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:41,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 03:43:42,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:42,062 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) [2019-09-08 03:43:42,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:43:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:42,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 3116 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:43:42,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 03:43:42,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:42,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:43:42,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:43:42,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:43:42,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:43:42,745 INFO L87 Difference]: Start difference. First operand 2820 states and 4373 transitions. Second operand 9 states. [2019-09-08 03:43:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:44,430 INFO L93 Difference]: Finished difference Result 5545 states and 8811 transitions. [2019-09-08 03:43:44,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:43:44,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2019-09-08 03:43:44,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:44,451 INFO L225 Difference]: With dead ends: 5545 [2019-09-08 03:43:44,451 INFO L226 Difference]: Without dead ends: 2844 [2019-09-08 03:43:44,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:43:44,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2019-09-08 03:43:44,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2844. [2019-09-08 03:43:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2844 states. [2019-09-08 03:43:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 4397 transitions. [2019-09-08 03:43:44,570 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 4397 transitions. Word has length 199 [2019-09-08 03:43:44,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:44,570 INFO L475 AbstractCegarLoop]: Abstraction has 2844 states and 4397 transitions. [2019-09-08 03:43:44,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:43:44,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 4397 transitions. [2019-09-08 03:43:44,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 03:43:44,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:44,581 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:44,581 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:44,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:44,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1815863567, now seen corresponding path program 1 times [2019-09-08 03:43:44,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:44,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:44,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:44,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:44,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 03:43:44,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:44,727 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:43:44,742 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:43:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:45,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 3119 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:43:45,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 03:43:45,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:45,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:43:45,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:43:45,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:43:45,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:43:45,366 INFO L87 Difference]: Start difference. First operand 2844 states and 4397 transitions. Second operand 9 states. [2019-09-08 03:43:47,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:47,024 INFO L93 Difference]: Finished difference Result 5597 states and 8855 transitions. [2019-09-08 03:43:47,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:43:47,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 202 [2019-09-08 03:43:47,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:47,039 INFO L225 Difference]: With dead ends: 5597 [2019-09-08 03:43:47,039 INFO L226 Difference]: Without dead ends: 2872 [2019-09-08 03:43:47,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:43:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2019-09-08 03:43:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 2872. [2019-09-08 03:43:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2872 states. [2019-09-08 03:43:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2872 states and 4425 transitions. [2019-09-08 03:43:47,166 INFO L78 Accepts]: Start accepts. Automaton has 2872 states and 4425 transitions. Word has length 202 [2019-09-08 03:43:47,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:47,167 INFO L475 AbstractCegarLoop]: Abstraction has 2872 states and 4425 transitions. [2019-09-08 03:43:47,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:43:47,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2872 states and 4425 transitions. [2019-09-08 03:43:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 03:43:47,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:47,181 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:47,181 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:47,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:47,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1931127844, now seen corresponding path program 1 times [2019-09-08 03:43:47,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:47,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:47,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:47,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:47,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-08 03:43:47,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:47,395 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:43:47,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:47,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 03:43:47,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 03:43:48,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:48,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-09-08 03:43:48,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 03:43:48,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 03:43:48,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:43:48,043 INFO L87 Difference]: Start difference. First operand 2872 states and 4425 transitions. Second operand 16 states. [2019-09-08 03:44:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:33,391 INFO L93 Difference]: Finished difference Result 21434 states and 34628 transitions. [2019-09-08 03:44:33,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-08 03:44:33,391 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 205 [2019-09-08 03:44:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:33,484 INFO L225 Difference]: With dead ends: 21434 [2019-09-08 03:44:33,484 INFO L226 Difference]: Without dead ends: 18681 [2019-09-08 03:44:33,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3025 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=926, Invalid=8194, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 03:44:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18681 states. [2019-09-08 03:44:34,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18681 to 17830. [2019-09-08 03:44:34,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17830 states. [2019-09-08 03:44:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17830 states to 17830 states and 28426 transitions. [2019-09-08 03:44:34,305 INFO L78 Accepts]: Start accepts. Automaton has 17830 states and 28426 transitions. Word has length 205 [2019-09-08 03:44:34,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:34,305 INFO L475 AbstractCegarLoop]: Abstraction has 17830 states and 28426 transitions. [2019-09-08 03:44:34,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 03:44:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 17830 states and 28426 transitions. [2019-09-08 03:44:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 03:44:34,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:34,326 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:44:34,326 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:34,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:34,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1086064263, now seen corresponding path program 1 times [2019-09-08 03:44:34,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:34,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:34,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:34,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:34,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-08 03:44:34,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:44:34,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:44:34,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:44:34,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:44:34,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:44:34,480 INFO L87 Difference]: Start difference. First operand 17830 states and 28426 transitions. Second operand 9 states. [2019-09-08 03:44:35,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:35,189 INFO L93 Difference]: Finished difference Result 35243 states and 56245 transitions. [2019-09-08 03:44:35,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:44:35,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 213 [2019-09-08 03:44:35,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:35,293 INFO L225 Difference]: With dead ends: 35243 [2019-09-08 03:44:35,294 INFO L226 Difference]: Without dead ends: 17520 [2019-09-08 03:44:35,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:44:35,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17520 states. [2019-09-08 03:44:36,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17520 to 17504. [2019-09-08 03:44:36,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17504 states. [2019-09-08 03:44:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17504 states to 17504 states and 27886 transitions. [2019-09-08 03:44:36,174 INFO L78 Accepts]: Start accepts. Automaton has 17504 states and 27886 transitions. Word has length 213 [2019-09-08 03:44:36,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:36,174 INFO L475 AbstractCegarLoop]: Abstraction has 17504 states and 27886 transitions. [2019-09-08 03:44:36,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:44:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 17504 states and 27886 transitions. [2019-09-08 03:44:36,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 03:44:36,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:36,191 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:44:36,192 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:36,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:36,192 INFO L82 PathProgramCache]: Analyzing trace with hash -669037662, now seen corresponding path program 1 times [2019-09-08 03:44:36,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:36,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:36,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:36,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:36,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-08 03:44:37,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:37,346 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:44:37,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:37,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 3172 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:44:37,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 03:44:38,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:44:38,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2019-09-08 03:44:38,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 03:44:38,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 03:44:38,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:44:38,047 INFO L87 Difference]: Start difference. First operand 17504 states and 27886 transitions. Second operand 18 states. [2019-09-08 03:44:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:56,514 INFO L93 Difference]: Finished difference Result 46500 states and 76130 transitions. [2019-09-08 03:44:56,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 03:44:56,515 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 222 [2019-09-08 03:44:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:56,680 INFO L225 Difference]: With dead ends: 46500 [2019-09-08 03:44:56,681 INFO L226 Difference]: Without dead ends: 29115 [2019-09-08 03:44:56,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=2029, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 03:44:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29115 states. [2019-09-08 03:44:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29115 to 27818. [2019-09-08 03:44:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27818 states. [2019-09-08 03:44:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27818 states to 27818 states and 44617 transitions. [2019-09-08 03:44:58,102 INFO L78 Accepts]: Start accepts. Automaton has 27818 states and 44617 transitions. Word has length 222 [2019-09-08 03:44:58,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:58,102 INFO L475 AbstractCegarLoop]: Abstraction has 27818 states and 44617 transitions. [2019-09-08 03:44:58,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 03:44:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 27818 states and 44617 transitions. [2019-09-08 03:44:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 03:44:58,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:58,115 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:58,115 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:58,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:58,116 INFO L82 PathProgramCache]: Analyzing trace with hash 964301433, now seen corresponding path program 1 times [2019-09-08 03:44:58,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:58,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:58,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:58,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:58,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-08 03:44:58,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:44:58,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:44:58,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:44:58,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:44:58,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:44:58,247 INFO L87 Difference]: Start difference. First operand 27818 states and 44617 transitions. Second operand 4 states. [2019-09-08 03:45:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:01,806 INFO L93 Difference]: Finished difference Result 80682 states and 132197 transitions. [2019-09-08 03:45:01,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:45:01,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-09-08 03:45:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:02,092 INFO L225 Difference]: With dead ends: 80682 [2019-09-08 03:45:02,092 INFO L226 Difference]: Without dead ends: 52983 [2019-09-08 03:45:02,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:45:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52983 states. [2019-09-08 03:45:03,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52983 to 52908. [2019-09-08 03:45:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52908 states. [2019-09-08 03:45:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52908 states to 52908 states and 84861 transitions. [2019-09-08 03:45:04,347 INFO L78 Accepts]: Start accepts. Automaton has 52908 states and 84861 transitions. Word has length 227 [2019-09-08 03:45:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:04,348 INFO L475 AbstractCegarLoop]: Abstraction has 52908 states and 84861 transitions. [2019-09-08 03:45:04,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:45:04,348 INFO L276 IsEmpty]: Start isEmpty. Operand 52908 states and 84861 transitions. [2019-09-08 03:45:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 03:45:04,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:04,368 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:04,369 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:04,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:04,369 INFO L82 PathProgramCache]: Analyzing trace with hash 748680509, now seen corresponding path program 1 times [2019-09-08 03:45:04,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:04,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:04,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:04,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:04,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-08 03:45:04,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:04,569 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:04,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:05,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 3188 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 03:45:05,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 03:45:05,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:05,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 12 [2019-09-08 03:45:05,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:45:05,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:45:05,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:45:05,148 INFO L87 Difference]: Start difference. First operand 52908 states and 84861 transitions. Second operand 12 states. [2019-09-08 03:45:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:18,242 INFO L93 Difference]: Finished difference Result 106030 states and 171573 transitions. [2019-09-08 03:45:18,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 03:45:18,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 228 [2019-09-08 03:45:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:18,577 INFO L225 Difference]: With dead ends: 106030 [2019-09-08 03:45:18,577 INFO L226 Difference]: Without dead ends: 53327 [2019-09-08 03:45:18,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2019-09-08 03:45:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53327 states. [2019-09-08 03:45:22,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53327 to 52860. [2019-09-08 03:45:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52860 states. [2019-09-08 03:45:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52860 states to 52860 states and 84717 transitions. [2019-09-08 03:45:23,048 INFO L78 Accepts]: Start accepts. Automaton has 52860 states and 84717 transitions. Word has length 228 [2019-09-08 03:45:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:23,048 INFO L475 AbstractCegarLoop]: Abstraction has 52860 states and 84717 transitions. [2019-09-08 03:45:23,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:45:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 52860 states and 84717 transitions. [2019-09-08 03:45:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 03:45:23,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:23,059 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:23,060 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:23,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:23,060 INFO L82 PathProgramCache]: Analyzing trace with hash -633150564, now seen corresponding path program 1 times [2019-09-08 03:45:23,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:23,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:23,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:23,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:23,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-08 03:45:23,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:23,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:45:23,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:45:23,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:45:23,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:45:23,297 INFO L87 Difference]: Start difference. First operand 52860 states and 84717 transitions. Second operand 13 states. [2019-09-08 03:45:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:37,273 INFO L93 Difference]: Finished difference Result 86056 states and 137419 transitions. [2019-09-08 03:45:37,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 03:45:37,274 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 237 [2019-09-08 03:45:37,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:37,626 INFO L225 Difference]: With dead ends: 86056 [2019-09-08 03:45:37,626 INFO L226 Difference]: Without dead ends: 59643 [2019-09-08 03:45:37,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 03:45:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59643 states. [2019-09-08 03:45:39,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59643 to 57204. [2019-09-08 03:45:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57204 states. [2019-09-08 03:45:40,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57204 states to 57204 states and 90409 transitions. [2019-09-08 03:45:40,073 INFO L78 Accepts]: Start accepts. Automaton has 57204 states and 90409 transitions. Word has length 237 [2019-09-08 03:45:40,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:40,074 INFO L475 AbstractCegarLoop]: Abstraction has 57204 states and 90409 transitions. [2019-09-08 03:45:40,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:45:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 57204 states and 90409 transitions. [2019-09-08 03:45:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 03:45:40,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:40,083 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:40,084 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:40,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1068787849, now seen corresponding path program 1 times [2019-09-08 03:45:40,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:40,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:40,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:40,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:40,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 03:45:40,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:40,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:45:40,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:45:40,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:45:40,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:45:40,326 INFO L87 Difference]: Start difference. First operand 57204 states and 90409 transitions. Second operand 11 states. [2019-09-08 03:45:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:42,432 INFO L93 Difference]: Finished difference Result 89401 states and 141003 transitions. [2019-09-08 03:45:42,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:45:42,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 242 [2019-09-08 03:45:42,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:42,798 INFO L225 Difference]: With dead ends: 89401 [2019-09-08 03:45:42,799 INFO L226 Difference]: Without dead ends: 58716 [2019-09-08 03:45:42,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:45:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58716 states. [2019-09-08 03:45:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58716 to 57984. [2019-09-08 03:45:47,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57984 states. [2019-09-08 03:45:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57984 states to 57984 states and 91249 transitions. [2019-09-08 03:45:47,341 INFO L78 Accepts]: Start accepts. Automaton has 57984 states and 91249 transitions. Word has length 242 [2019-09-08 03:45:47,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:47,342 INFO L475 AbstractCegarLoop]: Abstraction has 57984 states and 91249 transitions. [2019-09-08 03:45:47,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:45:47,342 INFO L276 IsEmpty]: Start isEmpty. Operand 57984 states and 91249 transitions. [2019-09-08 03:45:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 03:45:47,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:47,352 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:45:47,352 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:47,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:47,352 INFO L82 PathProgramCache]: Analyzing trace with hash 884009137, now seen corresponding path program 1 times [2019-09-08 03:45:47,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:47,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:47,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:47,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:47,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 03:45:47,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:47,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:45:47,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:45:47,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:45:47,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:45:47,558 INFO L87 Difference]: Start difference. First operand 57984 states and 91249 transitions. Second operand 6 states. [2019-09-08 03:45:56,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:56,524 INFO L93 Difference]: Finished difference Result 179277 states and 285781 transitions. [2019-09-08 03:45:56,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:45:56,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 246 [2019-09-08 03:45:56,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:57,122 INFO L225 Difference]: With dead ends: 179277 [2019-09-08 03:45:57,122 INFO L226 Difference]: Without dead ends: 121402 [2019-09-08 03:45:57,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:45:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121402 states. [2019-09-08 03:46:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121402 to 119216. [2019-09-08 03:46:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119216 states. [2019-09-08 03:46:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119216 states to 119216 states and 185867 transitions. [2019-09-08 03:46:04,494 INFO L78 Accepts]: Start accepts. Automaton has 119216 states and 185867 transitions. Word has length 246 [2019-09-08 03:46:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:04,495 INFO L475 AbstractCegarLoop]: Abstraction has 119216 states and 185867 transitions. [2019-09-08 03:46:04,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:46:04,495 INFO L276 IsEmpty]: Start isEmpty. Operand 119216 states and 185867 transitions. [2019-09-08 03:46:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 03:46:04,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:04,511 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:46:04,511 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:04,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:04,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1085388165, now seen corresponding path program 1 times [2019-09-08 03:46:04,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:04,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:04,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:04,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:04,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-08 03:46:04,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:04,695 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:46:04,717 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:46:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:05,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 3452 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:46:05,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:46:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 106 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:46:05,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:46:05,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2019-09-08 03:46:05,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:46:05,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:46:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:46:05,470 INFO L87 Difference]: Start difference. First operand 119216 states and 185867 transitions. Second operand 14 states. [2019-09-08 03:46:43,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:43,555 INFO L93 Difference]: Finished difference Result 425498 states and 708513 transitions. [2019-09-08 03:46:43,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 03:46:43,556 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 245 [2019-09-08 03:46:43,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:50,590 INFO L225 Difference]: With dead ends: 425498 [2019-09-08 03:46:50,590 INFO L226 Difference]: Without dead ends: 306363 [2019-09-08 03:46:50,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=637, Invalid=2443, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 03:46:51,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306363 states. [2019-09-08 03:47:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306363 to 298332. [2019-09-08 03:47:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298332 states. [2019-09-08 03:47:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298332 states to 298332 states and 469389 transitions. [2019-09-08 03:47:08,360 INFO L78 Accepts]: Start accepts. Automaton has 298332 states and 469389 transitions. Word has length 245 [2019-09-08 03:47:08,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:47:08,361 INFO L475 AbstractCegarLoop]: Abstraction has 298332 states and 469389 transitions. [2019-09-08 03:47:08,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:47:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 298332 states and 469389 transitions. [2019-09-08 03:47:08,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 03:47:08,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:47:08,376 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:47:08,377 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:47:08,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:47:08,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1738505052, now seen corresponding path program 1 times [2019-09-08 03:47:08,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:47:08,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:47:08,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:08,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:08,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:08,554 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-08 03:47:08,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:47:08,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:47:08,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:47:08,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:47:08,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:47:08,556 INFO L87 Difference]: Start difference. First operand 298332 states and 469389 transitions. Second operand 6 states. [2019-09-08 03:48:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:48:09,619 INFO L93 Difference]: Finished difference Result 1029254 states and 1772361 transitions. [2019-09-08 03:48:09,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:48:09,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-09-08 03:48:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:48:14,355 INFO L225 Difference]: With dead ends: 1029254 [2019-09-08 03:48:14,356 INFO L226 Difference]: Without dead ends: 731475 [2019-09-08 03:48:15,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:48:16,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731475 states. [2019-09-08 03:49:18,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731475 to 656472. [2019-09-08 03:49:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656472 states. [2019-09-08 03:49:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656472 states to 656472 states and 1074863 transitions. [2019-09-08 03:49:37,765 INFO L78 Accepts]: Start accepts. Automaton has 656472 states and 1074863 transitions. Word has length 248 [2019-09-08 03:49:37,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:37,766 INFO L475 AbstractCegarLoop]: Abstraction has 656472 states and 1074863 transitions. [2019-09-08 03:49:37,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:49:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 656472 states and 1074863 transitions. [2019-09-08 03:49:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 03:49:37,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:37,782 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:49:37,782 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:37,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:37,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2037711328, now seen corresponding path program 1 times [2019-09-08 03:49:37,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:37,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:37,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:37,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:37,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-08 03:49:37,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:49:37,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:49:37,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:49:37,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:49:37,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:49:37,940 INFO L87 Difference]: Start difference. First operand 656472 states and 1074863 transitions. Second operand 6 states.