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_spec13_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:52:03,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:52:03,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:52:03,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:52:03,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:52:03,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:52:03,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:52:03,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:52:03,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:52:03,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:52:03,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:52:03,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:52:03,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:52:03,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:52:03,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:52:03,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:52:03,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:52:03,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:52:03,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:52:03,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:52:03,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:52:03,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:52:03,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:52:03,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:52:03,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:52:03,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:52:03,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:52:03,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:52:03,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:52:03,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:52:03,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:52:03,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:52:03,886 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:52:03,887 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:52:03,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:52:03,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:52:03,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:52:03,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:52:03,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:52:03,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:52:03,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:52:03,895 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:52:03,929 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:52:03,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:52:03,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:52:03,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:52:03,934 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:52:03,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:52:03,935 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:52:03,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:52:03,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:52:03,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:52:03,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:52:03,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:52:03,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:52:03,938 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:52:03,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:52:03,939 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:52:03,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:52:03,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:52:03,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:52:03,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:52:03,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:52:03,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:52:03,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:52:03,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:52:03,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:52:03,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:52:03,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:52:03,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:52:03,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:52:03,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:52:03,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:52:03,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:52:03,989 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:52:03,989 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:52:03,990 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec13_product32.cil.c [2019-10-02 11:52:04,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a45616536/76e2f7459c1144bc9bcc49c526d979a1/FLAGfe34c03a3 [2019-10-02 11:52:04,595 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:52:04,596 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec13_product32.cil.c [2019-10-02 11:52:04,619 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a45616536/76e2f7459c1144bc9bcc49c526d979a1/FLAGfe34c03a3 [2019-10-02 11:52:04,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a45616536/76e2f7459c1144bc9bcc49c526d979a1 [2019-10-02 11:52:04,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:52:04,809 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:52:04,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:52:04,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:52:04,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:52:04,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:52:04" (1/1) ... [2019-10-02 11:52:04,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3142fd7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:52:04, skipping insertion in model container [2019-10-02 11:52:04,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:52:04" (1/1) ... [2019-10-02 11:52:04,824 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:52:04,889 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:52:05,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:52:05,543 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:52:05,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:52:05,728 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:52:05,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:52:05 WrapperNode [2019-10-02 11:52:05,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:52:05,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:52:05,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:52:05,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:52:05,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:52:05" (1/1) ... [2019-10-02 11:52:05,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:52:05" (1/1) ... [2019-10-02 11:52:05,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:52:05" (1/1) ... [2019-10-02 11:52:05,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:52:05" (1/1) ... [2019-10-02 11:52:05,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:52:05" (1/1) ... [2019-10-02 11:52:05,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:52:05" (1/1) ... [2019-10-02 11:52:05,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:52:05" (1/1) ... [2019-10-02 11:52:05,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:52:05,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:52:05,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:52:05,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:52:05,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:52:05" (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:52:06,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:52:06,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:52:06,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 11:52:06,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 11:52:06,040 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 11:52:06,040 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 11:52:06,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification13_spec__1 [2019-10-02 11:52:06,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification13_spec__2 [2019-10-02 11:52:06,041 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 11:52:06,041 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 11:52:06,042 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 11:52:06,042 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 11:52:06,042 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 11:52:06,043 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 11:52:06,044 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 11:52:06,044 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 11:52:06,046 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 11:52:06,046 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 11:52:06,046 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 11:52:06,046 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 11:52:06,047 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 11:52:06,047 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 11:52:06,047 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 11:52:06,047 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 11:52:06,048 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:52:06,048 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 11:52:06,048 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 11:52:06,048 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 11:52:06,049 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 11:52:06,049 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 11:52:06,049 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 11:52:06,049 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 11:52:06,049 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 11:52:06,049 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 11:52:06,050 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 11:52:06,050 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 11:52:06,050 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 11:52:06,050 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 11:52:06,050 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 11:52:06,051 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 11:52:06,051 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 11:52:06,051 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 11:52:06,051 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 11:52:06,051 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 11:52:06,052 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 11:52:06,052 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 11:52:06,052 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 11:52:06,052 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 11:52:06,052 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 11:52:06,052 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 11:52:06,052 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 11:52:06,053 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 11:52:06,053 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 11:52:06,053 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 11:52:06,053 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 11:52:06,053 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 11:52:06,054 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 11:52:06,054 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 11:52:06,054 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 11:52:06,055 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 11:52:06,055 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 11:52:06,055 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 11:52:06,055 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 11:52:06,055 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 11:52:06,056 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 11:52:06,056 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 11:52:06,056 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 11:52:06,056 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 11:52:06,057 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 11:52:06,057 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 11:52:06,057 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 11:52:06,057 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 11:52:06,057 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 11:52:06,058 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-02 11:52:06,058 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 11:52:06,059 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-02 11:52:06,059 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 11:52:06,059 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 11:52:06,059 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 11:52:06,059 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 11:52:06,060 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 11:52:06,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:52:06,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:52:06,060 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 11:52:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 11:52:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 11:52:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 11:52:06,062 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 11:52:06,062 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 11:52:06,062 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 11:52:06,062 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 11:52:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 11:52:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 11:52:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 11:52:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification13_spec__1 [2019-10-02 11:52:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 11:52:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification13_spec__2 [2019-10-02 11:52:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 11:52:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 11:52:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 11:52:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 11:52:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 11:52:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 11:52:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 11:52:06,065 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 11:52:06,065 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 11:52:06,065 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 11:52:06,065 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 11:52:06,065 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 11:52:06,065 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 11:52:06,065 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 11:52:06,065 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 11:52:06,066 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 11:52:06,066 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 11:52:06,066 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 11:52:06,066 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 11:52:06,066 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 11:52:06,067 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 11:52:06,067 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 11:52:06,067 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:52:06,067 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 11:52:06,067 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 11:52:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 11:52:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 11:52:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 11:52:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 11:52:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 11:52:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 11:52:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 11:52:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 11:52:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 11:52:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:52:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 11:52:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 11:52:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:52:06,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:52:06,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:52:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:52:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 11:52:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:52:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 11:52:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 11:52:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:52:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 11:52:06,082 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 11:52:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:52:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 11:52:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 11:52:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 11:52:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 11:52:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 11:52:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 11:52:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 11:52:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 11:52:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 11:52:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 11:52:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 11:52:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 11:52:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 11:52:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 11:52:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 11:52:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 11:52:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 11:52:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 11:52:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 11:52:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 11:52:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 11:52:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 11:52:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 11:52:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 11:52:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 11:52:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 11:52:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-02 11:52:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-02 11:52:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:52:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 11:52:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:52:08,562 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:52:08,562 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 11:52:08,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:52:08 BoogieIcfgContainer [2019-10-02 11:52:08,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:52:08,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:52:08,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:52:08,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:52:08,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:52:04" (1/3) ... [2019-10-02 11:52:08,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e319b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:52:08, skipping insertion in model container [2019-10-02 11:52:08,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:52:05" (2/3) ... [2019-10-02 11:52:08,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e319b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:52:08, skipping insertion in model container [2019-10-02 11:52:08,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:52:08" (3/3) ... [2019-10-02 11:52:08,575 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec13_product32.cil.c [2019-10-02 11:52:08,584 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:52:08,601 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:52:08,618 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:52:08,665 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:52:08,666 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:52:08,666 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:52:08,666 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:52:08,666 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:52:08,667 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:52:08,667 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:52:08,667 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:52:08,667 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:52:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states. [2019-10-02 11:52:08,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 11:52:08,727 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:08,728 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:52:08,731 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:08,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:08,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2027146740, now seen corresponding path program 1 times [2019-10-02 11:52:08,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:08,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:08,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 11:52:09,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:52:09,409 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:52:09,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:10,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 2890 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 11:52:10,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:52:10,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:52:10,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-10-02 11:52:10,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:52:10,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:52:10,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:52:10,107 INFO L87 Difference]: Start difference. First operand 851 states. Second operand 7 states. [2019-10-02 11:52:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:10,489 INFO L93 Difference]: Finished difference Result 1398 states and 2240 transitions. [2019-10-02 11:52:10,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:52:10,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-10-02 11:52:10,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:10,530 INFO L225 Difference]: With dead ends: 1398 [2019-10-02 11:52:10,530 INFO L226 Difference]: Without dead ends: 702 [2019-10-02 11:52:10,547 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 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:52:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-10-02 11:52:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2019-10-02 11:52:10,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-10-02 11:52:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1101 transitions. [2019-10-02 11:52:10,727 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1101 transitions. Word has length 113 [2019-10-02 11:52:10,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:10,728 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 1101 transitions. [2019-10-02 11:52:10,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:52:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1101 transitions. [2019-10-02 11:52:10,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-02 11:52:10,744 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:10,745 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:10,745 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:10,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:10,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1088965156, now seen corresponding path program 1 times [2019-10-02 11:52:10,746 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:10,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:10,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:52:10,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:52:10,983 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:52:11,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:11,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 2886 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:52:11,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:52:11,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:52:11,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 11:52:11,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:52:11,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:52:11,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:52:11,600 INFO L87 Difference]: Start difference. First operand 702 states and 1101 transitions. Second operand 9 states. [2019-10-02 11:52:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:12,424 INFO L93 Difference]: Finished difference Result 1427 states and 2271 transitions. [2019-10-02 11:52:12,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:52:12,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-10-02 11:52:12,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:12,432 INFO L225 Difference]: With dead ends: 1427 [2019-10-02 11:52:12,432 INFO L226 Difference]: Without dead ends: 753 [2019-10-02 11:52:12,438 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:52:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-10-02 11:52:12,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 748. [2019-10-02 11:52:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-02 11:52:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1186 transitions. [2019-10-02 11:52:12,479 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1186 transitions. Word has length 115 [2019-10-02 11:52:12,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:12,479 INFO L475 AbstractCegarLoop]: Abstraction has 748 states and 1186 transitions. [2019-10-02 11:52:12,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:52:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1186 transitions. [2019-10-02 11:52:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-02 11:52:12,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:12,483 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:12,483 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:12,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:12,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1752638134, now seen corresponding path program 1 times [2019-10-02 11:52:12,484 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:12,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:12,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:12,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:12,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:12,667 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 11:52:12,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:52:12,667 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:52:12,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:13,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 2889 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:52:13,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 11:52:13,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:52:13,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:52:13,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:52:13,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:52:13,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:52:13,263 INFO L87 Difference]: Start difference. First operand 748 states and 1186 transitions. Second operand 6 states. [2019-10-02 11:52:13,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:13,370 INFO L93 Difference]: Finished difference Result 1475 states and 2353 transitions. [2019-10-02 11:52:13,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:52:13,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-02 11:52:13,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:13,377 INFO L225 Difference]: With dead ends: 1475 [2019-10-02 11:52:13,377 INFO L226 Difference]: Without dead ends: 749 [2019-10-02 11:52:13,381 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 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:52:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-10-02 11:52:13,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2019-10-02 11:52:13,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-10-02 11:52:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1182 transitions. [2019-10-02 11:52:13,434 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1182 transitions. Word has length 118 [2019-10-02 11:52:13,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:13,434 INFO L475 AbstractCegarLoop]: Abstraction has 749 states and 1182 transitions. [2019-10-02 11:52:13,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:52:13,434 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1182 transitions. [2019-10-02 11:52:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 11:52:13,438 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:13,438 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:52:13,438 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:13,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:13,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1439677226, now seen corresponding path program 1 times [2019-10-02 11:52:13,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:13,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:13,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:13,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:13,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:52:13,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:52:13,599 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:52:13,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:14,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 2890 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:52:14,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:52:14,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:52:14,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:52:14,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:52:14,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:52:14,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:52:14,342 INFO L87 Difference]: Start difference. First operand 749 states and 1182 transitions. Second operand 12 states. [2019-10-02 11:52:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:14,589 INFO L93 Difference]: Finished difference Result 1474 states and 2342 transitions. [2019-10-02 11:52:14,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:52:14,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2019-10-02 11:52:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:14,595 INFO L225 Difference]: With dead ends: 1474 [2019-10-02 11:52:14,596 INFO L226 Difference]: Without dead ends: 758 [2019-10-02 11:52:14,599 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:52:14,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-10-02 11:52:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 749. [2019-10-02 11:52:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-10-02 11:52:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1182 transitions. [2019-10-02 11:52:14,627 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1182 transitions. Word has length 119 [2019-10-02 11:52:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:14,627 INFO L475 AbstractCegarLoop]: Abstraction has 749 states and 1182 transitions. [2019-10-02 11:52:14,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:52:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1182 transitions. [2019-10-02 11:52:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 11:52:14,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:14,630 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:52:14,631 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:14,631 INFO L82 PathProgramCache]: Analyzing trace with hash -488661128, now seen corresponding path program 1 times [2019-10-02 11:52:14,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:14,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:14,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:14,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:14,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:52:14,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:52:14,755 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:52:14,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:15,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 2891 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:52:15,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:52:15,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:52:15,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:52:15,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:52:15,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:52:15,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:52:15,344 INFO L87 Difference]: Start difference. First operand 749 states and 1182 transitions. Second operand 12 states. [2019-10-02 11:52:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:15,506 INFO L93 Difference]: Finished difference Result 1474 states and 2342 transitions. [2019-10-02 11:52:15,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:52:15,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-10-02 11:52:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:15,512 INFO L225 Difference]: With dead ends: 1474 [2019-10-02 11:52:15,512 INFO L226 Difference]: Without dead ends: 758 [2019-10-02 11:52:15,516 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:52:15,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-10-02 11:52:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 749. [2019-10-02 11:52:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-10-02 11:52:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1182 transitions. [2019-10-02 11:52:15,542 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1182 transitions. Word has length 120 [2019-10-02 11:52:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:15,542 INFO L475 AbstractCegarLoop]: Abstraction has 749 states and 1182 transitions. [2019-10-02 11:52:15,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:52:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1182 transitions. [2019-10-02 11:52:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 11:52:15,545 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:15,545 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:52:15,546 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:15,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:15,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1157992522, now seen corresponding path program 1 times [2019-10-02 11:52:15,546 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:15,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:15,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:15,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:15,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:52:15,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:52:15,741 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:52:15,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:16,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 2887 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:52:16,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream closed [2019-10-02 11:52:16,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:52:16,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 11:52:16,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:52:16,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:52:16,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:52:16,353 INFO L87 Difference]: Start difference. First operand 749 states and 1182 transitions. Second operand 14 states. [2019-10-02 11:52:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:16,841 INFO L93 Difference]: Finished difference Result 1487 states and 2366 transitions. [2019-10-02 11:52:16,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:52:16,842 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-10-02 11:52:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:16,855 INFO L225 Difference]: With dead ends: 1487 [2019-10-02 11:52:16,855 INFO L226 Difference]: Without dead ends: 771 [2019-10-02 11:52:16,864 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:52:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-10-02 11:52:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 759. [2019-10-02 11:52:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-10-02 11:52:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1201 transitions. [2019-10-02 11:52:16,909 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1201 transitions. Word has length 120 [2019-10-02 11:52:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:16,910 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1201 transitions. [2019-10-02 11:52:16,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:52:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1201 transitions. [2019-10-02 11:52:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 11:52:16,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:16,916 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:52:16,916 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:16,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:16,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1196367312, now seen corresponding path program 1 times [2019-10-02 11:52:16,917 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:16,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:16,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:16,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:16,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:52:17,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:52:17,191 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:52:17,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:17,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 2893 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:52:17,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 11:52:17,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:52:17,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-10-02 11:52:17,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:52:17,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:52:17,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:52:17,816 INFO L87 Difference]: Start difference. First operand 759 states and 1201 transitions. Second operand 8 states. [2019-10-02 11:52:17,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:17,936 INFO L93 Difference]: Finished difference Result 1503 states and 2407 transitions. [2019-10-02 11:52:17,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:52:17,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-02 11:52:17,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:17,943 INFO L225 Difference]: With dead ends: 1503 [2019-10-02 11:52:17,944 INFO L226 Difference]: Without dead ends: 775 [2019-10-02 11:52:17,948 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:52:17,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-10-02 11:52:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 767. [2019-10-02 11:52:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-10-02 11:52:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1215 transitions. [2019-10-02 11:52:17,977 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1215 transitions. Word has length 122 [2019-10-02 11:52:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:17,977 INFO L475 AbstractCegarLoop]: Abstraction has 767 states and 1215 transitions. [2019-10-02 11:52:17,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:52:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1215 transitions. [2019-10-02 11:52:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 11:52:17,980 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:17,980 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:52:17,981 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:17,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:17,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1022229623, now seen corresponding path program 1 times [2019-10-02 11:52:17,981 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:17,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:17,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:17,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:17,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:52:18,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:52:18,089 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:52:18,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:18,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 2894 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:52:18,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 11:52:18,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:52:18,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-10-02 11:52:18,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:52:18,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:52:18,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:52:18,651 INFO L87 Difference]: Start difference. First operand 767 states and 1215 transitions. Second operand 8 states. [2019-10-02 11:52:18,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:18,793 INFO L93 Difference]: Finished difference Result 1515 states and 2428 transitions. [2019-10-02 11:52:18,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:52:18,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2019-10-02 11:52:18,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:18,799 INFO L225 Difference]: With dead ends: 1515 [2019-10-02 11:52:18,799 INFO L226 Difference]: Without dead ends: 779 [2019-10-02 11:52:18,803 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:52:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-10-02 11:52:18,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 771. [2019-10-02 11:52:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-10-02 11:52:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1223 transitions. [2019-10-02 11:52:18,833 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1223 transitions. Word has length 123 [2019-10-02 11:52:18,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:18,833 INFO L475 AbstractCegarLoop]: Abstraction has 771 states and 1223 transitions. [2019-10-02 11:52:18,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:52:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1223 transitions. [2019-10-02 11:52:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 11:52:18,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:18,836 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:52:18,836 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:18,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:18,837 INFO L82 PathProgramCache]: Analyzing trace with hash 519527925, now seen corresponding path program 1 times [2019-10-02 11:52:18,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:18,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:18,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:18,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:18,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:52:19,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:19,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:52:19,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:52:19,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:52:19,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:52:19,117 INFO L87 Difference]: Start difference. First operand 771 states and 1223 transitions. Second operand 9 states. [2019-10-02 11:52:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:19,340 INFO L93 Difference]: Finished difference Result 1457 states and 2311 transitions. [2019-10-02 11:52:19,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:52:19,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-10-02 11:52:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:19,347 INFO L225 Difference]: With dead ends: 1457 [2019-10-02 11:52:19,348 INFO L226 Difference]: Without dead ends: 781 [2019-10-02 11:52:19,351 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:52:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-10-02 11:52:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 777. [2019-10-02 11:52:19,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-10-02 11:52:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1230 transitions. [2019-10-02 11:52:19,391 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1230 transitions. Word has length 124 [2019-10-02 11:52:19,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:19,392 INFO L475 AbstractCegarLoop]: Abstraction has 777 states and 1230 transitions. [2019-10-02 11:52:19,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:52:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1230 transitions. [2019-10-02 11:52:19,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 11:52:19,395 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:19,395 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:52:19,395 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:19,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:19,396 INFO L82 PathProgramCache]: Analyzing trace with hash 71775017, now seen corresponding path program 1 times [2019-10-02 11:52:19,396 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:19,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:19,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:19,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:19,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:52:19,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:19,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:52:19,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:52:19,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:52:19,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:52:19,559 INFO L87 Difference]: Start difference. First operand 777 states and 1230 transitions. Second operand 9 states. [2019-10-02 11:52:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:19,773 INFO L93 Difference]: Finished difference Result 1459 states and 2312 transitions. [2019-10-02 11:52:19,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:52:19,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2019-10-02 11:52:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:19,780 INFO L225 Difference]: With dead ends: 1459 [2019-10-02 11:52:19,780 INFO L226 Difference]: Without dead ends: 783 [2019-10-02 11:52:19,784 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:52:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-10-02 11:52:19,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 777. [2019-10-02 11:52:19,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-10-02 11:52:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1230 transitions. [2019-10-02 11:52:19,812 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1230 transitions. Word has length 125 [2019-10-02 11:52:19,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:19,813 INFO L475 AbstractCegarLoop]: Abstraction has 777 states and 1230 transitions. [2019-10-02 11:52:19,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:52:19,813 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1230 transitions. [2019-10-02 11:52:19,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 11:52:19,816 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:19,816 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:52:19,816 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:19,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:19,817 INFO L82 PathProgramCache]: Analyzing trace with hash -474236899, now seen corresponding path program 1 times [2019-10-02 11:52:19,817 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:19,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:19,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:19,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:19,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:19,928 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 11:52:19,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:19,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:52:19,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:52:19,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:52:19,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:52:19,930 INFO L87 Difference]: Start difference. First operand 777 states and 1230 transitions. Second operand 4 states. [2019-10-02 11:52:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:20,001 INFO L93 Difference]: Finished difference Result 1501 states and 2397 transitions. [2019-10-02 11:52:20,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:52:20,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-10-02 11:52:20,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:20,011 INFO L225 Difference]: With dead ends: 1501 [2019-10-02 11:52:20,011 INFO L226 Difference]: Without dead ends: 754 [2019-10-02 11:52:20,016 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:52:20,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-02 11:52:20,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-02 11:52:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-02 11:52:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1182 transitions. [2019-10-02 11:52:20,069 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1182 transitions. Word has length 125 [2019-10-02 11:52:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:20,070 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1182 transitions. [2019-10-02 11:52:20,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:52:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1182 transitions. [2019-10-02 11:52:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-02 11:52:20,074 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:20,074 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:52:20,075 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:20,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:20,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1706474287, now seen corresponding path program 1 times [2019-10-02 11:52:20,075 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:20,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:20,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:20,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:20,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:52:20,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:20,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:52:20,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:52:20,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:52:20,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:52:20,270 INFO L87 Difference]: Start difference. First operand 754 states and 1182 transitions. Second operand 6 states. [2019-10-02 11:52:20,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:20,575 INFO L93 Difference]: Finished difference Result 1501 states and 2384 transitions. [2019-10-02 11:52:20,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:52:20,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-10-02 11:52:20,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:20,582 INFO L225 Difference]: With dead ends: 1501 [2019-10-02 11:52:20,582 INFO L226 Difference]: Without dead ends: 764 [2019-10-02 11:52:20,587 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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:52:20,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-10-02 11:52:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 761. [2019-10-02 11:52:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-02 11:52:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1181 transitions. [2019-10-02 11:52:20,612 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1181 transitions. Word has length 126 [2019-10-02 11:52:20,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:20,615 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 1181 transitions. [2019-10-02 11:52:20,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:52:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1181 transitions. [2019-10-02 11:52:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-02 11:52:20,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:20,619 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:52:20,619 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:20,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:20,619 INFO L82 PathProgramCache]: Analyzing trace with hash -200315121, now seen corresponding path program 1 times [2019-10-02 11:52:20,619 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:20,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:20,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:20,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:20,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:52:20,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:20,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:52:20,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:52:20,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:52:20,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:52:20,763 INFO L87 Difference]: Start difference. First operand 761 states and 1181 transitions. Second operand 7 states. [2019-10-02 11:52:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:20,911 INFO L93 Difference]: Finished difference Result 1441 states and 2255 transitions. [2019-10-02 11:52:20,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:52:20,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2019-10-02 11:52:20,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:20,921 INFO L225 Difference]: With dead ends: 1441 [2019-10-02 11:52:20,921 INFO L226 Difference]: Without dead ends: 747 [2019-10-02 11:52:20,927 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:52:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-10-02 11:52:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 745. [2019-10-02 11:52:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-10-02 11:52:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1148 transitions. [2019-10-02 11:52:20,976 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1148 transitions. Word has length 126 [2019-10-02 11:52:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:20,977 INFO L475 AbstractCegarLoop]: Abstraction has 745 states and 1148 transitions. [2019-10-02 11:52:20,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:52:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1148 transitions. [2019-10-02 11:52:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 11:52:20,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:20,982 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:52:20,983 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:20,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:20,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1148731581, now seen corresponding path program 1 times [2019-10-02 11:52:20,984 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:20,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:20,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:20,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:20,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 11:52:21,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:21,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:52:21,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:52:21,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:52:21,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:52:21,326 INFO L87 Difference]: Start difference. First operand 745 states and 1148 transitions. Second operand 11 states. [2019-10-02 11:52:21,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:21,633 INFO L93 Difference]: Finished difference Result 1419 states and 2217 transitions. [2019-10-02 11:52:21,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:52:21,633 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2019-10-02 11:52:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:21,639 INFO L225 Difference]: With dead ends: 1419 [2019-10-02 11:52:21,639 INFO L226 Difference]: Without dead ends: 741 [2019-10-02 11:52:21,644 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:52:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-10-02 11:52:21,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 739. [2019-10-02 11:52:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-10-02 11:52:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1138 transitions. [2019-10-02 11:52:21,667 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1138 transitions. Word has length 127 [2019-10-02 11:52:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:21,667 INFO L475 AbstractCegarLoop]: Abstraction has 739 states and 1138 transitions. [2019-10-02 11:52:21,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:52:21,668 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1138 transitions. [2019-10-02 11:52:21,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 11:52:21,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:21,670 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:21,670 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:21,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:21,671 INFO L82 PathProgramCache]: Analyzing trace with hash -713691512, now seen corresponding path program 1 times [2019-10-02 11:52:21,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:21,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:21,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:21,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:21,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 11:52:21,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:52:21,819 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:52:21,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:22,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 2900 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 11:52:22,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 11:52:22,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:52:22,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 11:52:22,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:52:22,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:52:22,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:52:22,409 INFO L87 Difference]: Start difference. First operand 739 states and 1138 transitions. Second operand 5 states. [2019-10-02 11:52:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:22,694 INFO L93 Difference]: Finished difference Result 2065 states and 3269 transitions. [2019-10-02 11:52:22,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:52:22,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-10-02 11:52:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:22,705 INFO L225 Difference]: With dead ends: 2065 [2019-10-02 11:52:22,705 INFO L226 Difference]: Without dead ends: 1399 [2019-10-02 11:52:22,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:52:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-10-02 11:52:22,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1326. [2019-10-02 11:52:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-10-02 11:52:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 2077 transitions. [2019-10-02 11:52:22,764 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 2077 transitions. Word has length 129 [2019-10-02 11:52:22,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:22,765 INFO L475 AbstractCegarLoop]: Abstraction has 1326 states and 2077 transitions. [2019-10-02 11:52:22,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:52:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 2077 transitions. [2019-10-02 11:52:22,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 11:52:22,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:22,771 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:52:22,771 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:22,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:22,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1018900320, now seen corresponding path program 1 times [2019-10-02 11:52:22,772 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:22,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:22,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:22,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:22,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 11:52:23,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:23,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:52:23,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:52:23,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:52:23,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:52:23,034 INFO L87 Difference]: Start difference. First operand 1326 states and 2077 transitions. Second operand 10 states. [2019-10-02 11:52:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:24,254 INFO L93 Difference]: Finished difference Result 3132 states and 4924 transitions. [2019-10-02 11:52:24,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:52:24,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2019-10-02 11:52:24,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:24,267 INFO L225 Difference]: With dead ends: 3132 [2019-10-02 11:52:24,267 INFO L226 Difference]: Without dead ends: 1879 [2019-10-02 11:52:24,275 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:52:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2019-10-02 11:52:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1875. [2019-10-02 11:52:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-10-02 11:52:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2907 transitions. [2019-10-02 11:52:24,356 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2907 transitions. Word has length 189 [2019-10-02 11:52:24,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:24,356 INFO L475 AbstractCegarLoop]: Abstraction has 1875 states and 2907 transitions. [2019-10-02 11:52:24,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:52:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2907 transitions. [2019-10-02 11:52:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 11:52:24,364 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:24,365 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:52:24,365 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:24,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:24,365 INFO L82 PathProgramCache]: Analyzing trace with hash -106450315, now seen corresponding path program 1 times [2019-10-02 11:52:24,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:24,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:24,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:24,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:24,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 11:52:24,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:52:24,571 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:52:24,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:25,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 3280 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:52:25,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:52:25,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:52:25,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 11:52:25,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:52:25,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:52:25,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:52:25,255 INFO L87 Difference]: Start difference. First operand 1875 states and 2907 transitions. Second operand 14 states. [2019-10-02 11:52:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:38,298 INFO L93 Difference]: Finished difference Result 5443 states and 8790 transitions. [2019-10-02 11:52:38,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 11:52:38,298 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 190 [2019-10-02 11:52:38,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:38,328 INFO L225 Difference]: With dead ends: 5443 [2019-10-02 11:52:38,328 INFO L226 Difference]: Without dead ends: 3641 [2019-10-02 11:52:38,347 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-10-02 11:52:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2019-10-02 11:52:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 3583. [2019-10-02 11:52:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3583 states. [2019-10-02 11:52:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 5613 transitions. [2019-10-02 11:52:38,536 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 5613 transitions. Word has length 190 [2019-10-02 11:52:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:38,537 INFO L475 AbstractCegarLoop]: Abstraction has 3583 states and 5613 transitions. [2019-10-02 11:52:38,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:52:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 5613 transitions. [2019-10-02 11:52:38,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 11:52:38,544 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:38,544 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:52:38,545 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:38,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:38,545 INFO L82 PathProgramCache]: Analyzing trace with hash -209204489, now seen corresponding path program 1 times [2019-10-02 11:52:38,545 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:38,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:38,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:38,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:38,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 11:52:38,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:52:38,807 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:52:38,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:39,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 3282 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:52:39,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:52:39,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:52:39,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 11:52:39,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:52:39,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:52:39,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:52:39,498 INFO L87 Difference]: Start difference. First operand 3583 states and 5613 transitions. Second operand 14 states. [2019-10-02 11:52:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:52,764 INFO L93 Difference]: Finished difference Result 9023 states and 14566 transitions. [2019-10-02 11:52:52,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 11:52:52,765 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 192 [2019-10-02 11:52:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:52,799 INFO L225 Difference]: With dead ends: 9023 [2019-10-02 11:52:52,800 INFO L226 Difference]: Without dead ends: 5513 [2019-10-02 11:52:52,820 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-10-02 11:52:52,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2019-10-02 11:52:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5399. [2019-10-02 11:52:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5399 states. [2019-10-02 11:52:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5399 states to 5399 states and 8489 transitions. [2019-10-02 11:52:53,094 INFO L78 Accepts]: Start accepts. Automaton has 5399 states and 8489 transitions. Word has length 192 [2019-10-02 11:52:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:53,096 INFO L475 AbstractCegarLoop]: Abstraction has 5399 states and 8489 transitions. [2019-10-02 11:52:53,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:52:53,096 INFO L276 IsEmpty]: Start isEmpty. Operand 5399 states and 8489 transitions. [2019-10-02 11:52:53,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 11:52:53,107 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:53,107 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:52:53,107 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:53,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:53,108 INFO L82 PathProgramCache]: Analyzing trace with hash -204414283, now seen corresponding path program 1 times [2019-10-02 11:52:53,108 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:53,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:53,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:53,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:53,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:52:53,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:53,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:52:53,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:52:53,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:52:53,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:52:53,330 INFO L87 Difference]: Start difference. First operand 5399 states and 8489 transitions. Second operand 6 states. [2019-10-02 11:52:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:54,190 INFO L93 Difference]: Finished difference Result 10845 states and 17466 transitions. [2019-10-02 11:52:54,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:52:54,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2019-10-02 11:52:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:54,225 INFO L225 Difference]: With dead ends: 10845 [2019-10-02 11:52:54,225 INFO L226 Difference]: Without dead ends: 5471 [2019-10-02 11:52:54,246 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 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:52:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5471 states. [2019-10-02 11:52:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5471 to 5471. [2019-10-02 11:52:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5471 states. [2019-10-02 11:52:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 8513 transitions. [2019-10-02 11:52:54,471 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 8513 transitions. Word has length 194 [2019-10-02 11:52:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:54,471 INFO L475 AbstractCegarLoop]: Abstraction has 5471 states and 8513 transitions. [2019-10-02 11:52:54,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:52:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 8513 transitions. [2019-10-02 11:52:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 11:52:54,478 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:54,478 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:52:54,479 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:54,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:54,479 INFO L82 PathProgramCache]: Analyzing trace with hash 474048047, now seen corresponding path program 1 times [2019-10-02 11:52:54,479 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:54,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:54,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:54,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:54,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:52:54,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:54,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:52:54,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:52:54,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:52:54,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:52:54,668 INFO L87 Difference]: Start difference. First operand 5471 states and 8513 transitions. Second operand 6 states. [2019-10-02 11:52:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:55,687 INFO L93 Difference]: Finished difference Result 11001 states and 17514 transitions. [2019-10-02 11:52:55,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:52:55,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 196 [2019-10-02 11:52:55,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:55,727 INFO L225 Difference]: With dead ends: 11001 [2019-10-02 11:52:55,728 INFO L226 Difference]: Without dead ends: 5555 [2019-10-02 11:52:55,747 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 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:52:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5555 states. [2019-10-02 11:52:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5555 to 5555. [2019-10-02 11:52:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5555 states. [2019-10-02 11:52:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5555 states to 5555 states and 8549 transitions. [2019-10-02 11:52:56,045 INFO L78 Accepts]: Start accepts. Automaton has 5555 states and 8549 transitions. Word has length 196 [2019-10-02 11:52:56,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:56,046 INFO L475 AbstractCegarLoop]: Abstraction has 5555 states and 8549 transitions. [2019-10-02 11:52:56,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:52:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 5555 states and 8549 transitions. [2019-10-02 11:52:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 11:52:56,054 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:56,055 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:52:56,055 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:56,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1436115189, now seen corresponding path program 1 times [2019-10-02 11:52:56,055 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:56,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:56,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:56,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:56,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 11:52:56,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:52:56,302 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:52:56,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:56,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 3288 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:52:56,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 11:52:56,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:52:56,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 11:52:56,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:52:56,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:52:56,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:52:56,981 INFO L87 Difference]: Start difference. First operand 5555 states and 8549 transitions. Second operand 14 states. [2019-10-02 11:53:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:25,913 INFO L93 Difference]: Finished difference Result 39336 states and 63835 transitions. [2019-10-02 11:53:25,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 11:53:25,913 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 198 [2019-10-02 11:53:25,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:26,160 INFO L225 Difference]: With dead ends: 39336 [2019-10-02 11:53:26,160 INFO L226 Difference]: Without dead ends: 33854 [2019-10-02 11:53:26,212 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=514, Invalid=3268, Unknown=0, NotChecked=0, Total=3782 [2019-10-02 11:53:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33854 states. [2019-10-02 11:53:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33854 to 32660. [2019-10-02 11:53:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32660 states. [2019-10-02 11:53:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32660 states to 32660 states and 51374 transitions. [2019-10-02 11:53:27,917 INFO L78 Accepts]: Start accepts. Automaton has 32660 states and 51374 transitions. Word has length 198 [2019-10-02 11:53:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:27,918 INFO L475 AbstractCegarLoop]: Abstraction has 32660 states and 51374 transitions. [2019-10-02 11:53:27,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:53:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 32660 states and 51374 transitions. [2019-10-02 11:53:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 11:53:27,933 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:27,934 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:53:27,934 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:27,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:27,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1903529150, now seen corresponding path program 1 times [2019-10-02 11:53:27,935 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:27,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:27,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:27,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:27,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:28,087 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:53:28,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:53:28,088 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 11:53:29,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:29,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 3288 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:53:29,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:53:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:53:29,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:53:29,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-10-02 11:53:29,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:53:29,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:53:29,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:53:29,922 INFO L87 Difference]: Start difference. First operand 32660 states and 51374 transitions. Second operand 10 states. [2019-10-02 11:53:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:32,057 INFO L93 Difference]: Finished difference Result 86363 states and 137391 transitions. [2019-10-02 11:53:32,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:53:32,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2019-10-02 11:53:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:32,403 INFO L225 Difference]: With dead ends: 86363 [2019-10-02 11:53:32,403 INFO L226 Difference]: Without dead ends: 53720 [2019-10-02 11:53:32,552 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:53:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53720 states. [2019-10-02 11:53:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53720 to 53320. [2019-10-02 11:53:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53320 states. [2019-10-02 11:53:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53320 states to 53320 states and 83800 transitions. [2019-10-02 11:53:36,635 INFO L78 Accepts]: Start accepts. Automaton has 53320 states and 83800 transitions. Word has length 199 [2019-10-02 11:53:36,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:36,636 INFO L475 AbstractCegarLoop]: Abstraction has 53320 states and 83800 transitions. [2019-10-02 11:53:36,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:53:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 53320 states and 83800 transitions. [2019-10-02 11:53:36,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 11:53:36,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:36,650 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:53:36,650 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:36,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:36,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1256204560, now seen corresponding path program 1 times [2019-10-02 11:53:36,650 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:36,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:36,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:36,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:36,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:36,802 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:53:36,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:36,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:53:36,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:53:36,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:53:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:53:36,804 INFO L87 Difference]: Start difference. First operand 53320 states and 83800 transitions. Second operand 9 states. [2019-10-02 11:53:38,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:38,588 INFO L93 Difference]: Finished difference Result 87199 states and 136530 transitions. [2019-10-02 11:53:38,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:53:38,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2019-10-02 11:53:38,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:38,771 INFO L225 Difference]: With dead ends: 87199 [2019-10-02 11:53:38,771 INFO L226 Difference]: Without dead ends: 33946 [2019-10-02 11:53:38,924 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:53:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33946 states. [2019-10-02 11:53:39,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33946 to 33910. [2019-10-02 11:53:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33910 states. [2019-10-02 11:53:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33910 states to 33910 states and 52732 transitions. [2019-10-02 11:53:40,076 INFO L78 Accepts]: Start accepts. Automaton has 33910 states and 52732 transitions. Word has length 200 [2019-10-02 11:53:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:40,077 INFO L475 AbstractCegarLoop]: Abstraction has 33910 states and 52732 transitions. [2019-10-02 11:53:40,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:53:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 33910 states and 52732 transitions. [2019-10-02 11:53:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 11:53:40,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:40,086 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:53:40,086 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:40,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:40,086 INFO L82 PathProgramCache]: Analyzing trace with hash 915668462, now seen corresponding path program 1 times [2019-10-02 11:53:40,086 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:40,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:40,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:40,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:40,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 11:53:40,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:40,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:53:40,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:53:40,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:53:40,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:53:40,304 INFO L87 Difference]: Start difference. First operand 33910 states and 52732 transitions. Second operand 11 states. [2019-10-02 11:53:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:51,951 INFO L93 Difference]: Finished difference Result 64278 states and 101185 transitions. [2019-10-02 11:53:51,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 11:53:51,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 209 [2019-10-02 11:53:51,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:52,106 INFO L225 Difference]: With dead ends: 64278 [2019-10-02 11:53:52,107 INFO L226 Difference]: Without dead ends: 34334 [2019-10-02 11:53:52,183 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2019-10-02 11:53:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34334 states. [2019-10-02 11:53:53,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34334 to 33878. [2019-10-02 11:53:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33878 states. [2019-10-02 11:53:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33878 states to 33878 states and 52660 transitions. [2019-10-02 11:53:53,311 INFO L78 Accepts]: Start accepts. Automaton has 33878 states and 52660 transitions. Word has length 209 [2019-10-02 11:53:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:53,312 INFO L475 AbstractCegarLoop]: Abstraction has 33878 states and 52660 transitions. [2019-10-02 11:53:53,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:53:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 33878 states and 52660 transitions. [2019-10-02 11:53:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-02 11:53:53,320 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:53,321 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:53:53,321 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:53,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:53,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1926157623, now seen corresponding path program 1 times [2019-10-02 11:53:53,322 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:53,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:53,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:53,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:53,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:53:53,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:53,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:53:53,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:53:53,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:53:53,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:53:53,492 INFO L87 Difference]: Start difference. First operand 33878 states and 52660 transitions. Second operand 6 states. [2019-10-02 11:54:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:00,589 INFO L93 Difference]: Finished difference Result 91107 states and 150461 transitions. [2019-10-02 11:54:00,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:54:00,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 223 [2019-10-02 11:54:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:00,873 INFO L225 Difference]: With dead ends: 91107 [2019-10-02 11:54:00,873 INFO L226 Difference]: Without dead ends: 57302 [2019-10-02 11:54:00,984 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:54:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57302 states. [2019-10-02 11:54:03,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57302 to 53615. [2019-10-02 11:54:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53615 states. [2019-10-02 11:54:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53615 states to 53615 states and 84149 transitions. [2019-10-02 11:54:03,597 INFO L78 Accepts]: Start accepts. Automaton has 53615 states and 84149 transitions. Word has length 223 [2019-10-02 11:54:03,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:03,597 INFO L475 AbstractCegarLoop]: Abstraction has 53615 states and 84149 transitions. [2019-10-02 11:54:03,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 53615 states and 84149 transitions. [2019-10-02 11:54:03,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 11:54:03,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:03,602 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:03,603 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:03,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:03,603 INFO L82 PathProgramCache]: Analyzing trace with hash 947713581, now seen corresponding path program 1 times [2019-10-02 11:54:03,603 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:03,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:03,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:03,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:03,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:54:03,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:03,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:03,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:03,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:03,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:03,782 INFO L87 Difference]: Start difference. First operand 53615 states and 84149 transitions. Second operand 6 states. [2019-10-02 11:54:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:14,579 INFO L93 Difference]: Finished difference Result 160846 states and 275283 transitions. [2019-10-02 11:54:14,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:54:14,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 224 [2019-10-02 11:54:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:15,111 INFO L225 Difference]: With dead ends: 160846 [2019-10-02 11:54:15,112 INFO L226 Difference]: Without dead ends: 107304 [2019-10-02 11:54:15,312 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:54:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107304 states. [2019-10-02 11:54:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107304 to 98101. [2019-10-02 11:54:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98101 states. [2019-10-02 11:54:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98101 states to 98101 states and 157258 transitions. [2019-10-02 11:54:20,065 INFO L78 Accepts]: Start accepts. Automaton has 98101 states and 157258 transitions. Word has length 224 [2019-10-02 11:54:20,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:20,065 INFO L475 AbstractCegarLoop]: Abstraction has 98101 states and 157258 transitions. [2019-10-02 11:54:20,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 98101 states and 157258 transitions. [2019-10-02 11:54:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 11:54:20,074 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:20,074 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:20,075 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:20,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:20,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1084367219, now seen corresponding path program 1 times [2019-10-02 11:54:20,075 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:20,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:20,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:20,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:20,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:54:20,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:20,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:20,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:20,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:20,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:20,259 INFO L87 Difference]: Start difference. First operand 98101 states and 157258 transitions. Second operand 6 states. [2019-10-02 11:54:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:43,830 INFO L93 Difference]: Finished difference Result 324745 states and 588015 transitions. [2019-10-02 11:54:43,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:54:43,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-10-02 11:54:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:45,202 INFO L225 Difference]: With dead ends: 324745 [2019-10-02 11:54:45,202 INFO L226 Difference]: Without dead ends: 226717 [2019-10-02 11:54:45,694 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:54:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226717 states. [2019-10-02 11:54:59,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226717 to 202417. [2019-10-02 11:54:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202417 states. [2019-10-02 11:55:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202417 states to 202417 states and 336073 transitions. [2019-10-02 11:55:01,322 INFO L78 Accepts]: Start accepts. Automaton has 202417 states and 336073 transitions. Word has length 225 [2019-10-02 11:55:01,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:01,323 INFO L475 AbstractCegarLoop]: Abstraction has 202417 states and 336073 transitions. [2019-10-02 11:55:01,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:55:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 202417 states and 336073 transitions. [2019-10-02 11:55:01,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 11:55:01,329 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:01,329 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:01,329 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:01,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:01,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1429310569, now seen corresponding path program 1 times [2019-10-02 11:55:01,330 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:01,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:01,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:01,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:01,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:55:01,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:01,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:55:01,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:55:01,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:55:01,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:55:01,503 INFO L87 Difference]: Start difference. First operand 202417 states and 336073 transitions. Second operand 6 states. [2019-10-02 11:56:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:00,805 INFO L93 Difference]: Finished difference Result 731072 states and 1432303 transitions. [2019-10-02 11:56:00,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:56:00,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 226 [2019-10-02 11:56:00,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:05,489 INFO L225 Difference]: With dead ends: 731072 [2019-10-02 11:56:05,489 INFO L226 Difference]: Without dead ends: 528728 [2019-10-02 11:56:07,001 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:56:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528728 states. [2019-10-02 11:57:12,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528728 to 461701. [2019-10-02 11:57:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461701 states. [2019-10-02 11:57:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461701 states to 461701 states and 806458 transitions. [2019-10-02 11:57:19,855 INFO L78 Accepts]: Start accepts. Automaton has 461701 states and 806458 transitions. Word has length 226 [2019-10-02 11:57:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:19,856 INFO L475 AbstractCegarLoop]: Abstraction has 461701 states and 806458 transitions. [2019-10-02 11:57:19,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:57:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 461701 states and 806458 transitions. [2019-10-02 11:57:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 11:57:19,864 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:19,866 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:19,866 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:19,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:19,867 INFO L82 PathProgramCache]: Analyzing trace with hash -358699601, now seen corresponding path program 1 times [2019-10-02 11:57:19,867 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:19,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:19,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:19,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:19,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:57:20,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:20,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:57:20,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:57:20,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:57:20,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:20,081 INFO L87 Difference]: Start difference. First operand 461701 states and 806458 transitions. Second operand 6 states.