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_spec3_product18.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:11:31,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:11:31,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:11:31,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:11:31,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:11:31,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:11:31,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:11:31,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:11:31,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:11:31,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:11:31,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:11:31,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:11:31,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:11:31,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:11:31,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:11:31,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:11:31,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:11:31,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:11:31,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:11:31,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:11:31,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:11:31,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:11:31,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:11:31,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:11:31,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:11:31,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:11:31,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:11:31,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:11:31,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:11:31,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:11:31,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:11:31,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:11:31,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:11:31,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:11:31,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:11:31,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:11:31,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:11:31,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:11:31,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:11:31,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:11:31,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:11:31,716 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-13 21:11:31,749 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:11:31,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:11:31,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:11:31,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:11:31,751 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:11:31,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:11:31,751 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:11:31,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:11:31,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:11:31,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:11:31,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:11:31,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:11:31,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:11:31,753 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:11:31,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:11:31,753 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:11:31,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:11:31,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:11:31,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:11:31,754 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:11:31,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:11:31,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:11:31,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:11:31,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:11:31,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:11:31,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:11:31,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:11:31,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:11:31,762 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-13 21:11:32,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:11:32,061 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:11:32,064 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:11:32,066 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:11:32,066 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:11:32,067 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product18.cil.c [2019-10-13 21:11:32,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aae0083b/f0a9ff1d18e549f19b7a76bc57f56136/FLAG8536c83cc [2019-10-13 21:11:32,794 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:11:32,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product18.cil.c [2019-10-13 21:11:32,816 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aae0083b/f0a9ff1d18e549f19b7a76bc57f56136/FLAG8536c83cc [2019-10-13 21:11:32,935 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aae0083b/f0a9ff1d18e549f19b7a76bc57f56136 [2019-10-13 21:11:32,945 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:11:32,947 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:11:32,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:32,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:11:32,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:11:32,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:32" (1/1) ... [2019-10-13 21:11:32,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4771d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:32, skipping insertion in model container [2019-10-13 21:11:32,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:32" (1/1) ... [2019-10-13 21:11:32,964 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:11:33,048 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:11:33,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:33,817 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:11:33,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:34,033 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:11:34,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34 WrapperNode [2019-10-13 21:11:34,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:34,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:11:34,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:11:34,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:11:34,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (1/1) ... [2019-10-13 21:11:34,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (1/1) ... [2019-10-13 21:11:34,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (1/1) ... [2019-10-13 21:11:34,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (1/1) ... [2019-10-13 21:11:34,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (1/1) ... [2019-10-13 21:11:34,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (1/1) ... [2019-10-13 21:11:34,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (1/1) ... [2019-10-13 21:11:34,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:11:34,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:11:34,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:11:34,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:11:34,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (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-13 21:11:34,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:11:34,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:11:34,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:34,294 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:11:34,294 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:11:34,294 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:11:34,294 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:11:34,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:34,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:34,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:34,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:11:34,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:11:34,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:11:34,296 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:11:34,296 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:11:34,296 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:11:34,297 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:11:34,297 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:11:34,297 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:11:34,297 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:11:34,298 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:11:34,298 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:11:34,299 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:11:34,300 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:11:34,300 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:11:34,300 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:11:34,300 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:11:34,300 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:11:34,301 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:11:34,301 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:11:34,301 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:11:34,301 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:11:34,301 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:11:34,302 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:11:34,302 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:11:34,302 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:11:34,302 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:11:34,303 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:11:34,304 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:11:34,304 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:11:34,304 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:11:34,304 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:11:34,305 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:11:34,305 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:11:34,305 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:11:34,305 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:11:34,306 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:11:34,306 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:11:34,306 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:11:34,306 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:11:34,307 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:11:34,307 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:11:34,307 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:11:34,307 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:11:34,308 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:11:34,308 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:11:34,308 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:11:34,308 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:11:34,309 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:34,309 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:11:34,309 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:11:34,309 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2019-10-13 21:11:34,309 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:11:34,310 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__weight [2019-10-13 21:11:34,310 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:11:34,310 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:11:34,311 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:11:34,311 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:11:34,311 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:11:34,311 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:34,311 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:34,312 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:11:34,312 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:11:34,313 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:11:34,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:11:34,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:11:34,313 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:11:34,314 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:11:34,314 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:11:34,315 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:11:34,315 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:11:34,315 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:11:34,316 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:11:34,316 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:34,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:11:34,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:11:34,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:11:34,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:11:34,318 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:34,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:11:34,319 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:34,319 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:34,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:11:34,319 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:11:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:11:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:11:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:11:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:11:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:11:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:11:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:11:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:11:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:11:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:11:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:11:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:11:34,323 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:11:34,323 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:11:34,323 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:11:34,324 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:11:34,324 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:11:34,324 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:11:34,324 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:11:34,325 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:11:34,325 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:11:34,325 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:11:34,325 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:11:34,326 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:11:34,326 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:11:34,326 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:11:34,327 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:11:34,327 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:11:34,327 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:11:34,327 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:11:34,329 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:11:34,329 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:11:34,329 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:11:34,329 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:11:34,330 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:11:34,330 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:11:34,330 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:11:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:11:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:11:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:11:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:11:34,332 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:11:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:11:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:11:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:11:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:11:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:11:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:11:34,339 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:11:34,339 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:11:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:11:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:11:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:11:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:11:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:11:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:11:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:11:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:11:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2019-10-13 21:11:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__weight [2019-10-13 21:11:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:11:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:11:34,348 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:11:34,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:11:34,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:11:34,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:11:36,531 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:11:36,532 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:11:36,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:36 BoogieIcfgContainer [2019-10-13 21:11:36,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:11:36,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:11:36,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:11:36,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:11:36,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:11:32" (1/3) ... [2019-10-13 21:11:36,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4d9a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:36, skipping insertion in model container [2019-10-13 21:11:36,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (2/3) ... [2019-10-13 21:11:36,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4d9a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:36, skipping insertion in model container [2019-10-13 21:11:36,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:36" (3/3) ... [2019-10-13 21:11:36,543 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product18.cil.c [2019-10-13 21:11:36,553 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:11:36,566 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:11:36,577 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:11:36,622 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:11:36,622 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:11:36,623 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:11:36,623 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:11:36,623 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:11:36,623 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:11:36,623 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:11:36,624 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:11:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states. [2019-10-13 21:11:36,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 21:11:36,689 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:36,690 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:36,693 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:36,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:36,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1366421017, now seen corresponding path program 1 times [2019-10-13 21:11:36,708 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:36,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453821547] [2019-10-13 21:11:36,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:36,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:36,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:37,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453821547] [2019-10-13 21:11:37,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:37,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:37,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582763232] [2019-10-13 21:11:37,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:37,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:37,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:37,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:37,505 INFO L87 Difference]: Start difference. First operand 781 states. Second operand 7 states. [2019-10-13 21:11:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:37,789 INFO L93 Difference]: Finished difference Result 1227 states and 1992 transitions. [2019-10-13 21:11:37,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:37,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-10-13 21:11:37,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:37,828 INFO L225 Difference]: With dead ends: 1227 [2019-10-13 21:11:37,828 INFO L226 Difference]: Without dead ends: 622 [2019-10-13 21:11:37,839 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-13 21:11:37,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-10-13 21:11:37,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 620. [2019-10-13 21:11:37,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-13 21:11:37,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 991 transitions. [2019-10-13 21:11:37,970 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 991 transitions. Word has length 93 [2019-10-13 21:11:37,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:37,971 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 991 transitions. [2019-10-13 21:11:37,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:37,971 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 991 transitions. [2019-10-13 21:11:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:11:37,987 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:37,987 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:37,987 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:37,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:37,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1643390832, now seen corresponding path program 1 times [2019-10-13 21:11:37,988 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:37,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042910475] [2019-10-13 21:11:37,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:37,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:37,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:38,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:38,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042910475] [2019-10-13 21:11:38,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:38,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:38,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503517466] [2019-10-13 21:11:38,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:38,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:38,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:38,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:38,217 INFO L87 Difference]: Start difference. First operand 620 states and 991 transitions. Second operand 4 states. [2019-10-13 21:11:38,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:38,360 INFO L93 Difference]: Finished difference Result 1206 states and 1947 transitions. [2019-10-13 21:11:38,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:38,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-13 21:11:38,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:38,367 INFO L225 Difference]: With dead ends: 1206 [2019-10-13 21:11:38,367 INFO L226 Difference]: Without dead ends: 602 [2019-10-13 21:11:38,371 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-13 21:11:38,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-13 21:11:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-13 21:11:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-13 21:11:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 958 transitions. [2019-10-13 21:11:38,415 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 958 transitions. Word has length 94 [2019-10-13 21:11:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:38,416 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 958 transitions. [2019-10-13 21:11:38,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 958 transitions. [2019-10-13 21:11:38,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:11:38,420 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:38,420 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:38,420 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:38,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:38,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1305237044, now seen corresponding path program 1 times [2019-10-13 21:11:38,421 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:38,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826770012] [2019-10-13 21:11:38,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:38,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:38,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:38,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826770012] [2019-10-13 21:11:38,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:38,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:38,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282196133] [2019-10-13 21:11:38,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:38,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:38,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:38,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:38,640 INFO L87 Difference]: Start difference. First operand 602 states and 958 transitions. Second operand 7 states. [2019-10-13 21:11:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:38,744 INFO L93 Difference]: Finished difference Result 1175 states and 1889 transitions. [2019-10-13 21:11:38,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:38,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-13 21:11:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:38,751 INFO L225 Difference]: With dead ends: 1175 [2019-10-13 21:11:38,751 INFO L226 Difference]: Without dead ends: 596 [2019-10-13 21:11:38,754 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-13 21:11:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-13 21:11:38,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-13 21:11:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-13 21:11:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 945 transitions. [2019-10-13 21:11:38,782 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 945 transitions. Word has length 94 [2019-10-13 21:11:38,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:38,782 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 945 transitions. [2019-10-13 21:11:38,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 945 transitions. [2019-10-13 21:11:38,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:11:38,784 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:38,784 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:38,785 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:38,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:38,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1548689565, now seen corresponding path program 1 times [2019-10-13 21:11:38,785 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:38,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102642049] [2019-10-13 21:11:38,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:38,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:38,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:38,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102642049] [2019-10-13 21:11:38,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:38,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:38,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883274166] [2019-10-13 21:11:38,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:38,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:38,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:38,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:38,957 INFO L87 Difference]: Start difference. First operand 596 states and 945 transitions. Second operand 7 states. [2019-10-13 21:11:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:39,061 INFO L93 Difference]: Finished difference Result 1163 states and 1863 transitions. [2019-10-13 21:11:39,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:39,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-13 21:11:39,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:39,068 INFO L225 Difference]: With dead ends: 1163 [2019-10-13 21:11:39,068 INFO L226 Difference]: Without dead ends: 590 [2019-10-13 21:11:39,073 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-13 21:11:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-13 21:11:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-13 21:11:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-13 21:11:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 932 transitions. [2019-10-13 21:11:39,106 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 932 transitions. Word has length 95 [2019-10-13 21:11:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:39,107 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 932 transitions. [2019-10-13 21:11:39,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 932 transitions. [2019-10-13 21:11:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:11:39,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:39,109 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:39,110 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:39,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:39,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1649028488, now seen corresponding path program 1 times [2019-10-13 21:11:39,110 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:39,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966066174] [2019-10-13 21:11:39,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:39,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966066174] [2019-10-13 21:11:39,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:39,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:39,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036555488] [2019-10-13 21:11:39,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:39,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:39,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:39,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:39,365 INFO L87 Difference]: Start difference. First operand 590 states and 932 transitions. Second operand 7 states. [2019-10-13 21:11:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:39,466 INFO L93 Difference]: Finished difference Result 1151 states and 1837 transitions. [2019-10-13 21:11:39,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:39,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-13 21:11:39,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:39,477 INFO L225 Difference]: With dead ends: 1151 [2019-10-13 21:11:39,477 INFO L226 Difference]: Without dead ends: 584 [2019-10-13 21:11:39,481 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-13 21:11:39,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-13 21:11:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-13 21:11:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-13 21:11:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 919 transitions. [2019-10-13 21:11:39,508 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 919 transitions. Word has length 96 [2019-10-13 21:11:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:39,509 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 919 transitions. [2019-10-13 21:11:39,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 919 transitions. [2019-10-13 21:11:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:11:39,512 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:39,512 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:39,512 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:39,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:39,513 INFO L82 PathProgramCache]: Analyzing trace with hash -260086663, now seen corresponding path program 1 times [2019-10-13 21:11:39,513 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:39,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110339271] [2019-10-13 21:11:39,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:39,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110339271] [2019-10-13 21:11:39,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:39,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:39,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223573701] [2019-10-13 21:11:39,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:39,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:39,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:39,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:39,676 INFO L87 Difference]: Start difference. First operand 584 states and 919 transitions. Second operand 7 states. [2019-10-13 21:11:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:39,765 INFO L93 Difference]: Finished difference Result 1139 states and 1811 transitions. [2019-10-13 21:11:39,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:39,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-13 21:11:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:39,773 INFO L225 Difference]: With dead ends: 1139 [2019-10-13 21:11:39,773 INFO L226 Difference]: Without dead ends: 584 [2019-10-13 21:11:39,776 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-13 21:11:39,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-13 21:11:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-13 21:11:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-13 21:11:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 918 transitions. [2019-10-13 21:11:39,801 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 918 transitions. Word has length 96 [2019-10-13 21:11:39,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:39,801 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 918 transitions. [2019-10-13 21:11:39,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:39,802 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 918 transitions. [2019-10-13 21:11:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:11:39,804 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:39,804 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:39,805 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:39,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:39,805 INFO L82 PathProgramCache]: Analyzing trace with hash 146115361, now seen corresponding path program 1 times [2019-10-13 21:11:39,805 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:39,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983851428] [2019-10-13 21:11:39,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:40,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:40,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983851428] [2019-10-13 21:11:40,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:40,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:40,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705601400] [2019-10-13 21:11:40,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:40,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:40,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:40,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:40,022 INFO L87 Difference]: Start difference. First operand 584 states and 918 transitions. Second operand 5 states. [2019-10-13 21:11:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:40,105 INFO L93 Difference]: Finished difference Result 1138 states and 1808 transitions. [2019-10-13 21:11:40,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:40,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-13 21:11:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:40,110 INFO L225 Difference]: With dead ends: 1138 [2019-10-13 21:11:40,110 INFO L226 Difference]: Without dead ends: 584 [2019-10-13 21:11:40,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-13 21:11:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-13 21:11:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-13 21:11:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 917 transitions. [2019-10-13 21:11:40,137 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 917 transitions. Word has length 97 [2019-10-13 21:11:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:40,137 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 917 transitions. [2019-10-13 21:11:40,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 917 transitions. [2019-10-13 21:11:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:11:40,142 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:40,143 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:40,143 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:40,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:40,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1759564154, now seen corresponding path program 1 times [2019-10-13 21:11:40,143 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:40,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002192525] [2019-10-13 21:11:40,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:40,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002192525] [2019-10-13 21:11:40,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:40,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:40,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986301833] [2019-10-13 21:11:40,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:40,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:40,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:40,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:40,288 INFO L87 Difference]: Start difference. First operand 584 states and 917 transitions. Second operand 5 states. [2019-10-13 21:11:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:40,359 INFO L93 Difference]: Finished difference Result 1138 states and 1806 transitions. [2019-10-13 21:11:40,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:40,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-13 21:11:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:40,364 INFO L225 Difference]: With dead ends: 1138 [2019-10-13 21:11:40,365 INFO L226 Difference]: Without dead ends: 584 [2019-10-13 21:11:40,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-13 21:11:40,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-13 21:11:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-13 21:11:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 916 transitions. [2019-10-13 21:11:40,394 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 916 transitions. Word has length 98 [2019-10-13 21:11:40,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:40,394 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 916 transitions. [2019-10-13 21:11:40,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:40,395 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 916 transitions. [2019-10-13 21:11:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 21:11:40,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:40,396 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:40,397 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:40,397 INFO L82 PathProgramCache]: Analyzing trace with hash -153149156, now seen corresponding path program 1 times [2019-10-13 21:11:40,397 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:40,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556505275] [2019-10-13 21:11:40,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:40,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556505275] [2019-10-13 21:11:40,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:40,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:40,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940273841] [2019-10-13 21:11:40,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:40,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:40,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:40,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:40,554 INFO L87 Difference]: Start difference. First operand 584 states and 916 transitions. Second operand 5 states. [2019-10-13 21:11:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:40,647 INFO L93 Difference]: Finished difference Result 1138 states and 1804 transitions. [2019-10-13 21:11:40,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:40,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-13 21:11:40,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:40,654 INFO L225 Difference]: With dead ends: 1138 [2019-10-13 21:11:40,654 INFO L226 Difference]: Without dead ends: 584 [2019-10-13 21:11:40,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-13 21:11:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-13 21:11:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-13 21:11:40,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 915 transitions. [2019-10-13 21:11:40,680 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 915 transitions. Word has length 99 [2019-10-13 21:11:40,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:40,681 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 915 transitions. [2019-10-13 21:11:40,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 915 transitions. [2019-10-13 21:11:40,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 21:11:40,682 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:40,683 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:40,683 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:40,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:40,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1340953951, now seen corresponding path program 1 times [2019-10-13 21:11:40,684 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:40,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996676667] [2019-10-13 21:11:40,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:40,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996676667] [2019-10-13 21:11:40,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:40,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:40,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144476924] [2019-10-13 21:11:40,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:40,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:40,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:40,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:40,859 INFO L87 Difference]: Start difference. First operand 584 states and 915 transitions. Second operand 5 states. [2019-10-13 21:11:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:40,929 INFO L93 Difference]: Finished difference Result 1138 states and 1802 transitions. [2019-10-13 21:11:40,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:40,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-13 21:11:40,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:40,936 INFO L225 Difference]: With dead ends: 1138 [2019-10-13 21:11:40,936 INFO L226 Difference]: Without dead ends: 584 [2019-10-13 21:11:40,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-13 21:11:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-13 21:11:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-13 21:11:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 914 transitions. [2019-10-13 21:11:40,969 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 914 transitions. Word has length 100 [2019-10-13 21:11:40,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:40,969 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 914 transitions. [2019-10-13 21:11:40,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 914 transitions. [2019-10-13 21:11:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:11:40,972 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:40,972 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:40,972 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:40,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:40,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1311064363, now seen corresponding path program 1 times [2019-10-13 21:11:40,973 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:40,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798013171] [2019-10-13 21:11:40,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:41,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798013171] [2019-10-13 21:11:41,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:41,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:11:41,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145913919] [2019-10-13 21:11:41,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:11:41,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:41,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:11:41,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:41,142 INFO L87 Difference]: Start difference. First operand 584 states and 914 transitions. Second operand 9 states. [2019-10-13 21:11:41,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:41,337 INFO L93 Difference]: Finished difference Result 1140 states and 1801 transitions. [2019-10-13 21:11:41,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:11:41,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-10-13 21:11:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:41,346 INFO L225 Difference]: With dead ends: 1140 [2019-10-13 21:11:41,346 INFO L226 Difference]: Without dead ends: 584 [2019-10-13 21:11:41,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:11:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-13 21:11:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-13 21:11:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-13 21:11:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 913 transitions. [2019-10-13 21:11:41,389 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 913 transitions. Word has length 101 [2019-10-13 21:11:41,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:41,391 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 913 transitions. [2019-10-13 21:11:41,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:11:41,391 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 913 transitions. [2019-10-13 21:11:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:11:41,394 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:41,394 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:41,394 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:41,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:41,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1044740887, now seen corresponding path program 1 times [2019-10-13 21:11:41,395 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:41,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065364258] [2019-10-13 21:11:41,396 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:41,396 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:41,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:41,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065364258] [2019-10-13 21:11:41,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:41,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:11:41,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538150840] [2019-10-13 21:11:41,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:11:41,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:41,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:11:41,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:41,712 INFO L87 Difference]: Start difference. First operand 584 states and 913 transitions. Second operand 8 states. [2019-10-13 21:11:44,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:44,999 INFO L93 Difference]: Finished difference Result 2123 states and 3381 transitions. [2019-10-13 21:11:45,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:11:45,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-10-13 21:11:45,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:45,011 INFO L225 Difference]: With dead ends: 2123 [2019-10-13 21:11:45,012 INFO L226 Difference]: Without dead ends: 1573 [2019-10-13 21:11:45,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:45,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2019-10-13 21:11:45,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1561. [2019-10-13 21:11:45,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2019-10-13 21:11:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2446 transitions. [2019-10-13 21:11:45,075 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2446 transitions. Word has length 101 [2019-10-13 21:11:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:45,076 INFO L462 AbstractCegarLoop]: Abstraction has 1561 states and 2446 transitions. [2019-10-13 21:11:45,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:11:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2446 transitions. [2019-10-13 21:11:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:11:45,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:45,077 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:45,078 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:45,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1821089815, now seen corresponding path program 1 times [2019-10-13 21:11:45,078 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:45,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903125881] [2019-10-13 21:11:45,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:45,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:45,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:45,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:11:45,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903125881] [2019-10-13 21:11:45,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677428474] [2019-10-13 21:11:45,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:45,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 2951 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:45,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:45,909 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:46,005 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:46,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-13 21:11:46,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900852625] [2019-10-13 21:11:46,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:46,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:46,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:46,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:46,007 INFO L87 Difference]: Start difference. First operand 1561 states and 2446 transitions. Second operand 3 states. [2019-10-13 21:11:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:46,148 INFO L93 Difference]: Finished difference Result 4487 states and 7168 transitions. [2019-10-13 21:11:46,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:46,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-13 21:11:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:46,175 INFO L225 Difference]: With dead ends: 4487 [2019-10-13 21:11:46,176 INFO L226 Difference]: Without dead ends: 2960 [2019-10-13 21:11:46,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:46,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2019-10-13 21:11:46,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 2854. [2019-10-13 21:11:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2854 states. [2019-10-13 21:11:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 4538 transitions. [2019-10-13 21:11:46,314 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 4538 transitions. Word has length 101 [2019-10-13 21:11:46,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:46,314 INFO L462 AbstractCegarLoop]: Abstraction has 2854 states and 4538 transitions. [2019-10-13 21:11:46,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:46,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 4538 transitions. [2019-10-13 21:11:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 21:11:46,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:46,316 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:46,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:46,524 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:46,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:46,525 INFO L82 PathProgramCache]: Analyzing trace with hash -904097083, now seen corresponding path program 1 times [2019-10-13 21:11:46,525 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:46,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846032240] [2019-10-13 21:11:46,526 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:46,526 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:46,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:46,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846032240] [2019-10-13 21:11:46,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:46,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:46,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799457104] [2019-10-13 21:11:46,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:46,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:46,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:46,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:46,673 INFO L87 Difference]: Start difference. First operand 2854 states and 4538 transitions. Second operand 7 states. [2019-10-13 21:11:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:49,690 INFO L93 Difference]: Finished difference Result 8466 states and 13781 transitions. [2019-10-13 21:11:49,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:49,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-10-13 21:11:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:49,736 INFO L225 Difference]: With dead ends: 8466 [2019-10-13 21:11:49,737 INFO L226 Difference]: Without dead ends: 5646 [2019-10-13 21:11:49,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:49,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5646 states. [2019-10-13 21:11:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5646 to 5562. [2019-10-13 21:11:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5562 states. [2019-10-13 21:11:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5562 states to 5562 states and 8972 transitions. [2019-10-13 21:11:50,007 INFO L78 Accepts]: Start accepts. Automaton has 5562 states and 8972 transitions. Word has length 105 [2019-10-13 21:11:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:50,008 INFO L462 AbstractCegarLoop]: Abstraction has 5562 states and 8972 transitions. [2019-10-13 21:11:50,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 5562 states and 8972 transitions. [2019-10-13 21:11:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 21:11:50,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:50,011 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:50,012 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:50,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1738268530, now seen corresponding path program 1 times [2019-10-13 21:11:50,012 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:50,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260367281] [2019-10-13 21:11:50,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:50,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:50,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:11:50,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260367281] [2019-10-13 21:11:50,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471829171] [2019-10-13 21:11:50,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:50,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 2952 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:50,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:50,928 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:51,033 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:51,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-13 21:11:51,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398291595] [2019-10-13 21:11:51,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:51,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:51,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:51,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:51,042 INFO L87 Difference]: Start difference. First operand 5562 states and 8972 transitions. Second operand 3 states. [2019-10-13 21:11:51,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:51,286 INFO L93 Difference]: Finished difference Result 12253 states and 19941 transitions. [2019-10-13 21:11:51,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:51,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-13 21:11:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:51,373 INFO L225 Difference]: With dead ends: 12253 [2019-10-13 21:11:51,373 INFO L226 Difference]: Without dead ends: 6725 [2019-10-13 21:11:51,408 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6725 states. [2019-10-13 21:11:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6725 to 6536. [2019-10-13 21:11:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-10-13 21:11:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 10542 transitions. [2019-10-13 21:11:51,731 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 10542 transitions. Word has length 102 [2019-10-13 21:11:51,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:51,732 INFO L462 AbstractCegarLoop]: Abstraction has 6536 states and 10542 transitions. [2019-10-13 21:11:51,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 10542 transitions. [2019-10-13 21:11:51,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 21:11:51,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:51,735 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:51,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:51,945 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:51,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:51,945 INFO L82 PathProgramCache]: Analyzing trace with hash 895998947, now seen corresponding path program 1 times [2019-10-13 21:11:51,946 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:51,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830793288] [2019-10-13 21:11:51,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:51,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:51,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:52,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830793288] [2019-10-13 21:11:52,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:52,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:52,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236783150] [2019-10-13 21:11:52,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:52,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:52,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:52,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:52,212 INFO L87 Difference]: Start difference. First operand 6536 states and 10542 transitions. Second operand 4 states. [2019-10-13 21:11:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:52,535 INFO L93 Difference]: Finished difference Result 13030 states and 21221 transitions. [2019-10-13 21:11:52,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:52,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-13 21:11:52,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:52,608 INFO L225 Difference]: With dead ends: 13030 [2019-10-13 21:11:52,608 INFO L226 Difference]: Without dead ends: 6528 [2019-10-13 21:11:52,641 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-13 21:11:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6528 states. [2019-10-13 21:11:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 6506. [2019-10-13 21:11:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2019-10-13 21:11:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 10454 transitions. [2019-10-13 21:11:52,905 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 10454 transitions. Word has length 105 [2019-10-13 21:11:52,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:52,905 INFO L462 AbstractCegarLoop]: Abstraction has 6506 states and 10454 transitions. [2019-10-13 21:11:52,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:52,905 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 10454 transitions. [2019-10-13 21:11:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:11:52,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:52,908 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:52,908 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:52,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:52,909 INFO L82 PathProgramCache]: Analyzing trace with hash 371384462, now seen corresponding path program 1 times [2019-10-13 21:11:52,909 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:52,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47456715] [2019-10-13 21:11:52,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:11:53,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47456715] [2019-10-13 21:11:53,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:53,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:53,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792941437] [2019-10-13 21:11:53,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:53,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:53,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:53,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:53,049 INFO L87 Difference]: Start difference. First operand 6506 states and 10454 transitions. Second operand 7 states. [2019-10-13 21:11:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:55,991 INFO L93 Difference]: Finished difference Result 19472 states and 32093 transitions. [2019-10-13 21:11:55,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:55,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-10-13 21:11:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:56,114 INFO L225 Difference]: With dead ends: 19472 [2019-10-13 21:11:56,115 INFO L226 Difference]: Without dead ends: 13000 [2019-10-13 21:11:56,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13000 states. [2019-10-13 21:11:57,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13000 to 12872. [2019-10-13 21:11:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12872 states. [2019-10-13 21:11:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12872 states to 12872 states and 21078 transitions. [2019-10-13 21:11:57,411 INFO L78 Accepts]: Start accepts. Automaton has 12872 states and 21078 transitions. Word has length 113 [2019-10-13 21:11:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:57,411 INFO L462 AbstractCegarLoop]: Abstraction has 12872 states and 21078 transitions. [2019-10-13 21:11:57,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 12872 states and 21078 transitions. [2019-10-13 21:11:57,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:11:57,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:57,414 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:57,414 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:57,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:57,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1426044095, now seen corresponding path program 1 times [2019-10-13 21:11:57,415 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:57,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934912638] [2019-10-13 21:11:57,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:57,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:57,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:11:57,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934912638] [2019-10-13 21:11:57,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:57,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:57,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564462148] [2019-10-13 21:11:57,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:57,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:57,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:57,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:57,518 INFO L87 Difference]: Start difference. First operand 12872 states and 21078 transitions. Second operand 4 states. [2019-10-13 21:11:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:57,923 INFO L93 Difference]: Finished difference Result 25772 states and 42663 transitions. [2019-10-13 21:11:57,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:57,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 21:11:57,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:58,024 INFO L225 Difference]: With dead ends: 25772 [2019-10-13 21:11:58,024 INFO L226 Difference]: Without dead ends: 12928 [2019-10-13 21:11:58,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:58,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12928 states. [2019-10-13 21:11:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12928 to 12880. [2019-10-13 21:11:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12880 states. [2019-10-13 21:11:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12880 states to 12880 states and 21029 transitions. [2019-10-13 21:11:58,837 INFO L78 Accepts]: Start accepts. Automaton has 12880 states and 21029 transitions. Word has length 114 [2019-10-13 21:11:58,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:58,838 INFO L462 AbstractCegarLoop]: Abstraction has 12880 states and 21029 transitions. [2019-10-13 21:11:58,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 12880 states and 21029 transitions. [2019-10-13 21:11:58,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-13 21:11:58,840 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:58,840 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:58,841 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:58,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:58,841 INFO L82 PathProgramCache]: Analyzing trace with hash -409974559, now seen corresponding path program 1 times [2019-10-13 21:11:58,841 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:58,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719550892] [2019-10-13 21:11:58,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:58,842 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:58,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:58,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719550892] [2019-10-13 21:11:58,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:58,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:58,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661745453] [2019-10-13 21:11:58,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:58,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:58,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:58,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:58,980 INFO L87 Difference]: Start difference. First operand 12880 states and 21029 transitions. Second operand 7 states. [2019-10-13 21:12:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:02,103 INFO L93 Difference]: Finished difference Result 38710 states and 65262 transitions. [2019-10-13 21:12:02,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:02,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2019-10-13 21:12:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:02,301 INFO L225 Difference]: With dead ends: 38710 [2019-10-13 21:12:02,301 INFO L226 Difference]: Without dead ends: 25864 [2019-10-13 21:12:02,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:12:02,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25864 states.