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_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:56:49,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:56:49,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:56:49,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:56:49,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:56:49,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:56:49,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:56:49,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:56:49,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:56:49,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:56:49,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:56:49,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:56:49,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:56:49,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:56:49,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:56:49,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:56:49,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:56:49,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:56:49,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:56:49,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:56:49,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:56:49,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:56:49,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:56:49,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:56:49,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:56:49,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:56:49,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:56:49,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:56:49,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:56:49,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:56:49,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:56:49,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:56:49,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:56:49,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:56:49,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:56:49,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:56:49,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:56:49,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:56:49,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:56:49,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:56:49,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:56:49,834 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:56:49,858 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:56:49,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:56:49,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:56:49,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:56:49,860 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:56:49,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:56:49,860 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:56:49,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:56:49,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:56:49,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:56:49,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:56:49,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:56:49,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:56:49,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:56:49,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:56:49,862 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:56:49,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:56:49,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:56:49,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:56:49,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:56:49,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:56:49,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:56:49,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:56:49,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:56:49,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:56:49,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:56:49,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:56:49,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:56:49,865 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:56:49,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:56:49,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:56:49,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:56:49,917 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:56:49,917 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:56:49,918 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product32.cil.c [2019-10-02 11:56:49,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c19a7a2/204c2c3e40ea44208623386f8f297701/FLAG2be8644ea [2019-10-02 11:56:50,647 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:56:50,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product32.cil.c [2019-10-02 11:56:50,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c19a7a2/204c2c3e40ea44208623386f8f297701/FLAG2be8644ea [2019-10-02 11:56:50,764 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c19a7a2/204c2c3e40ea44208623386f8f297701 [2019-10-02 11:56:50,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:56:50,776 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:56:50,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:56:50,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:56:50,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:56:50,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:56:50" (1/1) ... [2019-10-02 11:56:50,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ec9619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:50, skipping insertion in model container [2019-10-02 11:56:50,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:56:50" (1/1) ... [2019-10-02 11:56:50,791 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:56:50,882 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:56:51,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:56:51,628 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:56:51,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:56:51,880 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:56:51,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:51 WrapperNode [2019-10-02 11:56:51,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:56:51,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:56:51,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:56:51,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:56:51,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:51" (1/1) ... [2019-10-02 11:56:51,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:51" (1/1) ... [2019-10-02 11:56:51,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:51" (1/1) ... [2019-10-02 11:56:51,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:51" (1/1) ... [2019-10-02 11:56:52,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:51" (1/1) ... [2019-10-02 11:56:52,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:51" (1/1) ... [2019-10-02 11:56:52,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:51" (1/1) ... [2019-10-02 11:56:52,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:56:52,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:56:52,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:56:52,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:56:52,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:56:52,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:56:52,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:56:52,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 11:56:52,165 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 11:56:52,166 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 11:56:52,167 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 11:56:52,167 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 11:56:52,167 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 11:56:52,168 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 11:56:52,168 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 11:56:52,168 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 11:56:52,168 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 11:56:52,169 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 11:56:52,169 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 11:56:52,171 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 11:56:52,171 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 11:56:52,173 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 11:56:52,173 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 11:56:52,173 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 11:56:52,174 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 11:56:52,174 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 11:56:52,174 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 11:56:52,174 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 11:56:52,174 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:56:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 11:56:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 11:56:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 11:56:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 11:56:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 11:56:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 11:56:52,176 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 11:56:52,176 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 11:56:52,176 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 11:56:52,176 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 11:56:52,176 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 11:56:52,176 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 11:56:52,177 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 11:56:52,177 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 11:56:52,177 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 11:56:52,177 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 11:56:52,178 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 11:56:52,178 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 11:56:52,178 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 11:56:52,178 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 11:56:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 11:56:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 11:56:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 11:56:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 11:56:52,180 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 11:56:52,180 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 11:56:52,180 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 11:56:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 11:56:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 11:56:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 11:56:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 11:56:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 11:56:52,182 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 11:56:52,182 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 11:56:52,182 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 11:56:52,183 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 11:56:52,183 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 11:56:52,183 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 11:56:52,183 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 11:56:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 11:56:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 11:56:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 11:56:52,185 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 11:56:52,185 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 11:56:52,185 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 11:56:52,186 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 11:56:52,186 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 11:56:52,186 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-02 11:56:52,187 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 11:56:52,187 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-02 11:56:52,188 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 11:56:52,188 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 11:56:52,188 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 11:56:52,189 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 11:56:52,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 11:56:52,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-02 11:56:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:56:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:56:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 11:56:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 11:56:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 11:56:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 11:56:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 11:56:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 11:56:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 11:56:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 11:56:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 11:56:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 11:56:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 11:56:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 11:56:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 11:56:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 11:56:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 11:56:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 11:56:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 11:56:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 11:56:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 11:56:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 11:56:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 11:56:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 11:56:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 11:56:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 11:56:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 11:56:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 11:56:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 11:56:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 11:56:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 11:56:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 11:56:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:56:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 11:56:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:56:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 11:56:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 11:56:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:56:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:56:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:56:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:56:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 11:56:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:56:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 11:56:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 11:56:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:56:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 11:56:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 11:56:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:56:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 11:56:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 11:56:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 11:56:52,206 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 11:56:52,206 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 11:56:52,206 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 11:56:52,206 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 11:56:52,206 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 11:56:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 11:56:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 11:56:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 11:56:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 11:56:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 11:56:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 11:56:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 11:56:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 11:56:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 11:56:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 11:56:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 11:56:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 11:56:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 11:56:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 11:56:52,222 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 11:56:52,222 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 11:56:52,222 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 11:56:52,222 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 11:56:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 11:56:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 11:56:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 11:56:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 11:56:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 11:56:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 11:56:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 11:56:52,224 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 11:56:52,224 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 11:56:52,224 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 11:56:52,224 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 11:56:52,224 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 11:56:52,224 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-02 11:56:52,224 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-02 11:56:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-02 11:56:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 11:56:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 11:56:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:56:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 11:56:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:56:54,718 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:56:54,719 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 11:56:54,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:56:54 BoogieIcfgContainer [2019-10-02 11:56:54,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:56:54,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:56:54,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:56:54,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:56:54,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:56:50" (1/3) ... [2019-10-02 11:56:54,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b70999f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:56:54, skipping insertion in model container [2019-10-02 11:56:54,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:51" (2/3) ... [2019-10-02 11:56:54,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b70999f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:56:54, skipping insertion in model container [2019-10-02 11:56:54,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:56:54" (3/3) ... [2019-10-02 11:56:54,730 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product32.cil.c [2019-10-02 11:56:54,740 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:56:54,753 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:56:54,771 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:56:54,818 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:56:54,819 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:56:54,820 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:56:54,820 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:56:54,820 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:56:54,820 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:56:54,820 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:56:54,820 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:56:54,820 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:56:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states. [2019-10-02 11:56:54,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 11:56:54,894 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:54,896 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:56:54,898 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:54,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:54,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1156947632, now seen corresponding path program 1 times [2019-10-02 11:56:54,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:54,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:54,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:54,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:54,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:56:55,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:55,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:56:55,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:56:55,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:56:55,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:56:55,477 INFO L87 Difference]: Start difference. First operand 798 states. Second operand 4 states. [2019-10-02 11:56:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:55,776 INFO L93 Difference]: Finished difference Result 1280 states and 2032 transitions. [2019-10-02 11:56:55,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:56:55,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-02 11:56:55,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:55,817 INFO L225 Difference]: With dead ends: 1280 [2019-10-02 11:56:55,817 INFO L226 Difference]: Without dead ends: 643 [2019-10-02 11:56:55,831 INFO L640 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-10-02 11:56:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-02 11:56:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-02 11:56:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-02 11:56:55,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1007 transitions. [2019-10-02 11:56:55,989 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1007 transitions. Word has length 87 [2019-10-02 11:56:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:55,990 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 1007 transitions. [2019-10-02 11:56:55,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:56:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1007 transitions. [2019-10-02 11:56:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 11:56:56,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:56,013 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:56:56,014 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:56,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:56,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1296609552, now seen corresponding path program 1 times [2019-10-02 11:56:56,014 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:56,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:56,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:56,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:56,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:56:56,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:56,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:56:56,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:56:56,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:56:56,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:56:56,282 INFO L87 Difference]: Start difference. First operand 643 states and 1007 transitions. Second operand 4 states. [2019-10-02 11:56:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:56,398 INFO L93 Difference]: Finished difference Result 1253 states and 1975 transitions. [2019-10-02 11:56:56,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:56:56,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-02 11:56:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:56,408 INFO L225 Difference]: With dead ends: 1253 [2019-10-02 11:56:56,408 INFO L226 Difference]: Without dead ends: 643 [2019-10-02 11:56:56,412 INFO L640 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-10-02 11:56:56,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-02 11:56:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-02 11:56:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-02 11:56:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1006 transitions. [2019-10-02 11:56:56,462 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1006 transitions. Word has length 88 [2019-10-02 11:56:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:56,463 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 1006 transitions. [2019-10-02 11:56:56,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:56:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1006 transitions. [2019-10-02 11:56:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 11:56:56,470 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:56,471 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:56:56,471 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:56,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:56,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1734809644, now seen corresponding path program 1 times [2019-10-02 11:56:56,471 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:56,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:56,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:56,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:56,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:56:56,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:56,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:56:56,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:56:56,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:56:56,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:56:56,593 INFO L87 Difference]: Start difference. First operand 643 states and 1006 transitions. Second operand 4 states. [2019-10-02 11:56:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:56,702 INFO L93 Difference]: Finished difference Result 1253 states and 1974 transitions. [2019-10-02 11:56:56,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:56:56,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-02 11:56:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:56,711 INFO L225 Difference]: With dead ends: 1253 [2019-10-02 11:56:56,711 INFO L226 Difference]: Without dead ends: 643 [2019-10-02 11:56:56,715 INFO L640 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-10-02 11:56:56,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-02 11:56:56,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-02 11:56:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-02 11:56:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1005 transitions. [2019-10-02 11:56:56,756 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1005 transitions. Word has length 89 [2019-10-02 11:56:56,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:56,756 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 1005 transitions. [2019-10-02 11:56:56,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:56:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1005 transitions. [2019-10-02 11:56:56,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 11:56:56,758 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:56,759 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:56:56,759 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:56,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:56,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1457208820, now seen corresponding path program 1 times [2019-10-02 11:56:56,759 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:56,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:56,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:56,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:56,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:56:56,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:56,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:56:56,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:56:56,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:56:56,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:56:56,964 INFO L87 Difference]: Start difference. First operand 643 states and 1005 transitions. Second operand 4 states. [2019-10-02 11:56:57,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:57,045 INFO L93 Difference]: Finished difference Result 1253 states and 1973 transitions. [2019-10-02 11:56:57,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:56:57,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-02 11:56:57,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:57,056 INFO L225 Difference]: With dead ends: 1253 [2019-10-02 11:56:57,059 INFO L226 Difference]: Without dead ends: 643 [2019-10-02 11:56:57,065 INFO L640 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-10-02 11:56:57,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-02 11:56:57,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-02 11:56:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-02 11:56:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1004 transitions. [2019-10-02 11:56:57,088 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1004 transitions. Word has length 90 [2019-10-02 11:56:57,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:57,088 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 1004 transitions. [2019-10-02 11:56:57,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:56:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1004 transitions. [2019-10-02 11:56:57,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 11:56:57,090 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:57,091 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:56:57,091 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:57,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:57,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1221885528, now seen corresponding path program 1 times [2019-10-02 11:56:57,091 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:57,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:57,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:57,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:57,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:56:57,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:57,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:56:57,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:56:57,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:56:57,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:56:57,232 INFO L87 Difference]: Start difference. First operand 643 states and 1004 transitions. Second operand 4 states. [2019-10-02 11:56:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:57,298 INFO L93 Difference]: Finished difference Result 1253 states and 1972 transitions. [2019-10-02 11:56:57,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:56:57,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-02 11:56:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:57,307 INFO L225 Difference]: With dead ends: 1253 [2019-10-02 11:56:57,308 INFO L226 Difference]: Without dead ends: 643 [2019-10-02 11:56:57,313 INFO L640 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-10-02 11:56:57,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-02 11:56:57,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-02 11:56:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-02 11:56:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1003 transitions. [2019-10-02 11:56:57,335 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1003 transitions. Word has length 91 [2019-10-02 11:56:57,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:57,335 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 1003 transitions. [2019-10-02 11:56:57,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:56:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1003 transitions. [2019-10-02 11:56:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 11:56:57,338 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:57,338 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:56:57,338 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:57,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:57,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2113150200, now seen corresponding path program 1 times [2019-10-02 11:56:57,340 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:57,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:57,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:57,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:57,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:56:57,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:57,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:56:57,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:56:57,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:56:57,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:56:57,530 INFO L87 Difference]: Start difference. First operand 643 states and 1003 transitions. Second operand 10 states. [2019-10-02 11:56:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:57,703 INFO L93 Difference]: Finished difference Result 1258 states and 1979 transitions. [2019-10-02 11:56:57,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:56:57,704 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-02 11:56:57,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:57,710 INFO L225 Difference]: With dead ends: 1258 [2019-10-02 11:56:57,710 INFO L226 Difference]: Without dead ends: 652 [2019-10-02 11:56:57,714 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:56:57,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-10-02 11:56:57,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 650. [2019-10-02 11:56:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-02 11:56:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1013 transitions. [2019-10-02 11:56:57,742 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1013 transitions. Word has length 92 [2019-10-02 11:56:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:57,743 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1013 transitions. [2019-10-02 11:56:57,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:56:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1013 transitions. [2019-10-02 11:56:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 11:56:57,746 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:57,747 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:56:57,747 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2012238233, now seen corresponding path program 1 times [2019-10-02 11:56:57,747 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:57,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:57,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:57,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:57,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:56:57,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:57,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:56:57,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:56:57,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:56:57,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:56:57,912 INFO L87 Difference]: Start difference. First operand 650 states and 1013 transitions. Second operand 4 states. [2019-10-02 11:56:57,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:57,971 INFO L93 Difference]: Finished difference Result 1259 states and 1980 transitions. [2019-10-02 11:56:57,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:56:57,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-02 11:56:57,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:57,977 INFO L225 Difference]: With dead ends: 1259 [2019-10-02 11:56:57,977 INFO L226 Difference]: Without dead ends: 646 [2019-10-02 11:56:57,981 INFO L640 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-10-02 11:56:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-10-02 11:56:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2019-10-02 11:56:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-10-02 11:56:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1006 transitions. [2019-10-02 11:56:58,003 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1006 transitions. Word has length 92 [2019-10-02 11:56:58,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:58,003 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 1006 transitions. [2019-10-02 11:56:58,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:56:58,004 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1006 transitions. [2019-10-02 11:56:58,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 11:56:58,005 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:58,006 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:56:58,006 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:58,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:58,006 INFO L82 PathProgramCache]: Analyzing trace with hash 852807042, now seen corresponding path program 1 times [2019-10-02 11:56:58,006 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:58,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:58,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:58,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:58,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:56:58,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:58,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:56:58,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:56:58,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:56:58,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:56:58,176 INFO L87 Difference]: Start difference. First operand 646 states and 1006 transitions. Second operand 6 states. [2019-10-02 11:56:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:58,550 INFO L93 Difference]: Finished difference Result 1272 states and 2004 transitions. [2019-10-02 11:56:58,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:56:58,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-02 11:56:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:58,556 INFO L225 Difference]: With dead ends: 1272 [2019-10-02 11:56:58,556 INFO L226 Difference]: Without dead ends: 654 [2019-10-02 11:56:58,560 INFO L640 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-10-02 11:56:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-10-02 11:56:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 651. [2019-10-02 11:56:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 11:56:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1007 transitions. [2019-10-02 11:56:58,584 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1007 transitions. Word has length 93 [2019-10-02 11:56:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:58,585 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1007 transitions. [2019-10-02 11:56:58,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:56:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1007 transitions. [2019-10-02 11:56:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 11:56:58,587 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:58,587 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:56:58,587 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:58,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:58,588 INFO L82 PathProgramCache]: Analyzing trace with hash -535079125, now seen corresponding path program 1 times [2019-10-02 11:56:58,588 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:58,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:58,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:58,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:58,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:56:58,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:58,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:56:58,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:56:58,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:56:58,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:56:58,712 INFO L87 Difference]: Start difference. First operand 651 states and 1007 transitions. Second operand 6 states. [2019-10-02 11:56:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:58,948 INFO L93 Difference]: Finished difference Result 1235 states and 1919 transitions. [2019-10-02 11:56:58,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:56:58,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-02 11:56:58,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:58,954 INFO L225 Difference]: With dead ends: 1235 [2019-10-02 11:56:58,954 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 11:56:58,958 INFO L640 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-10-02 11:56:58,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 11:56:58,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 11:56:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 11:56:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1003 transitions. [2019-10-02 11:56:59,027 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1003 transitions. Word has length 94 [2019-10-02 11:56:59,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:59,028 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1003 transitions. [2019-10-02 11:56:59,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:56:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1003 transitions. [2019-10-02 11:56:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 11:56:59,029 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:59,030 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:56:59,030 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:59,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:59,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1647609305, now seen corresponding path program 1 times [2019-10-02 11:56:59,031 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:59,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:59,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:56:59,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:59,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:56:59,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:56:59,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:56:59,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:56:59,144 INFO L87 Difference]: Start difference. First operand 651 states and 1003 transitions. Second operand 6 states. [2019-10-02 11:56:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:59,361 INFO L93 Difference]: Finished difference Result 1235 states and 1915 transitions. [2019-10-02 11:56:59,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:56:59,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-02 11:56:59,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:59,367 INFO L225 Difference]: With dead ends: 1235 [2019-10-02 11:56:59,367 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 11:56:59,370 INFO L640 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-10-02 11:56:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 11:56:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 11:56:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 11:56:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 999 transitions. [2019-10-02 11:56:59,402 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 999 transitions. Word has length 95 [2019-10-02 11:56:59,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:59,403 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 999 transitions. [2019-10-02 11:56:59,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:56:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 999 transitions. [2019-10-02 11:56:59,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 11:56:59,404 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:59,404 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:56:59,405 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:59,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:59,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1752053415, now seen corresponding path program 1 times [2019-10-02 11:56:59,405 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:59,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:59,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:59,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:59,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:56:59,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:59,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:56:59,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:56:59,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:56:59,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:56:59,536 INFO L87 Difference]: Start difference. First operand 651 states and 999 transitions. Second operand 7 states. [2019-10-02 11:56:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:59,638 INFO L93 Difference]: Finished difference Result 1238 states and 1915 transitions. [2019-10-02 11:56:59,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:56:59,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-02 11:56:59,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:59,644 INFO L225 Difference]: With dead ends: 1238 [2019-10-02 11:56:59,644 INFO L226 Difference]: Without dead ends: 633 [2019-10-02 11:56:59,650 INFO L640 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-10-02 11:56:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-02 11:56:59,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2019-10-02 11:56:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 11:56:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 962 transitions. [2019-10-02 11:56:59,677 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 962 transitions. Word has length 95 [2019-10-02 11:56:59,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:59,678 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 962 transitions. [2019-10-02 11:56:59,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:56:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 962 transitions. [2019-10-02 11:56:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 11:56:59,679 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:59,680 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:56:59,680 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:59,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:59,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1480928816, now seen corresponding path program 1 times [2019-10-02 11:56:59,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:59,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:59,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:59,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:59,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:56:59,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:59,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:56:59,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:56:59,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:56:59,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:56:59,799 INFO L87 Difference]: Start difference. First operand 630 states and 962 transitions. Second operand 6 states. [2019-10-02 11:56:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:59,927 INFO L93 Difference]: Finished difference Result 1214 states and 1874 transitions. [2019-10-02 11:56:59,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:56:59,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-02 11:56:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:59,933 INFO L225 Difference]: With dead ends: 1214 [2019-10-02 11:56:59,934 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 11:56:59,937 INFO L640 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-10-02 11:56:59,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 11:56:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-02 11:56:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 11:56:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 961 transitions. [2019-10-02 11:56:59,961 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 961 transitions. Word has length 96 [2019-10-02 11:56:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:59,962 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 961 transitions. [2019-10-02 11:56:59,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:56:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 961 transitions. [2019-10-02 11:56:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 11:56:59,963 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:59,963 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:56:59,964 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:59,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:59,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1356369204, now seen corresponding path program 1 times [2019-10-02 11:56:59,964 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:59,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:59,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:59,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:59,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:57:00,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:00,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:57:00,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:57:00,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:57:00,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:00,122 INFO L87 Difference]: Start difference. First operand 630 states and 961 transitions. Second operand 6 states. [2019-10-02 11:57:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:00,259 INFO L93 Difference]: Finished difference Result 1214 states and 1873 transitions. [2019-10-02 11:57:00,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:57:00,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-02 11:57:00,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:00,265 INFO L225 Difference]: With dead ends: 1214 [2019-10-02 11:57:00,265 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 11:57:00,270 INFO L640 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-10-02 11:57:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 11:57:00,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-02 11:57:00,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 11:57:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 960 transitions. [2019-10-02 11:57:00,296 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 960 transitions. Word has length 97 [2019-10-02 11:57:00,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:00,297 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 960 transitions. [2019-10-02 11:57:00,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:57:00,297 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 960 transitions. [2019-10-02 11:57:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 11:57:00,299 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:00,299 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:00,300 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:00,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:00,300 INFO L82 PathProgramCache]: Analyzing trace with hash -156026571, now seen corresponding path program 1 times [2019-10-02 11:57:00,300 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:00,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:00,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:00,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:00,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:57:00,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:00,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 11:57:00,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:57:00,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:57:00,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:57:00,516 INFO L87 Difference]: Start difference. First operand 630 states and 960 transitions. Second operand 12 states. [2019-10-02 11:57:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:00,793 INFO L93 Difference]: Finished difference Result 1220 states and 1883 transitions. [2019-10-02 11:57:00,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:57:00,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-02 11:57:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:00,800 INFO L225 Difference]: With dead ends: 1220 [2019-10-02 11:57:00,800 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 11:57:00,804 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:57:00,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 11:57:00,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2019-10-02 11:57:00,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-02 11:57:00,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 966 transitions. [2019-10-02 11:57:00,828 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 966 transitions. Word has length 98 [2019-10-02 11:57:00,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:00,830 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 966 transitions. [2019-10-02 11:57:00,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:57:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 966 transitions. [2019-10-02 11:57:00,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 11:57:00,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:00,832 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:00,832 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:00,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:00,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1563321933, now seen corresponding path program 1 times [2019-10-02 11:57:00,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:00,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:00,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:00,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:00,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:57:00,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:00,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:57:00,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:57:00,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:57:00,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:57:00,993 INFO L87 Difference]: Start difference. First operand 635 states and 966 transitions. Second operand 9 states. [2019-10-02 11:57:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:06,823 INFO L93 Difference]: Finished difference Result 1846 states and 2913 transitions. [2019-10-02 11:57:06,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:57:06,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-10-02 11:57:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:06,834 INFO L225 Difference]: With dead ends: 1846 [2019-10-02 11:57:06,834 INFO L226 Difference]: Without dead ends: 1264 [2019-10-02 11:57:06,838 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:57:06,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2019-10-02 11:57:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1240. [2019-10-02 11:57:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2019-10-02 11:57:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1948 transitions. [2019-10-02 11:57:06,897 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1948 transitions. Word has length 99 [2019-10-02 11:57:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:06,897 INFO L475 AbstractCegarLoop]: Abstraction has 1240 states and 1948 transitions. [2019-10-02 11:57:06,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:57:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1948 transitions. [2019-10-02 11:57:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 11:57:06,899 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:06,899 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:06,900 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:06,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:06,900 INFO L82 PathProgramCache]: Analyzing trace with hash -202638925, now seen corresponding path program 1 times [2019-10-02 11:57:06,900 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:06,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:06,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:57:07,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:07,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:57:07,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:57:07,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:57:07,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:07,015 INFO L87 Difference]: Start difference. First operand 1240 states and 1948 transitions. Second operand 6 states. [2019-10-02 11:57:07,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:07,692 INFO L93 Difference]: Finished difference Result 2445 states and 3942 transitions. [2019-10-02 11:57:07,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:57:07,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-10-02 11:57:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:07,703 INFO L225 Difference]: With dead ends: 2445 [2019-10-02 11:57:07,703 INFO L226 Difference]: Without dead ends: 1258 [2019-10-02 11:57:07,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:57:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-10-02 11:57:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-10-02 11:57:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-10-02 11:57:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1968 transitions. [2019-10-02 11:57:07,766 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1968 transitions. Word has length 100 [2019-10-02 11:57:07,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:07,767 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1968 transitions. [2019-10-02 11:57:07,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:57:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1968 transitions. [2019-10-02 11:57:07,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 11:57:07,769 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:07,769 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:07,769 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:07,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:07,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1419649865, now seen corresponding path program 1 times [2019-10-02 11:57:07,770 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:07,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:07,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:07,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:07,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:57:07,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:07,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:57:07,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:57:07,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:57:07,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:57:07,928 INFO L87 Difference]: Start difference. First operand 1256 states and 1968 transitions. Second operand 9 states. [2019-10-02 11:57:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:14,860 INFO L93 Difference]: Finished difference Result 3904 states and 6289 transitions. [2019-10-02 11:57:14,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:57:14,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-10-02 11:57:14,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:14,891 INFO L225 Difference]: With dead ends: 3904 [2019-10-02 11:57:14,892 INFO L226 Difference]: Without dead ends: 2701 [2019-10-02 11:57:14,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:57:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2019-10-02 11:57:15,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2646. [2019-10-02 11:57:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2646 states. [2019-10-02 11:57:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 4241 transitions. [2019-10-02 11:57:15,131 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 4241 transitions. Word has length 101 [2019-10-02 11:57:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:15,132 INFO L475 AbstractCegarLoop]: Abstraction has 2646 states and 4241 transitions. [2019-10-02 11:57:15,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:57:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 4241 transitions. [2019-10-02 11:57:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 11:57:15,137 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:15,137 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:15,138 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:15,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:15,138 INFO L82 PathProgramCache]: Analyzing trace with hash -940794569, now seen corresponding path program 1 times [2019-10-02 11:57:15,138 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:15,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:15,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:15,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:15,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:57:15,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:15,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:57:15,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:57:15,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:57:15,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:57:15,386 INFO L87 Difference]: Start difference. First operand 2646 states and 4241 transitions. Second operand 9 states. [2019-10-02 11:57:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:22,100 INFO L93 Difference]: Finished difference Result 7476 states and 12248 transitions. [2019-10-02 11:57:22,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:57:22,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-10-02 11:57:22,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:22,137 INFO L225 Difference]: With dead ends: 7476 [2019-10-02 11:57:22,137 INFO L226 Difference]: Without dead ends: 4889 [2019-10-02 11:57:22,152 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:57:22,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4889 states. [2019-10-02 11:57:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4889 to 4764. [2019-10-02 11:57:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4764 states. [2019-10-02 11:57:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4764 states to 4764 states and 7713 transitions. [2019-10-02 11:57:22,462 INFO L78 Accepts]: Start accepts. Automaton has 4764 states and 7713 transitions. Word has length 102 [2019-10-02 11:57:22,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:22,462 INFO L475 AbstractCegarLoop]: Abstraction has 4764 states and 7713 transitions. [2019-10-02 11:57:22,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:57:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4764 states and 7713 transitions. [2019-10-02 11:57:22,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 11:57:22,466 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:22,466 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:22,467 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:22,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:22,467 INFO L82 PathProgramCache]: Analyzing trace with hash 865847124, now seen corresponding path program 1 times [2019-10-02 11:57:22,467 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:22,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:22,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:22,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:22,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:57:22,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:22,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:57:22,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:57:22,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:57:22,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:57:22,627 INFO L87 Difference]: Start difference. First operand 4764 states and 7713 transitions. Second operand 9 states. [2019-10-02 11:57:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:22,899 INFO L93 Difference]: Finished difference Result 7226 states and 11678 transitions. [2019-10-02 11:57:22,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:57:22,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-10-02 11:57:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:22,923 INFO L225 Difference]: With dead ends: 7226 [2019-10-02 11:57:22,923 INFO L226 Difference]: Without dead ends: 2509 [2019-10-02 11:57:22,963 INFO L640 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-10-02 11:57:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2019-10-02 11:57:23,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2507. [2019-10-02 11:57:23,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-10-02 11:57:23,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 4008 transitions. [2019-10-02 11:57:23,139 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 4008 transitions. Word has length 102 [2019-10-02 11:57:23,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:23,140 INFO L475 AbstractCegarLoop]: Abstraction has 2507 states and 4008 transitions. [2019-10-02 11:57:23,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:57:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4008 transitions. [2019-10-02 11:57:23,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-02 11:57:23,144 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:23,144 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:23,144 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:23,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:23,145 INFO L82 PathProgramCache]: Analyzing trace with hash 570306491, now seen corresponding path program 1 times [2019-10-02 11:57:23,145 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:23,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:23,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:23,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:23,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:57:23,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:23,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:57:23,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:57:23,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:57:23,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:57:23,487 INFO L87 Difference]: Start difference. First operand 2507 states and 4008 transitions. Second operand 9 states. [2019-10-02 11:57:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:29,290 INFO L93 Difference]: Finished difference Result 5637 states and 9158 transitions. [2019-10-02 11:57:29,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:57:29,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-10-02 11:57:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:29,307 INFO L225 Difference]: With dead ends: 5637 [2019-10-02 11:57:29,307 INFO L226 Difference]: Without dead ends: 2327 [2019-10-02 11:57:29,318 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:57:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2019-10-02 11:57:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2262. [2019-10-02 11:57:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2019-10-02 11:57:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 3585 transitions. [2019-10-02 11:57:29,432 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 3585 transitions. Word has length 103 [2019-10-02 11:57:29,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:29,432 INFO L475 AbstractCegarLoop]: Abstraction has 2262 states and 3585 transitions. [2019-10-02 11:57:29,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:57:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 3585 transitions. [2019-10-02 11:57:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 11:57:29,440 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:29,440 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:29,440 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:29,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1759855622, now seen corresponding path program 1 times [2019-10-02 11:57:29,441 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:29,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:29,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:29,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:29,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-02 11:57:29,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:29,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:57:29,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:57:29,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:57:29,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:57:29,633 INFO L87 Difference]: Start difference. First operand 2262 states and 3585 transitions. Second operand 7 states. [2019-10-02 11:57:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:29,757 INFO L93 Difference]: Finished difference Result 3939 states and 6269 transitions. [2019-10-02 11:57:29,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:57:29,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 216 [2019-10-02 11:57:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:29,771 INFO L225 Difference]: With dead ends: 3939 [2019-10-02 11:57:29,772 INFO L226 Difference]: Without dead ends: 2260 [2019-10-02 11:57:29,777 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:57:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2019-10-02 11:57:29,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 2260. [2019-10-02 11:57:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2019-10-02 11:57:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 3578 transitions. [2019-10-02 11:57:29,875 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 3578 transitions. Word has length 216 [2019-10-02 11:57:29,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:29,876 INFO L475 AbstractCegarLoop]: Abstraction has 2260 states and 3578 transitions. [2019-10-02 11:57:29,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:57:29,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 3578 transitions. [2019-10-02 11:57:29,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 11:57:29,883 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:29,883 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:29,883 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:29,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:29,884 INFO L82 PathProgramCache]: Analyzing trace with hash -856683070, now seen corresponding path program 1 times [2019-10-02 11:57:29,884 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:29,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:29,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:29,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:29,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-02 11:57:30,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:30,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:57:30,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:57:30,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:57:30,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:57:30,150 INFO L87 Difference]: Start difference. First operand 2260 states and 3578 transitions. Second operand 7 states. [2019-10-02 11:57:30,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:30,276 INFO L93 Difference]: Finished difference Result 3938 states and 6266 transitions. [2019-10-02 11:57:30,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:57:30,277 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 217 [2019-10-02 11:57:30,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:30,307 INFO L225 Difference]: With dead ends: 3938 [2019-10-02 11:57:30,308 INFO L226 Difference]: Without dead ends: 2259 [2019-10-02 11:57:30,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:57:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2019-10-02 11:57:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 2259. [2019-10-02 11:57:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2259 states. [2019-10-02 11:57:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 3576 transitions. [2019-10-02 11:57:30,418 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 3576 transitions. Word has length 217 [2019-10-02 11:57:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:30,418 INFO L475 AbstractCegarLoop]: Abstraction has 2259 states and 3576 transitions. [2019-10-02 11:57:30,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:57:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3576 transitions. [2019-10-02 11:57:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 11:57:30,431 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:30,432 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:30,432 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:30,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:30,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1147814942, now seen corresponding path program 1 times [2019-10-02 11:57:30,433 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:30,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:30,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:30,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-02 11:57:30,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:30,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:57:30,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:57:30,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:57:30,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:57:30,615 INFO L87 Difference]: Start difference. First operand 2259 states and 3576 transitions. Second operand 7 states. [2019-10-02 11:57:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:30,734 INFO L93 Difference]: Finished difference Result 3937 states and 6264 transitions. [2019-10-02 11:57:30,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:57:30,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 218 [2019-10-02 11:57:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:30,748 INFO L225 Difference]: With dead ends: 3937 [2019-10-02 11:57:30,748 INFO L226 Difference]: Without dead ends: 2258 [2019-10-02 11:57:30,755 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:57:30,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-10-02 11:57:30,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2258. [2019-10-02 11:57:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2019-10-02 11:57:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3574 transitions. [2019-10-02 11:57:30,850 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3574 transitions. Word has length 218 [2019-10-02 11:57:30,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:30,851 INFO L475 AbstractCegarLoop]: Abstraction has 2258 states and 3574 transitions. [2019-10-02 11:57:30,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:57:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3574 transitions. [2019-10-02 11:57:30,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 11:57:30,858 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:30,859 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:30,859 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:30,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:30,860 INFO L82 PathProgramCache]: Analyzing trace with hash 941954753, now seen corresponding path program 1 times [2019-10-02 11:57:30,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:30,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:30,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:30,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:30,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-02 11:57:31,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:31,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:57:31,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:57:31,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:57:31,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:57:31,047 INFO L87 Difference]: Start difference. First operand 2258 states and 3574 transitions. Second operand 7 states. [2019-10-02 11:57:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:31,172 INFO L93 Difference]: Finished difference Result 3936 states and 6262 transitions. [2019-10-02 11:57:31,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:57:31,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 218 [2019-10-02 11:57:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:31,185 INFO L225 Difference]: With dead ends: 3936 [2019-10-02 11:57:31,186 INFO L226 Difference]: Without dead ends: 2258 [2019-10-02 11:57:31,192 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:57:31,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-10-02 11:57:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2258. [2019-10-02 11:57:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2019-10-02 11:57:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3573 transitions. [2019-10-02 11:57:31,283 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3573 transitions. Word has length 218 [2019-10-02 11:57:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:31,283 INFO L475 AbstractCegarLoop]: Abstraction has 2258 states and 3573 transitions. [2019-10-02 11:57:31,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:57:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3573 transitions. [2019-10-02 11:57:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 11:57:31,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:31,291 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:31,291 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:31,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:31,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1929187870, now seen corresponding path program 1 times [2019-10-02 11:57:31,291 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:31,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:31,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:31,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:31,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-02 11:57:31,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:31,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:57:31,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:57:31,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:57:31,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:57:31,487 INFO L87 Difference]: Start difference. First operand 2258 states and 3573 transitions. Second operand 5 states. [2019-10-02 11:57:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:31,565 INFO L93 Difference]: Finished difference Result 2261 states and 3575 transitions. [2019-10-02 11:57:31,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:57:31,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-10-02 11:57:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:31,574 INFO L225 Difference]: With dead ends: 2261 [2019-10-02 11:57:31,575 INFO L226 Difference]: Without dead ends: 1698 [2019-10-02 11:57:31,577 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-10-02 11:57:31,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1698. [2019-10-02 11:57:31,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1698 states. [2019-10-02 11:57:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2676 transitions. [2019-10-02 11:57:31,709 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2676 transitions. Word has length 219 [2019-10-02 11:57:31,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:31,709 INFO L475 AbstractCegarLoop]: Abstraction has 1698 states and 2676 transitions. [2019-10-02 11:57:31,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:57:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2676 transitions. [2019-10-02 11:57:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 11:57:31,716 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:31,717 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:31,717 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:31,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:31,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1807490018, now seen corresponding path program 1 times [2019-10-02 11:57:31,718 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:31,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:31,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:31,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:31,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-02 11:57:31,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:31,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:57:31,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:57:31,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:57:31,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:57:31,879 INFO L87 Difference]: Start difference. First operand 1698 states and 2676 transitions. Second operand 5 states. [2019-10-02 11:57:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:31,950 INFO L93 Difference]: Finished difference Result 1701 states and 2678 transitions. [2019-10-02 11:57:31,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:57:31,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 221 [2019-10-02 11:57:31,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:31,956 INFO L225 Difference]: With dead ends: 1701 [2019-10-02 11:57:31,956 INFO L226 Difference]: Without dead ends: 1138 [2019-10-02 11:57:31,958 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2019-10-02 11:57:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2019-10-02 11:57:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-10-02 11:57:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1779 transitions. [2019-10-02 11:57:32,004 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1779 transitions. Word has length 221 [2019-10-02 11:57:32,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:32,004 INFO L475 AbstractCegarLoop]: Abstraction has 1138 states and 1779 transitions. [2019-10-02 11:57:32,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:57:32,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1779 transitions. [2019-10-02 11:57:32,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-02 11:57:32,010 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:32,011 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:32,011 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:32,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:32,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1544231911, now seen corresponding path program 1 times [2019-10-02 11:57:32,011 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:32,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:32,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:32,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-10-02 11:57:32,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:32,238 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:57:32,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:33,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 3891 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 11:57:33,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 96 proven. 50 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 11:57:33,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:57:33,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-10-02 11:57:33,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:57:33,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:57:33,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:57:33,319 INFO L87 Difference]: Start difference. First operand 1138 states and 1779 transitions. Second operand 12 states. [2019-10-02 11:57:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:46,611 INFO L93 Difference]: Finished difference Result 4721 states and 7682 transitions. [2019-10-02 11:57:46,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 11:57:46,611 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 223 [2019-10-02 11:57:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:46,641 INFO L225 Difference]: With dead ends: 4721 [2019-10-02 11:57:46,642 INFO L226 Difference]: Without dead ends: 3641 [2019-10-02 11:57:46,651 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2019-10-02 11:57:46,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2019-10-02 11:57:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 3431. [2019-10-02 11:57:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3431 states. [2019-10-02 11:57:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 5478 transitions. [2019-10-02 11:57:46,903 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 5478 transitions. Word has length 223 [2019-10-02 11:57:46,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:46,904 INFO L475 AbstractCegarLoop]: Abstraction has 3431 states and 5478 transitions. [2019-10-02 11:57:46,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:57:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 5478 transitions. [2019-10-02 11:57:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2019-10-02 11:57:46,987 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:46,988 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 10, 9, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:46,988 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:46,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:46,989 INFO L82 PathProgramCache]: Analyzing trace with hash 218405495, now seen corresponding path program 1 times [2019-10-02 11:57:46,989 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:46,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:46,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:46,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:46,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1222 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 1168 trivial. 0 not checked. [2019-10-02 11:57:47,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:47,540 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:57:47,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:48,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 5419 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 11:57:48,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1222 backedges. 543 proven. 20 refuted. 0 times theorem prover too weak. 659 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 11:57:49,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:57:49,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-10-02 11:57:49,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 11:57:49,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 11:57:49,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:57:49,025 INFO L87 Difference]: Start difference. First operand 3431 states and 5478 transitions. Second operand 18 states. [2019-10-02 11:58:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:02,040 INFO L93 Difference]: Finished difference Result 9137 states and 14348 transitions. [2019-10-02 11:58:02,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 11:58:02,040 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 483 [2019-10-02 11:58:02,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:02,069 INFO L225 Difference]: With dead ends: 9137 [2019-10-02 11:58:02,070 INFO L226 Difference]: Without dead ends: 5756 [2019-10-02 11:58:02,081 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 11:58:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5756 states. [2019-10-02 11:58:02,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5756 to 5582. [2019-10-02 11:58:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5582 states. [2019-10-02 11:58:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5582 states to 5582 states and 8557 transitions. [2019-10-02 11:58:02,434 INFO L78 Accepts]: Start accepts. Automaton has 5582 states and 8557 transitions. Word has length 483 [2019-10-02 11:58:02,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:02,434 INFO L475 AbstractCegarLoop]: Abstraction has 5582 states and 8557 transitions. [2019-10-02 11:58:02,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 11:58:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 5582 states and 8557 transitions. [2019-10-02 11:58:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2019-10-02 11:58:02,459 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:02,461 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:58:02,461 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:02,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:02,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382649, now seen corresponding path program 1 times [2019-10-02 11:58:02,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:02,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:02,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:02,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:02,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 30 proven. 101 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2019-10-02 11:58:03,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:03,239 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:58:03,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:04,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 6511 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 11:58:04,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:04,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 649 proven. 0 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2019-10-02 11:58:04,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:04,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 11:58:04,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:58:04,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:58:04,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:58:04,523 INFO L87 Difference]: Start difference. First operand 5582 states and 8557 transitions. Second operand 12 states. [2019-10-02 11:58:12,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:12,303 INFO L93 Difference]: Finished difference Result 14484 states and 22763 transitions. [2019-10-02 11:58:12,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:58:12,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 593 [2019-10-02 11:58:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:12,349 INFO L225 Difference]: With dead ends: 14484 [2019-10-02 11:58:12,349 INFO L226 Difference]: Without dead ends: 8960 [2019-10-02 11:58:12,371 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 611 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-10-02 11:58:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8960 states. [2019-10-02 11:58:12,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8960 to 8798. [2019-10-02 11:58:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8798 states. [2019-10-02 11:58:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8798 states to 8798 states and 13635 transitions. [2019-10-02 11:58:12,918 INFO L78 Accepts]: Start accepts. Automaton has 8798 states and 13635 transitions. Word has length 593 [2019-10-02 11:58:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:12,919 INFO L475 AbstractCegarLoop]: Abstraction has 8798 states and 13635 transitions. [2019-10-02 11:58:12,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:58:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 8798 states and 13635 transitions. [2019-10-02 11:58:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-10-02 11:58:12,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:12,958 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:58:12,958 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:12,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:12,959 INFO L82 PathProgramCache]: Analyzing trace with hash 2019413648, now seen corresponding path program 1 times [2019-10-02 11:58:12,959 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:12,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:12,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:12,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:12,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 30 proven. 101 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2019-10-02 11:58:13,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:13,911 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:58:14,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:15,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 6326 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:58:15,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 997 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:58:15,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:15,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2019-10-02 11:58:15,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:58:15,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:58:15,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:58:15,414 INFO L87 Difference]: Start difference. First operand 8798 states and 13635 transitions. Second operand 13 states. [2019-10-02 11:58:25,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:25,295 INFO L93 Difference]: Finished difference Result 17955 states and 28462 transitions. [2019-10-02 11:58:25,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 11:58:25,299 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 566 [2019-10-02 11:58:25,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:25,342 INFO L225 Difference]: With dead ends: 17955 [2019-10-02 11:58:25,342 INFO L226 Difference]: Without dead ends: 9215 [2019-10-02 11:58:25,371 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 587 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2019-10-02 11:58:25,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9215 states. [2019-10-02 11:58:25,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9215 to 8924. [2019-10-02 11:58:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8924 states. [2019-10-02 11:58:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8924 states to 8924 states and 13872 transitions. [2019-10-02 11:58:25,879 INFO L78 Accepts]: Start accepts. Automaton has 8924 states and 13872 transitions. Word has length 566 [2019-10-02 11:58:25,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:25,880 INFO L475 AbstractCegarLoop]: Abstraction has 8924 states and 13872 transitions. [2019-10-02 11:58:25,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:58:25,880 INFO L276 IsEmpty]: Start isEmpty. Operand 8924 states and 13872 transitions. [2019-10-02 11:58:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-10-02 11:58:25,914 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:25,919 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:58:25,919 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:25,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:25,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1888684122, now seen corresponding path program 1 times [2019-10-02 11:58:25,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:25,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:25,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:25,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:25,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1464 backedges. 38 proven. 113 refuted. 0 times theorem prover too weak. 1313 trivial. 0 not checked. [2019-10-02 11:58:26,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:26,652 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:58:26,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:27,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 6443 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:58:27,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1464 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-02 11:58:28,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:28,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2019-10-02 11:58:28,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:58:28,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:58:28,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:58:28,139 INFO L87 Difference]: Start difference. First operand 8924 states and 13872 transitions. Second operand 7 states. [2019-10-02 11:58:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:29,526 INFO L93 Difference]: Finished difference Result 18162 states and 29107 transitions. [2019-10-02 11:58:29,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:58:29,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 608 [2019-10-02 11:58:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:29,575 INFO L225 Difference]: With dead ends: 18162 [2019-10-02 11:58:29,575 INFO L226 Difference]: Without dead ends: 9276 [2019-10-02 11:58:29,612 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 608 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:58:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9276 states. [2019-10-02 11:58:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9276 to 9256. [2019-10-02 11:58:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9256 states. [2019-10-02 11:58:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9256 states to 9256 states and 14287 transitions. [2019-10-02 11:58:30,071 INFO L78 Accepts]: Start accepts. Automaton has 9256 states and 14287 transitions. Word has length 608 [2019-10-02 11:58:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:30,072 INFO L475 AbstractCegarLoop]: Abstraction has 9256 states and 14287 transitions. [2019-10-02 11:58:30,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:58:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 9256 states and 14287 transitions. [2019-10-02 11:58:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2019-10-02 11:58:30,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:30,119 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:58:30,119 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:30,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:30,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1309400730, now seen corresponding path program 1 times [2019-10-02 11:58:30,120 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:30,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:30,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:30,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:30,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 44 proven. 112 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2019-10-02 11:58:30,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:30,855 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:58:30,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:31,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 6461 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:58:31,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 566 proven. 0 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2019-10-02 11:58:32,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:32,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:58:32,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:58:32,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:58:32,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:58:32,170 INFO L87 Difference]: Start difference. First operand 9256 states and 14287 transitions. Second operand 6 states. [2019-10-02 11:58:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:32,794 INFO L93 Difference]: Finished difference Result 18601 states and 29120 transitions. [2019-10-02 11:58:32,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:58:32,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 626 [2019-10-02 11:58:32,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:32,837 INFO L225 Difference]: With dead ends: 18601 [2019-10-02 11:58:32,837 INFO L226 Difference]: Without dead ends: 9400 [2019-10-02 11:58:32,874 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:58:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9400 states. [2019-10-02 11:58:34,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9400 to 9400. [2019-10-02 11:58:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9400 states. [2019-10-02 11:58:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9400 states to 9400 states and 14335 transitions. [2019-10-02 11:58:34,261 INFO L78 Accepts]: Start accepts. Automaton has 9400 states and 14335 transitions. Word has length 626 [2019-10-02 11:58:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:34,262 INFO L475 AbstractCegarLoop]: Abstraction has 9400 states and 14335 transitions. [2019-10-02 11:58:34,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:58:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 9400 states and 14335 transitions. [2019-10-02 11:58:34,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2019-10-02 11:58:34,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:34,291 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:58:34,291 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:34,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:34,291 INFO L82 PathProgramCache]: Analyzing trace with hash -20204127, now seen corresponding path program 1 times [2019-10-02 11:58:34,292 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:34,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:34,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:34,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:34,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 51 proven. 107 refuted. 0 times theorem prover too weak. 1429 trivial. 0 not checked. [2019-10-02 11:58:34,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:34,832 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:58:35,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:35,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 6470 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:58:35,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 934 trivial. 0 not checked. [2019-10-02 11:58:36,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:36,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:58:36,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:58:36,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:58:36,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:58:36,190 INFO L87 Difference]: Start difference. First operand 9400 states and 14335 transitions. Second operand 6 states. [2019-10-02 11:58:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:36,786 INFO L93 Difference]: Finished difference Result 18907 states and 29248 transitions. [2019-10-02 11:58:36,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:58:36,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 635 [2019-10-02 11:58:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:36,822 INFO L225 Difference]: With dead ends: 18907 [2019-10-02 11:58:36,823 INFO L226 Difference]: Without dead ends: 9574 [2019-10-02 11:58:36,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 636 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:58:36,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9574 states. [2019-10-02 11:58:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9574 to 9574. [2019-10-02 11:58:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9574 states. [2019-10-02 11:58:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9574 states to 9574 states and 14533 transitions. [2019-10-02 11:58:37,258 INFO L78 Accepts]: Start accepts. Automaton has 9574 states and 14533 transitions. Word has length 635 [2019-10-02 11:58:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:37,259 INFO L475 AbstractCegarLoop]: Abstraction has 9574 states and 14533 transitions. [2019-10-02 11:58:37,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:58:37,259 INFO L276 IsEmpty]: Start isEmpty. Operand 9574 states and 14533 transitions. [2019-10-02 11:58:37,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-10-02 11:58:37,279 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:37,279 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 12, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:58:37,280 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:37,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:37,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1516654317, now seen corresponding path program 1 times [2019-10-02 11:58:37,280 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:37,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:37,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:37,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:37,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 42 proven. 152 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2019-10-02 11:58:37,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:37,813 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:58:37,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:38,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 6458 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:58:39,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 995 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:58:39,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:39,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-10-02 11:58:39,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:58:39,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:58:39,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:58:39,413 INFO L87 Difference]: Start difference. First operand 9574 states and 14533 transitions. Second operand 11 states. [2019-10-02 11:58:51,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:51,291 INFO L93 Difference]: Finished difference Result 31763 states and 50214 transitions. [2019-10-02 11:58:51,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 11:58:51,292 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 641 [2019-10-02 11:58:51,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:51,372 INFO L225 Difference]: With dead ends: 31763 [2019-10-02 11:58:51,372 INFO L226 Difference]: Without dead ends: 21143 [2019-10-02 11:58:51,419 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 665 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 11:58:51,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21143 states. [2019-10-02 11:58:52,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21143 to 20459. [2019-10-02 11:58:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20459 states. [2019-10-02 11:58:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20459 states to 20459 states and 31235 transitions. [2019-10-02 11:58:52,270 INFO L78 Accepts]: Start accepts. Automaton has 20459 states and 31235 transitions. Word has length 641 [2019-10-02 11:58:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:52,271 INFO L475 AbstractCegarLoop]: Abstraction has 20459 states and 31235 transitions. [2019-10-02 11:58:52,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:58:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 20459 states and 31235 transitions. [2019-10-02 11:58:52,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2019-10-02 11:58:52,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:52,288 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:58:52,288 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:52,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:52,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1910276954, now seen corresponding path program 1 times [2019-10-02 11:58:52,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:52,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:52,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:52,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:52,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 59 proven. 101 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2019-10-02 11:58:52,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:52,861 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:58:52,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:53,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 6669 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:58:53,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 725 proven. 0 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2019-10-02 11:58:54,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:54,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 11:58:54,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:58:54,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:58:54,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:58:54,127 INFO L87 Difference]: Start difference. First operand 20459 states and 31235 transitions. Second operand 8 states. [2019-10-02 11:58:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:55,045 INFO L93 Difference]: Finished difference Result 41220 states and 63845 transitions. [2019-10-02 11:58:55,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:58:55,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 676 [2019-10-02 11:58:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:55,117 INFO L225 Difference]: With dead ends: 41220 [2019-10-02 11:58:55,118 INFO L226 Difference]: Without dead ends: 20828 [2019-10-02 11:58:55,161 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 679 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:58:55,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20828 states. [2019-10-02 11:58:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20828 to 20828. [2019-10-02 11:58:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20828 states. [2019-10-02 11:58:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20828 states to 20828 states and 31625 transitions. [2019-10-02 11:58:56,207 INFO L78 Accepts]: Start accepts. Automaton has 20828 states and 31625 transitions. Word has length 676 [2019-10-02 11:58:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:56,208 INFO L475 AbstractCegarLoop]: Abstraction has 20828 states and 31625 transitions. [2019-10-02 11:58:56,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:58:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 20828 states and 31625 transitions. [2019-10-02 11:58:56,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2019-10-02 11:58:56,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:56,229 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:58:56,229 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:56,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:56,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1800709853, now seen corresponding path program 1 times [2019-10-02 11:58:56,230 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:56,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:56,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:56,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:56,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 30 proven. 58 refuted. 0 times theorem prover too weak. 1525 trivial. 0 not checked. [2019-10-02 11:58:56,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:56,939 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:58:57,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:57,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 6671 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:58:57,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2019-10-02 11:58:58,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:58,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-02 11:58:58,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:58:58,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:58:58,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:58:58,226 INFO L87 Difference]: Start difference. First operand 20828 states and 31625 transitions. Second operand 7 states. [2019-10-02 11:59:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:07,072 INFO L93 Difference]: Finished difference Result 69491 states and 113300 transitions. [2019-10-02 11:59:07,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:59:07,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 678 [2019-10-02 11:59:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:07,335 INFO L225 Difference]: With dead ends: 69491 [2019-10-02 11:59:07,336 INFO L226 Difference]: Without dead ends: 48664 [2019-10-02 11:59:07,424 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 707 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:59:07,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48664 states. [2019-10-02 11:59:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48664 to 46963. [2019-10-02 11:59:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46963 states. [2019-10-02 11:59:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46963 states to 46963 states and 73937 transitions. [2019-10-02 11:59:11,011 INFO L78 Accepts]: Start accepts. Automaton has 46963 states and 73937 transitions. Word has length 678 [2019-10-02 11:59:11,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:11,012 INFO L475 AbstractCegarLoop]: Abstraction has 46963 states and 73937 transitions. [2019-10-02 11:59:11,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:59:11,012 INFO L276 IsEmpty]: Start isEmpty. Operand 46963 states and 73937 transitions. [2019-10-02 11:59:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2019-10-02 11:59:11,036 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:11,037 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:59:11,037 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:11,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:11,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1255937632, now seen corresponding path program 1 times [2019-10-02 11:59:11,038 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:11,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:11,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:11,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:11,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1523 trivial. 0 not checked. [2019-10-02 11:59:11,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:59:11,501 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:59:11,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:12,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 6677 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:59:12,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:59:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 767 proven. 0 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2019-10-02 11:59:13,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:59:13,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-02 11:59:13,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:59:13,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:59:13,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:59:13,153 INFO L87 Difference]: Start difference. First operand 46963 states and 73937 transitions. Second operand 7 states. [2019-10-02 11:59:24,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:24,394 INFO L93 Difference]: Finished difference Result 176614 states and 328970 transitions. [2019-10-02 11:59:24,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:59:24,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 684 [2019-10-02 11:59:24,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:25,063 INFO L225 Difference]: With dead ends: 176614 [2019-10-02 11:59:25,063 INFO L226 Difference]: Without dead ends: 129542 [2019-10-02 11:59:25,266 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:59:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129542 states. [2019-10-02 11:59:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129542 to 125057. [2019-10-02 11:59:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125057 states. [2019-10-02 11:59:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125057 states to 125057 states and 217457 transitions. [2019-10-02 11:59:34,625 INFO L78 Accepts]: Start accepts. Automaton has 125057 states and 217457 transitions. Word has length 684 [2019-10-02 11:59:34,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:34,626 INFO L475 AbstractCegarLoop]: Abstraction has 125057 states and 217457 transitions. [2019-10-02 11:59:34,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:59:34,626 INFO L276 IsEmpty]: Start isEmpty. Operand 125057 states and 217457 transitions. [2019-10-02 11:59:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2019-10-02 11:59:34,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:34,650 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:59:34,651 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:34,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:34,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1933201645, now seen corresponding path program 1 times [2019-10-02 11:59:34,651 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:34,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:34,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:34,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:34,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 60 proven. 44 refuted. 0 times theorem prover too weak. 1501 trivial. 0 not checked. [2019-10-02 11:59:38,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:59:38,314 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:59:38,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:39,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 6486 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:59:39,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:59:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 1116 trivial. 0 not checked. [2019-10-02 11:59:39,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:59:39,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-10-02 11:59:39,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:59:39,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:59:39,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:59:39,564 INFO L87 Difference]: Start difference. First operand 125057 states and 217457 transitions. Second operand 10 states. [2019-10-02 11:59:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:49,660 INFO L93 Difference]: Finished difference Result 250048 states and 464413 transitions. [2019-10-02 11:59:49,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:59:49,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 651 [2019-10-02 11:59:49,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:50,278 INFO L225 Difference]: With dead ends: 250048 [2019-10-02 11:59:50,278 INFO L226 Difference]: Without dead ends: 130612 [2019-10-02 11:59:50,690 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 680 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:59:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130612 states. [2019-10-02 12:00:01,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130612 to 128066. [2019-10-02 12:00:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128066 states. [2019-10-02 12:00:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128066 states to 128066 states and 222332 transitions. [2019-10-02 12:00:06,171 INFO L78 Accepts]: Start accepts. Automaton has 128066 states and 222332 transitions. Word has length 651 [2019-10-02 12:00:06,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:06,172 INFO L475 AbstractCegarLoop]: Abstraction has 128066 states and 222332 transitions. [2019-10-02 12:00:06,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:00:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 128066 states and 222332 transitions. [2019-10-02 12:00:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2019-10-02 12:00:06,205 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:06,206 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:00:06,206 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:06,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:06,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2008730617, now seen corresponding path program 1 times [2019-10-02 12:00:06,206 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:06,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:06,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:06,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:06,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 30 proven. 62 refuted. 0 times theorem prover too weak. 1501 trivial. 0 not checked. [2019-10-02 12:00:06,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:06,629 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:06,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:07,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 6350 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:00:07,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2019-10-02 12:00:07,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:07,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-02 12:00:07,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:00:07,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:00:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:00:07,817 INFO L87 Difference]: Start difference. First operand 128066 states and 222332 transitions. Second operand 7 states. [2019-10-02 12:00:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:43,346 INFO L93 Difference]: Finished difference Result 514544 states and 1320892 transitions. [2019-10-02 12:00:43,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:00:43,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 643 [2019-10-02 12:00:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:46,617 INFO L225 Difference]: With dead ends: 514544 [2019-10-02 12:00:46,617 INFO L226 Difference]: Without dead ends: 385973 [2019-10-02 12:00:47,353 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 670 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:00:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385973 states. [2019-10-02 12:01:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385973 to 372962. [2019-10-02 12:01:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372962 states. [2019-10-02 12:01:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372962 states to 372962 states and 823096 transitions. [2019-10-02 12:01:43,321 INFO L78 Accepts]: Start accepts. Automaton has 372962 states and 823096 transitions. Word has length 643 [2019-10-02 12:01:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:43,321 INFO L475 AbstractCegarLoop]: Abstraction has 372962 states and 823096 transitions. [2019-10-02 12:01:43,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:01:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 372962 states and 823096 transitions. [2019-10-02 12:01:43,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-10-02 12:01:43,364 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:43,365 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:01:43,365 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:43,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:43,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1004345082, now seen corresponding path program 1 times [2019-10-02 12:01:43,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:43,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:43,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:43,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:43,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 30 proven. 64 refuted. 0 times theorem prover too weak. 1519 trivial. 0 not checked. [2019-10-02 12:01:53,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:01:53,585 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:01:53,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:54,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 6676 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 12:01:54,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:01:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 787 proven. 2 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2019-10-02 12:01:55,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:01:55,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 12 [2019-10-02 12:01:55,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:01:55,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:01:55,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:01:55,059 INFO L87 Difference]: Start difference. First operand 372962 states and 823096 transitions. Second operand 12 states.