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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:11:12,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:11:12,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:11:12,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:11:12,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:11:12,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:11:12,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:11:12,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:11:12,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:11:12,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:11:12,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:11:12,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:11:12,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:11:12,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:11:12,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:11:12,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:11:12,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:11:12,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:11:12,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:11:12,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:11:12,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:11:12,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:11:12,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:11:12,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:11:12,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:11:12,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:11:12,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:11:12,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:11:12,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:11:12,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:11:12,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:11:12,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:11:12,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:11:12,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:11:12,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:11:12,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:11:12,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:11:12,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:11:12,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:11:12,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:11:12,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:11:12,952 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-15 01:11:12,987 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:11:12,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:11:12,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:11:12,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:11:12,989 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:11:12,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:11:12,990 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:11:12,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:11:12,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:11:12,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:11:12,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:11:12,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:11:12,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:11:12,991 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:11:12,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:11:12,991 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:11:12,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:11:12,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:11:12,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:11:12,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:11:12,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:11:12,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:11:12,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:11:12,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:11:12,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:11:12,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:11:12,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:11:12,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:11:12,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:11:13,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:11:13,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:11:13,330 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:11:13,332 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:11:13,332 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:11:13,333 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product26.cil.c [2019-10-15 01:11:13,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e20dfb2d/3287518ffcf34f05b95fb46d14f5c544/FLAG491bb921d [2019-10-15 01:11:14,070 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:11:14,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product26.cil.c [2019-10-15 01:11:14,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e20dfb2d/3287518ffcf34f05b95fb46d14f5c544/FLAG491bb921d [2019-10-15 01:11:14,229 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e20dfb2d/3287518ffcf34f05b95fb46d14f5c544 [2019-10-15 01:11:14,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:11:14,242 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:11:14,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:11:14,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:11:14,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:11:14,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:11:14" (1/1) ... [2019-10-15 01:11:14,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39284e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:14, skipping insertion in model container [2019-10-15 01:11:14,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:11:14" (1/1) ... [2019-10-15 01:11:14,262 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:11:14,347 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:11:15,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:11:15,084 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:11:15,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:11:15,337 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:11:15,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:15 WrapperNode [2019-10-15 01:11:15,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:11:15,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:11:15,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:11:15,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:11:15,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:15" (1/1) ... [2019-10-15 01:11:15,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:15" (1/1) ... [2019-10-15 01:11:15,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:15" (1/1) ... [2019-10-15 01:11:15,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:15" (1/1) ... [2019-10-15 01:11:15,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:15" (1/1) ... [2019-10-15 01:11:15,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:15" (1/1) ... [2019-10-15 01:11:15,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:15" (1/1) ... [2019-10-15 01:11:15,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:11:15,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:11:15,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:11:15,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:11:15,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:15" (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-15 01:11:15,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:11:15,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:11:15,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:11:15,695 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:11:15,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:11:15,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:11:15,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:11:15,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:11:15,698 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:11:15,698 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:11:15,698 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-15 01:11:15,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-15 01:11:15,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-15 01:11:15,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-15 01:11:15,700 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:11:15,700 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:11:15,702 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:11:15,702 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:11:15,702 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:11:15,703 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:11:15,703 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-15 01:11:15,704 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:11:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:11:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:11:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:11:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:11:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:11:15,706 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:11:15,706 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:11:15,706 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:11:15,706 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:11:15,706 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:11:15,706 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:11:15,707 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:11:15,707 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:11:15,707 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:11:15,707 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:11:15,708 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2019-10-15 01:11:15,708 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:11:15,708 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__empty [2019-10-15 01:11:15,708 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:11:15,708 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:11:15,708 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:11:15,709 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:11:15,709 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:11:15,709 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:11:15,709 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:11:15,709 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:11:15,709 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:11:15,710 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:11:15,710 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:11:15,710 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:11:15,710 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:11:15,710 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:11:15,710 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:11:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:11:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:11:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:11:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:11:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:11:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:11:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:11:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:11:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:11:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:11:15,713 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:11:15,713 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:11:15,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:11:15,713 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:11:15,713 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:11:15,713 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:11:15,714 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:11:15,714 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:11:15,715 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:11:15,715 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:11:15,715 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:11:15,715 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:11:15,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:11:15,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:11:15,716 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:11:15,716 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:11:15,717 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:11:15,717 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:11:15,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:11:15,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:11:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:11:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:11:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:11:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:11:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:11:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:11:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:11:15,720 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:11:15,720 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:11:15,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:11:15,720 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:11:15,720 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:11:15,720 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:11:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:11:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:11:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:11:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:11:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:11:15,721 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-15 01:11:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-15 01:11:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-15 01:11:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-15 01:11:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:11:15,722 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:11:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:11:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:11:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:11:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:11:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:11:15,723 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:11:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:11:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:11:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:11:15,724 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:11:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:11:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:11:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:11:15,725 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:11:15,726 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:11:15,726 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:11:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:11:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:11:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-15 01:11:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:11:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:11:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:11:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:11:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:11:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:11:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:11:15,729 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:11:15,730 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:11:15,733 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:11:15,733 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2019-10-15 01:11:15,733 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__empty [2019-10-15 01:11:15,734 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:11:15,734 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:11:15,734 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:11:15,735 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:11:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:11:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:11:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:11:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:11:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:11:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:11:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:11:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:11:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:11:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:11:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:11:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:11:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:11:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:11:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:11:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:11:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:11:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:11:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:11:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:11:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:11:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:11:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:11:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:11:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:11:18,232 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:11:18,232 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:11:18,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:11:18 BoogieIcfgContainer [2019-10-15 01:11:18,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:11:18,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:11:18,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:11:18,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:11:18,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:11:14" (1/3) ... [2019-10-15 01:11:18,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1cc203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:11:18, skipping insertion in model container [2019-10-15 01:11:18,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:15" (2/3) ... [2019-10-15 01:11:18,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1cc203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:11:18, skipping insertion in model container [2019-10-15 01:11:18,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:11:18" (3/3) ... [2019-10-15 01:11:18,247 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product26.cil.c [2019-10-15 01:11:18,259 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:11:18,274 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:11:18,289 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:11:18,343 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:11:18,343 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:11:18,343 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:11:18,343 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:11:18,343 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:11:18,344 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:11:18,344 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:11:18,344 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:11:18,390 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states. [2019-10-15 01:11:18,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-15 01:11:18,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:18,420 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:18,422 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:18,430 INFO L82 PathProgramCache]: Analyzing trace with hash 750707123, now seen corresponding path program 1 times [2019-10-15 01:11:18,440 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:18,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021400872] [2019-10-15 01:11:18,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:18,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:18,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:19,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021400872] [2019-10-15 01:11:19,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:19,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:19,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296067121] [2019-10-15 01:11:19,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:19,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:19,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:19,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:19,060 INFO L87 Difference]: Start difference. First operand 765 states. Second operand 4 states. [2019-10-15 01:11:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:19,316 INFO L93 Difference]: Finished difference Result 1179 states and 1913 transitions. [2019-10-15 01:11:19,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:19,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-15 01:11:19,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:19,346 INFO L225 Difference]: With dead ends: 1179 [2019-10-15 01:11:19,346 INFO L226 Difference]: Without dead ends: 598 [2019-10-15 01:11:19,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:19,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-15 01:11:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-15 01:11:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:11:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 958 transitions. [2019-10-15 01:11:19,491 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 958 transitions. Word has length 87 [2019-10-15 01:11:19,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:19,492 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 958 transitions. [2019-10-15 01:11:19,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 958 transitions. [2019-10-15 01:11:19,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-15 01:11:19,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:19,498 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:19,498 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:19,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:19,499 INFO L82 PathProgramCache]: Analyzing trace with hash 773508994, now seen corresponding path program 1 times [2019-10-15 01:11:19,499 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:19,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306150127] [2019-10-15 01:11:19,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:19,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306150127] [2019-10-15 01:11:19,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:19,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:19,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748831602] [2019-10-15 01:11:19,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:19,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:19,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:19,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:19,673 INFO L87 Difference]: Start difference. First operand 598 states and 958 transitions. Second operand 4 states. [2019-10-15 01:11:19,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:19,746 INFO L93 Difference]: Finished difference Result 1159 states and 1874 transitions. [2019-10-15 01:11:19,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:19,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-15 01:11:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:19,755 INFO L225 Difference]: With dead ends: 1159 [2019-10-15 01:11:19,756 INFO L226 Difference]: Without dead ends: 598 [2019-10-15 01:11:19,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-15 01:11:19,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-15 01:11:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:11:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 957 transitions. [2019-10-15 01:11:19,820 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 957 transitions. Word has length 90 [2019-10-15 01:11:19,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:19,821 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 957 transitions. [2019-10-15 01:11:19,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 957 transitions. [2019-10-15 01:11:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 01:11:19,828 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:19,828 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:19,828 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:19,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:19,829 INFO L82 PathProgramCache]: Analyzing trace with hash -580839806, now seen corresponding path program 1 times [2019-10-15 01:11:19,829 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:19,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753565642] [2019-10-15 01:11:19,830 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,830 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:20,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753565642] [2019-10-15 01:11:20,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:20,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:20,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545120794] [2019-10-15 01:11:20,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:20,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:20,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:20,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:20,119 INFO L87 Difference]: Start difference. First operand 598 states and 957 transitions. Second operand 4 states. [2019-10-15 01:11:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:20,200 INFO L93 Difference]: Finished difference Result 1159 states and 1873 transitions. [2019-10-15 01:11:20,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:20,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-15 01:11:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:20,208 INFO L225 Difference]: With dead ends: 1159 [2019-10-15 01:11:20,209 INFO L226 Difference]: Without dead ends: 598 [2019-10-15 01:11:20,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:20,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-15 01:11:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-15 01:11:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:11:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 956 transitions. [2019-10-15 01:11:20,264 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 956 transitions. Word has length 91 [2019-10-15 01:11:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:20,264 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 956 transitions. [2019-10-15 01:11:20,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 956 transitions. [2019-10-15 01:11:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:11:20,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:20,268 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:20,269 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:20,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:20,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1251478526, now seen corresponding path program 1 times [2019-10-15 01:11:20,269 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:20,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979828154] [2019-10-15 01:11:20,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:20,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:20,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:20,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979828154] [2019-10-15 01:11:20,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:20,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:20,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319545902] [2019-10-15 01:11:20,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:20,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:20,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:20,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:20,404 INFO L87 Difference]: Start difference. First operand 598 states and 956 transitions. Second operand 4 states. [2019-10-15 01:11:20,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:20,465 INFO L93 Difference]: Finished difference Result 1159 states and 1872 transitions. [2019-10-15 01:11:20,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:20,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-15 01:11:20,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:20,471 INFO L225 Difference]: With dead ends: 1159 [2019-10-15 01:11:20,472 INFO L226 Difference]: Without dead ends: 598 [2019-10-15 01:11:20,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-15 01:11:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-15 01:11:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:11:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 955 transitions. [2019-10-15 01:11:20,504 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 955 transitions. Word has length 92 [2019-10-15 01:11:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:20,505 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 955 transitions. [2019-10-15 01:11:20,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 955 transitions. [2019-10-15 01:11:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 01:11:20,508 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:20,508 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:20,508 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1208737154, now seen corresponding path program 1 times [2019-10-15 01:11:20,509 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:20,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832102561] [2019-10-15 01:11:20,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:20,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:20,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:20,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832102561] [2019-10-15 01:11:20,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:20,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:20,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502971155] [2019-10-15 01:11:20,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:20,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:20,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:20,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:20,625 INFO L87 Difference]: Start difference. First operand 598 states and 955 transitions. Second operand 4 states. [2019-10-15 01:11:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:20,692 INFO L93 Difference]: Finished difference Result 1159 states and 1871 transitions. [2019-10-15 01:11:20,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:20,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-15 01:11:20,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:20,705 INFO L225 Difference]: With dead ends: 1159 [2019-10-15 01:11:20,706 INFO L226 Difference]: Without dead ends: 598 [2019-10-15 01:11:20,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:20,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-15 01:11:20,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-15 01:11:20,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:11:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 954 transitions. [2019-10-15 01:11:20,741 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 954 transitions. Word has length 93 [2019-10-15 01:11:20,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:20,742 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 954 transitions. [2019-10-15 01:11:20,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:20,742 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 954 transitions. [2019-10-15 01:11:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:11:20,746 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:20,747 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:20,750 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:20,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:20,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1229172839, now seen corresponding path program 1 times [2019-10-15 01:11:20,751 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:20,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036535467] [2019-10-15 01:11:20,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:20,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:20,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:20,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036535467] [2019-10-15 01:11:20,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:20,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:20,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429565317] [2019-10-15 01:11:20,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:20,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:20,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:20,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:20,924 INFO L87 Difference]: Start difference. First operand 598 states and 954 transitions. Second operand 4 states. [2019-10-15 01:11:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:20,974 INFO L93 Difference]: Finished difference Result 1159 states and 1870 transitions. [2019-10-15 01:11:20,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:20,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-15 01:11:20,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:20,982 INFO L225 Difference]: With dead ends: 1159 [2019-10-15 01:11:20,982 INFO L226 Difference]: Without dead ends: 598 [2019-10-15 01:11:20,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-15 01:11:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-15 01:11:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:11:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 953 transitions. [2019-10-15 01:11:21,011 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 953 transitions. Word has length 94 [2019-10-15 01:11:21,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:21,011 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 953 transitions. [2019-10-15 01:11:21,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 953 transitions. [2019-10-15 01:11:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:11:21,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:21,015 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:21,015 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:21,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:21,015 INFO L82 PathProgramCache]: Analyzing trace with hash 701446266, now seen corresponding path program 1 times [2019-10-15 01:11:21,015 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:21,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870942372] [2019-10-15 01:11:21,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:21,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:21,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:21,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870942372] [2019-10-15 01:11:21,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:21,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:11:21,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943005570] [2019-10-15 01:11:21,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:11:21,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:21,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:11:21,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:11:21,194 INFO L87 Difference]: Start difference. First operand 598 states and 953 transitions. Second operand 10 states. [2019-10-15 01:11:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:21,372 INFO L93 Difference]: Finished difference Result 1111 states and 1782 transitions. [2019-10-15 01:11:21,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:11:21,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-15 01:11:21,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:21,381 INFO L225 Difference]: With dead ends: 1111 [2019-10-15 01:11:21,382 INFO L226 Difference]: Without dead ends: 592 [2019-10-15 01:11:21,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:11:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-15 01:11:21,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-15 01:11:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-15 01:11:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 940 transitions. [2019-10-15 01:11:21,418 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 940 transitions. Word has length 94 [2019-10-15 01:11:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:21,420 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 940 transitions. [2019-10-15 01:11:21,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:11:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 940 transitions. [2019-10-15 01:11:21,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:11:21,422 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:21,422 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:21,422 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:21,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:21,423 INFO L82 PathProgramCache]: Analyzing trace with hash -870815129, now seen corresponding path program 1 times [2019-10-15 01:11:21,423 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:21,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613922166] [2019-10-15 01:11:21,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:21,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:21,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:21,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613922166] [2019-10-15 01:11:21,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:21,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:21,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166693770] [2019-10-15 01:11:21,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:21,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:21,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:21,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:21,707 INFO L87 Difference]: Start difference. First operand 592 states and 940 transitions. Second operand 6 states. [2019-10-15 01:11:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:21,918 INFO L93 Difference]: Finished difference Result 1105 states and 1769 transitions. [2019-10-15 01:11:21,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:21,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-15 01:11:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:21,924 INFO L225 Difference]: With dead ends: 1105 [2019-10-15 01:11:21,924 INFO L226 Difference]: Without dead ends: 592 [2019-10-15 01:11:21,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:21,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-15 01:11:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-15 01:11:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-15 01:11:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 936 transitions. [2019-10-15 01:11:21,950 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 936 transitions. Word has length 95 [2019-10-15 01:11:21,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:21,952 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 936 transitions. [2019-10-15 01:11:21,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 936 transitions. [2019-10-15 01:11:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:11:21,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:21,959 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:21,959 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:21,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:21,960 INFO L82 PathProgramCache]: Analyzing trace with hash 48330685, now seen corresponding path program 1 times [2019-10-15 01:11:21,960 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:21,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952761151] [2019-10-15 01:11:21,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:21,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:21,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:22,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952761151] [2019-10-15 01:11:22,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:22,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:22,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261185706] [2019-10-15 01:11:22,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:22,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:22,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:22,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:22,137 INFO L87 Difference]: Start difference. First operand 592 states and 936 transitions. Second operand 6 states. [2019-10-15 01:11:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:22,348 INFO L93 Difference]: Finished difference Result 1105 states and 1765 transitions. [2019-10-15 01:11:22,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:22,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-15 01:11:22,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:22,354 INFO L225 Difference]: With dead ends: 1105 [2019-10-15 01:11:22,354 INFO L226 Difference]: Without dead ends: 592 [2019-10-15 01:11:22,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-15 01:11:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-15 01:11:22,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-15 01:11:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 932 transitions. [2019-10-15 01:11:22,379 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 932 transitions. Word has length 96 [2019-10-15 01:11:22,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:22,380 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 932 transitions. [2019-10-15 01:11:22,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 932 transitions. [2019-10-15 01:11:22,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:11:22,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:22,383 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:22,383 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:22,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:22,383 INFO L82 PathProgramCache]: Analyzing trace with hash -151934484, now seen corresponding path program 1 times [2019-10-15 01:11:22,384 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:22,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416175605] [2019-10-15 01:11:22,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:22,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416175605] [2019-10-15 01:11:22,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:22,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:22,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382954337] [2019-10-15 01:11:22,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:22,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:22,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:22,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:22,507 INFO L87 Difference]: Start difference. First operand 592 states and 932 transitions. Second operand 6 states. [2019-10-15 01:11:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:22,735 INFO L93 Difference]: Finished difference Result 1105 states and 1761 transitions. [2019-10-15 01:11:22,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:22,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-15 01:11:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:22,741 INFO L225 Difference]: With dead ends: 1105 [2019-10-15 01:11:22,741 INFO L226 Difference]: Without dead ends: 592 [2019-10-15 01:11:22,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-15 01:11:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-15 01:11:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-15 01:11:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 928 transitions. [2019-10-15 01:11:22,766 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 928 transitions. Word has length 97 [2019-10-15 01:11:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:22,767 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 928 transitions. [2019-10-15 01:11:22,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 928 transitions. [2019-10-15 01:11:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:11:22,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:22,770 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:22,770 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:22,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:22,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1813612140, now seen corresponding path program 1 times [2019-10-15 01:11:22,771 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:22,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496067021] [2019-10-15 01:11:22,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:22,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496067021] [2019-10-15 01:11:22,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:22,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:22,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424144821] [2019-10-15 01:11:22,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:22,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:22,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:22,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:22,905 INFO L87 Difference]: Start difference. First operand 592 states and 928 transitions. Second operand 7 states. [2019-10-15 01:11:22,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:22,994 INFO L93 Difference]: Finished difference Result 1105 states and 1757 transitions. [2019-10-15 01:11:22,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:22,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-10-15 01:11:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:22,999 INFO L225 Difference]: With dead ends: 1105 [2019-10-15 01:11:22,999 INFO L226 Difference]: Without dead ends: 571 [2019-10-15 01:11:23,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:23,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-15 01:11:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-15 01:11:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-15 01:11:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 894 transitions. [2019-10-15 01:11:23,021 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 894 transitions. Word has length 97 [2019-10-15 01:11:23,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:23,022 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 894 transitions. [2019-10-15 01:11:23,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 894 transitions. [2019-10-15 01:11:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:11:23,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:23,024 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:23,024 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:23,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:23,025 INFO L82 PathProgramCache]: Analyzing trace with hash -694201758, now seen corresponding path program 1 times [2019-10-15 01:11:23,025 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:23,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649922274] [2019-10-15 01:11:23,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:23,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649922274] [2019-10-15 01:11:23,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:23,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:23,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596986330] [2019-10-15 01:11:23,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:23,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:23,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:23,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:23,159 INFO L87 Difference]: Start difference. First operand 571 states and 894 transitions. Second operand 6 states. [2019-10-15 01:11:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:23,337 INFO L93 Difference]: Finished difference Result 1084 states and 1723 transitions. [2019-10-15 01:11:23,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:23,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-10-15 01:11:23,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:23,342 INFO L225 Difference]: With dead ends: 1084 [2019-10-15 01:11:23,342 INFO L226 Difference]: Without dead ends: 571 [2019-10-15 01:11:23,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-15 01:11:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-15 01:11:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-15 01:11:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 893 transitions. [2019-10-15 01:11:23,364 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 893 transitions. Word has length 98 [2019-10-15 01:11:23,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:23,365 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 893 transitions. [2019-10-15 01:11:23,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:23,365 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 893 transitions. [2019-10-15 01:11:23,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 01:11:23,367 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:23,367 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:23,367 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:23,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:23,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1046367601, now seen corresponding path program 1 times [2019-10-15 01:11:23,368 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:23,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044335975] [2019-10-15 01:11:23,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:23,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044335975] [2019-10-15 01:11:23,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:23,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:23,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420263303] [2019-10-15 01:11:23,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:23,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:23,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:23,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:23,520 INFO L87 Difference]: Start difference. First operand 571 states and 893 transitions. Second operand 6 states. [2019-10-15 01:11:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:23,615 INFO L93 Difference]: Finished difference Result 1084 states and 1722 transitions. [2019-10-15 01:11:23,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:23,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-15 01:11:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:23,620 INFO L225 Difference]: With dead ends: 1084 [2019-10-15 01:11:23,620 INFO L226 Difference]: Without dead ends: 571 [2019-10-15 01:11:23,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-15 01:11:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-15 01:11:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-15 01:11:23,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 892 transitions. [2019-10-15 01:11:23,650 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 892 transitions. Word has length 99 [2019-10-15 01:11:23,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:23,650 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 892 transitions. [2019-10-15 01:11:23,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 892 transitions. [2019-10-15 01:11:23,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 01:11:23,653 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:23,653 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:23,653 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:23,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:23,654 INFO L82 PathProgramCache]: Analyzing trace with hash 540428551, now seen corresponding path program 1 times [2019-10-15 01:11:23,654 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:23,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939302063] [2019-10-15 01:11:23,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:23,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939302063] [2019-10-15 01:11:23,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:23,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:11:23,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097475320] [2019-10-15 01:11:23,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:11:23,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:23,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:11:23,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:11:23,834 INFO L87 Difference]: Start difference. First operand 571 states and 892 transitions. Second operand 12 states. [2019-10-15 01:11:23,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:23,995 INFO L93 Difference]: Finished difference Result 1085 states and 1721 transitions. [2019-10-15 01:11:23,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:11:23,995 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-10-15 01:11:23,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:24,000 INFO L225 Difference]: With dead ends: 1085 [2019-10-15 01:11:24,001 INFO L226 Difference]: Without dead ends: 571 [2019-10-15 01:11:24,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:11:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-15 01:11:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-15 01:11:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-15 01:11:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 891 transitions. [2019-10-15 01:11:24,024 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 891 transitions. Word has length 100 [2019-10-15 01:11:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:24,025 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 891 transitions. [2019-10-15 01:11:24,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:11:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 891 transitions. [2019-10-15 01:11:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:11:24,027 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:24,027 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:24,028 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:24,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:24,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1660047310, now seen corresponding path program 1 times [2019-10-15 01:11:24,028 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:24,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826699272] [2019-10-15 01:11:24,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:24,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:24,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:24,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826699272] [2019-10-15 01:11:24,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:24,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:24,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897821053] [2019-10-15 01:11:24,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:24,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:24,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:24,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:24,235 INFO L87 Difference]: Start difference. First operand 571 states and 891 transitions. Second operand 6 states. [2019-10-15 01:11:27,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:27,676 INFO L93 Difference]: Finished difference Result 1686 states and 2716 transitions. [2019-10-15 01:11:27,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:27,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-10-15 01:11:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:27,688 INFO L225 Difference]: With dead ends: 1686 [2019-10-15 01:11:27,688 INFO L226 Difference]: Without dead ends: 1181 [2019-10-15 01:11:27,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:27,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-10-15 01:11:27,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1054. [2019-10-15 01:11:27,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-10-15 01:11:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1692 transitions. [2019-10-15 01:11:27,780 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1692 transitions. Word has length 101 [2019-10-15 01:11:27,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:27,780 INFO L462 AbstractCegarLoop]: Abstraction has 1054 states and 1692 transitions. [2019-10-15 01:11:27,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1692 transitions. [2019-10-15 01:11:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:11:27,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:27,788 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:27,788 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:27,789 INFO L82 PathProgramCache]: Analyzing trace with hash 335474846, now seen corresponding path program 1 times [2019-10-15 01:11:27,789 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:27,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495321840] [2019-10-15 01:11:27,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:27,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:27,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:28,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495321840] [2019-10-15 01:11:28,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:28,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:11:28,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858225578] [2019-10-15 01:11:28,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:11:28,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:28,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:11:28,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:11:28,059 INFO L87 Difference]: Start difference. First operand 1054 states and 1692 transitions. Second operand 12 states. [2019-10-15 01:11:38,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:38,483 INFO L93 Difference]: Finished difference Result 3366 states and 5439 transitions. [2019-10-15 01:11:38,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-15 01:11:38,485 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 133 [2019-10-15 01:11:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:38,502 INFO L225 Difference]: With dead ends: 3366 [2019-10-15 01:11:38,502 INFO L226 Difference]: Without dead ends: 2378 [2019-10-15 01:11:38,509 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-15 01:11:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2019-10-15 01:11:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2320. [2019-10-15 01:11:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2019-10-15 01:11:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3712 transitions. [2019-10-15 01:11:38,626 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3712 transitions. Word has length 133 [2019-10-15 01:11:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:38,626 INFO L462 AbstractCegarLoop]: Abstraction has 2320 states and 3712 transitions. [2019-10-15 01:11:38,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:11:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3712 transitions. [2019-10-15 01:11:38,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-15 01:11:38,631 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:38,631 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:38,632 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:38,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:38,632 INFO L82 PathProgramCache]: Analyzing trace with hash -165410431, now seen corresponding path program 1 times [2019-10-15 01:11:38,632 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:38,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117180698] [2019-10-15 01:11:38,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:38,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:38,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:38,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117180698] [2019-10-15 01:11:38,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:38,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:11:38,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591258769] [2019-10-15 01:11:38,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:11:38,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:38,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:11:38,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:11:38,835 INFO L87 Difference]: Start difference. First operand 2320 states and 3712 transitions. Second operand 9 states. [2019-10-15 01:11:42,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:42,344 INFO L93 Difference]: Finished difference Result 4614 states and 7541 transitions. [2019-10-15 01:11:42,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:11:42,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-10-15 01:11:42,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:42,360 INFO L225 Difference]: With dead ends: 4614 [2019-10-15 01:11:42,360 INFO L226 Difference]: Without dead ends: 2360 [2019-10-15 01:11:42,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:11:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2019-10-15 01:11:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2344. [2019-10-15 01:11:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2344 states. [2019-10-15 01:11:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3796 transitions. [2019-10-15 01:11:42,477 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3796 transitions. Word has length 134 [2019-10-15 01:11:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:42,478 INFO L462 AbstractCegarLoop]: Abstraction has 2344 states and 3796 transitions. [2019-10-15 01:11:42,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:11:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3796 transitions. [2019-10-15 01:11:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:11:42,482 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:42,482 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:42,482 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:42,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:42,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1058567112, now seen corresponding path program 1 times [2019-10-15 01:11:42,483 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:42,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941559344] [2019-10-15 01:11:42,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:42,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:42,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:42,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941559344] [2019-10-15 01:11:42,670 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:42,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:11:42,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819891049] [2019-10-15 01:11:42,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:11:42,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:42,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:11:42,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:42,673 INFO L87 Difference]: Start difference. First operand 2344 states and 3796 transitions. Second operand 8 states. [2019-10-15 01:11:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:48,886 INFO L93 Difference]: Finished difference Result 7947 states and 13293 transitions. [2019-10-15 01:11:48,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:11:48,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2019-10-15 01:11:48,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:48,922 INFO L225 Difference]: With dead ends: 7947 [2019-10-15 01:11:48,922 INFO L226 Difference]: Without dead ends: 5669 [2019-10-15 01:11:48,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:11:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2019-10-15 01:11:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 5621. [2019-10-15 01:11:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5621 states. [2019-10-15 01:11:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5621 states to 5621 states and 8997 transitions. [2019-10-15 01:11:49,192 INFO L78 Accepts]: Start accepts. Automaton has 5621 states and 8997 transitions. Word has length 135 [2019-10-15 01:11:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:49,192 INFO L462 AbstractCegarLoop]: Abstraction has 5621 states and 8997 transitions. [2019-10-15 01:11:49,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:11:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5621 states and 8997 transitions. [2019-10-15 01:11:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:11:49,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:49,196 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:11:49,197 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:49,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:49,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2066663089, now seen corresponding path program 1 times [2019-10-15 01:11:49,197 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:49,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170071086] [2019-10-15 01:11:49,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:49,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:49,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:49,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170071086] [2019-10-15 01:11:49,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:49,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:11:49,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096203574] [2019-10-15 01:11:49,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:11:49,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:49,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:11:49,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:11:49,383 INFO L87 Difference]: Start difference. First operand 5621 states and 8997 transitions. Second operand 9 states.