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_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:11:45,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:11:45,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:11:45,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:11:45,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:11:45,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:11:45,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:11:45,432 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:11:45,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:11:45,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:11:45,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:11:45,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:11:45,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:11:45,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:11:45,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:11:45,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:11:45,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:11:45,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:11:45,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:11:45,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:11:45,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:11:45,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:11:45,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:11:45,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:11:45,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:11:45,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:11:45,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:11:45,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:11:45,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:11:45,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:11:45,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:11:45,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:11:45,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:11:45,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:11:45,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:11:45,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:11:45,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:11:45,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:11:45,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:11:45,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:11:45,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:11:45,480 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:45,512 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:11:45,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:11:45,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:11:45,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:11:45,514 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:11:45,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:11:45,517 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:11:45,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:11:45,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:11:45,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:11:45,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:11:45,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:11:45,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:11:45,519 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:11:45,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:11:45,519 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:11:45,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:11:45,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:11:45,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:11:45,520 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:11:45,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:11:45,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:11:45,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:11:45,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:11:45,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:11:45,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:11:45,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:11:45,523 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:11:45,523 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:45,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:11:45,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:11:45,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:11:45,832 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:11:45,832 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:11:45,833 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product26.cil.c [2019-10-13 21:11:45,905 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fabce41e6/7cef688c7c5f4c6b9391d0dde14bed7d/FLAGe256570ab [2019-10-13 21:11:46,518 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:11:46,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product26.cil.c [2019-10-13 21:11:46,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fabce41e6/7cef688c7c5f4c6b9391d0dde14bed7d/FLAGe256570ab [2019-10-13 21:11:46,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fabce41e6/7cef688c7c5f4c6b9391d0dde14bed7d [2019-10-13 21:11:46,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:11:46,749 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:11:46,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:46,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:11:46,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:11:46,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:46" (1/1) ... [2019-10-13 21:11:46,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b14516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:46, skipping insertion in model container [2019-10-13 21:11:46,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:46" (1/1) ... [2019-10-13 21:11:46,764 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:11:46,850 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:11:47,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:47,517 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:11:47,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:47,748 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:11:47,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:47 WrapperNode [2019-10-13 21:11:47,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:47,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:11:47,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:11:47,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:11:47,770 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:47" (1/1) ... [2019-10-13 21:11:47,771 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:47" (1/1) ... [2019-10-13 21:11:47,839 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:47" (1/1) ... [2019-10-13 21:11:47,839 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:47" (1/1) ... [2019-10-13 21:11:47,935 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:47" (1/1) ... [2019-10-13 21:11:47,966 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:47" (1/1) ... [2019-10-13 21:11:47,985 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:47" (1/1) ... [2019-10-13 21:11:48,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:11:48,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:11:48,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:11:48,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:11:48,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:47" (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:48,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:11:48,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:11:48,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:48,073 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:11:48,074 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:11:48,074 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:11:48,074 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:11:48,074 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:11:48,075 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:11:48,075 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:11:48,075 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:11:48,075 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:11:48,076 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:11:48,076 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:11:48,076 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:11:48,076 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:11:48,076 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:11:48,077 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:11:48,077 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:11:48,077 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:11:48,077 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:11:48,078 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:11:48,078 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:11:48,078 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:11:48,078 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:11:48,078 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:11:48,079 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:11:48,079 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:11:48,079 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:11:48,079 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-13 21:11:48,080 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:11:48,080 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:11:48,080 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:11:48,080 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:11:48,080 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:11:48,081 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:11:48,081 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:11:48,081 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:11:48,081 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:11:48,081 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:11:48,082 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:11:48,082 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:11:48,082 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:11:48,082 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:48,082 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:11:48,082 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:11:48,083 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2019-10-13 21:11:48,083 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:11:48,083 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__empty [2019-10-13 21:11:48,083 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:11:48,083 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:11:48,083 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:48,083 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:48,083 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:48,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:11:48,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:11:48,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:11:48,084 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:11:48,084 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:11:48,084 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:11:48,084 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:11:48,084 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:11:48,085 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:11:48,085 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:11:48,085 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:11:48,085 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:11:48,085 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:11:48,085 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:11:48,085 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:11:48,086 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:11:48,086 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:11:48,086 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:11:48,086 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:11:48,086 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:48,086 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:48,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:11:48,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:11:48,087 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:11:48,087 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:11:48,087 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:11:48,087 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:11:48,087 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:11:48,088 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:11:48,088 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:11:48,088 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:11:48,088 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:11:48,088 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:11:48,089 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:11:48,089 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:11:48,089 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:11:48,089 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:11:48,089 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:11:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:11:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:11:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:11:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:11:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:11:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:11:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:11:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:11:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:11:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:11:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:11:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:11:48,092 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:11:48,092 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:11:48,092 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:11:48,092 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:11:48,092 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:11:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:11:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:11:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:11:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:11:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:11:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:11:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:11:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:11:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:11:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:11:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:11:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:11:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:11:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:11:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:11:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:11:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:11:48,096 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-13 21:11:48,096 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:11:48,096 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:11:48,096 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:11:48,096 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:11:48,097 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:11:48,097 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:11:48,097 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:11:48,097 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:48,097 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:11:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:11:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2019-10-13 21:11:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__empty [2019-10-13 21:11:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:11:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:11:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:11:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:11:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:11:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:11:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:11:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:11:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:11:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:11:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:11:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:11:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:11:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:11:48,102 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:11:48,102 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:11:48,102 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:11:48,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:11:48,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:11:48,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:11:50,225 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:11:50,226 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:11:50,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:50 BoogieIcfgContainer [2019-10-13 21:11:50,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:11:50,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:11:50,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:11:50,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:11:50,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:11:46" (1/3) ... [2019-10-13 21:11:50,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cdc5cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:50, skipping insertion in model container [2019-10-13 21:11:50,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:47" (2/3) ... [2019-10-13 21:11:50,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cdc5cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:50, skipping insertion in model container [2019-10-13 21:11:50,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:50" (3/3) ... [2019-10-13 21:11:50,239 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product26.cil.c [2019-10-13 21:11:50,249 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:11:50,258 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:11:50,270 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:11:50,300 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:11:50,300 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:11:50,300 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:11:50,301 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:11:50,301 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:11:50,301 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:11:50,301 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:11:50,301 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:11:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states. [2019-10-13 21:11:50,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 21:11:50,348 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:50,349 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:50,351 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:50,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:50,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1751841435, now seen corresponding path program 1 times [2019-10-13 21:11:50,366 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:50,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65872997] [2019-10-13 21:11:50,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:50,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:50,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:50,945 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:50,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65872997] [2019-10-13 21:11:50,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:50,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:50,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130008964] [2019-10-13 21:11:50,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:50,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:50,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:50,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:50,972 INFO L87 Difference]: Start difference. First operand 797 states. Second operand 7 states. [2019-10-13 21:11:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:51,260 INFO L93 Difference]: Finished difference Result 1259 states and 2038 transitions. [2019-10-13 21:11:51,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:51,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-10-13 21:11:51,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:51,294 INFO L225 Difference]: With dead ends: 1259 [2019-10-13 21:11:51,294 INFO L226 Difference]: Without dead ends: 638 [2019-10-13 21:11:51,307 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:51,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-13 21:11:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2019-10-13 21:11:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-13 21:11:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1014 transitions. [2019-10-13 21:11:51,420 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1014 transitions. Word has length 93 [2019-10-13 21:11:51,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:51,420 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 1014 transitions. [2019-10-13 21:11:51,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:51,421 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1014 transitions. [2019-10-13 21:11:51,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:11:51,427 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:51,428 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:51,428 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:51,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:51,428 INFO L82 PathProgramCache]: Analyzing trace with hash 449544218, now seen corresponding path program 1 times [2019-10-13 21:11:51,429 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:51,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295411419] [2019-10-13 21:11:51,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:51,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:51,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:51,673 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,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295411419] [2019-10-13 21:11:51,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:51,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:51,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440919983] [2019-10-13 21:11:51,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:51,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:51,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:51,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:51,677 INFO L87 Difference]: Start difference. First operand 636 states and 1014 transitions. Second operand 4 states. [2019-10-13 21:11:51,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:51,746 INFO L93 Difference]: Finished difference Result 1238 states and 1993 transitions. [2019-10-13 21:11:51,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:51,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-13 21:11:51,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:51,752 INFO L225 Difference]: With dead ends: 1238 [2019-10-13 21:11:51,752 INFO L226 Difference]: Without dead ends: 618 [2019-10-13 21:11:51,756 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:51,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-13 21:11:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-13 21:11:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-13 21:11:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 981 transitions. [2019-10-13 21:11:51,838 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 981 transitions. Word has length 94 [2019-10-13 21:11:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:51,843 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 981 transitions. [2019-10-13 21:11:51,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2019-10-13 21:11:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:11:51,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:51,855 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:51,855 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:51,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:51,856 INFO L82 PathProgramCache]: Analyzing trace with hash 451716357, now seen corresponding path program 1 times [2019-10-13 21:11:51,856 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:51,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055215672] [2019-10-13 21:11:51,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:51,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:51,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:52,109 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,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055215672] [2019-10-13 21:11:52,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:52,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:52,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785021387] [2019-10-13 21:11:52,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:52,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:52,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:52,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:52,112 INFO L87 Difference]: Start difference. First operand 618 states and 981 transitions. Second operand 7 states. [2019-10-13 21:11:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:52,231 INFO L93 Difference]: Finished difference Result 1207 states and 1935 transitions. [2019-10-13 21:11:52,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:52,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-13 21:11:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:52,241 INFO L225 Difference]: With dead ends: 1207 [2019-10-13 21:11:52,241 INFO L226 Difference]: Without dead ends: 612 [2019-10-13 21:11:52,244 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:52,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-13 21:11:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-13 21:11:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-13 21:11:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 968 transitions. [2019-10-13 21:11:52,284 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 968 transitions. Word has length 94 [2019-10-13 21:11:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:52,285 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 968 transitions. [2019-10-13 21:11:52,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 968 transitions. [2019-10-13 21:11:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:11:52,291 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:52,292 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:52,292 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:52,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:52,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2112280439, now seen corresponding path program 1 times [2019-10-13 21:11:52,293 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:52,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062498201] [2019-10-13 21:11:52,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:52,482 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,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062498201] [2019-10-13 21:11:52,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:52,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:52,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603619435] [2019-10-13 21:11:52,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:52,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:52,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:52,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:52,485 INFO L87 Difference]: Start difference. First operand 612 states and 968 transitions. Second operand 7 states. [2019-10-13 21:11:52,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:52,571 INFO L93 Difference]: Finished difference Result 1195 states and 1909 transitions. [2019-10-13 21:11:52,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:52,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-13 21:11:52,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:52,578 INFO L225 Difference]: With dead ends: 1195 [2019-10-13 21:11:52,578 INFO L226 Difference]: Without dead ends: 606 [2019-10-13 21:11:52,583 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:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-13 21:11:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2019-10-13 21:11:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-13 21:11:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 955 transitions. [2019-10-13 21:11:52,610 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 955 transitions. Word has length 95 [2019-10-13 21:11:52,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:52,610 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 955 transitions. [2019-10-13 21:11:52,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:52,611 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 955 transitions. [2019-10-13 21:11:52,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:11:52,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:52,613 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:52,614 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:52,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:52,614 INFO L82 PathProgramCache]: Analyzing trace with hash -2146614103, now seen corresponding path program 1 times [2019-10-13 21:11:52,614 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:52,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896695761] [2019-10-13 21:11:52,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:52,850 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,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896695761] [2019-10-13 21:11:52,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:52,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:52,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080871877] [2019-10-13 21:11:52,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:52,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:52,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:52,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:52,853 INFO L87 Difference]: Start difference. First operand 606 states and 955 transitions. Second operand 7 states. [2019-10-13 21:11:52,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:52,933 INFO L93 Difference]: Finished difference Result 1183 states and 1883 transitions. [2019-10-13 21:11:52,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:52,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-13 21:11:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:52,945 INFO L225 Difference]: With dead ends: 1183 [2019-10-13 21:11:52,945 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 21:11:52,948 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:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 21:11:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-13 21:11:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 21:11:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 942 transitions. [2019-10-13 21:11:52,971 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 942 transitions. Word has length 96 [2019-10-13 21:11:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:52,971 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 942 transitions. [2019-10-13 21:11:52,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 942 transitions. [2019-10-13 21:11:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:11:52,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:52,975 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:52,975 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:52,975 INFO L82 PathProgramCache]: Analyzing trace with hash -757672278, now seen corresponding path program 1 times [2019-10-13 21:11:52,976 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:52,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418281182] [2019-10-13 21:11:52,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:53,125 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:53,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418281182] [2019-10-13 21:11:53,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:53,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:53,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058051433] [2019-10-13 21:11:53,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:53,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:53,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:53,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:53,131 INFO L87 Difference]: Start difference. First operand 600 states and 942 transitions. Second operand 7 states. [2019-10-13 21:11:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:53,221 INFO L93 Difference]: Finished difference Result 1171 states and 1857 transitions. [2019-10-13 21:11:53,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:53,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-13 21:11:53,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:53,226 INFO L225 Difference]: With dead ends: 1171 [2019-10-13 21:11:53,227 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 21:11:53,230 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:53,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 21:11:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-13 21:11:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 21:11:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 941 transitions. [2019-10-13 21:11:53,250 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 941 transitions. Word has length 96 [2019-10-13 21:11:53,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:53,251 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 941 transitions. [2019-10-13 21:11:53,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 941 transitions. [2019-10-13 21:11:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:11:53,253 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:53,253 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:53,253 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:53,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:53,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1070802003, now seen corresponding path program 1 times [2019-10-13 21:11:53,254 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:53,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249940430] [2019-10-13 21:11:53,254 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:53,254 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:53,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:53,364 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:53,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249940430] [2019-10-13 21:11:53,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:53,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:53,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867379412] [2019-10-13 21:11:53,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:53,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:53,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:53,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:53,366 INFO L87 Difference]: Start difference. First operand 600 states and 941 transitions. Second operand 5 states. [2019-10-13 21:11:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:53,430 INFO L93 Difference]: Finished difference Result 1170 states and 1854 transitions. [2019-10-13 21:11:53,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:53,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-13 21:11:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:53,435 INFO L225 Difference]: With dead ends: 1170 [2019-10-13 21:11:53,436 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 21:11:53,440 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:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 21:11:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-13 21:11:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 21:11:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 940 transitions. [2019-10-13 21:11:53,514 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 940 transitions. Word has length 97 [2019-10-13 21:11:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:53,514 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 940 transitions. [2019-10-13 21:11:53,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 940 transitions. [2019-10-13 21:11:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:11:53,517 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:53,517 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:53,517 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:53,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:53,518 INFO L82 PathProgramCache]: Analyzing trace with hash -647387713, now seen corresponding path program 1 times [2019-10-13 21:11:53,518 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:53,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256366079] [2019-10-13 21:11:53,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:53,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:53,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:53,662 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:53,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256366079] [2019-10-13 21:11:53,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:53,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:53,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799750083] [2019-10-13 21:11:53,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:53,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:53,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:53,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:53,665 INFO L87 Difference]: Start difference. First operand 600 states and 940 transitions. Second operand 5 states. [2019-10-13 21:11:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:53,728 INFO L93 Difference]: Finished difference Result 1170 states and 1852 transitions. [2019-10-13 21:11:53,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:53,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-13 21:11:53,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:53,733 INFO L225 Difference]: With dead ends: 1170 [2019-10-13 21:11:53,733 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 21:11:53,737 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:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 21:11:53,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-13 21:11:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 21:11:53,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 939 transitions. [2019-10-13 21:11:53,758 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 939 transitions. Word has length 98 [2019-10-13 21:11:53,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:53,759 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 939 transitions. [2019-10-13 21:11:53,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 939 transitions. [2019-10-13 21:11:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 21:11:53,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:53,761 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:53,761 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:53,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:53,761 INFO L82 PathProgramCache]: Analyzing trace with hash 146491208, now seen corresponding path program 1 times [2019-10-13 21:11:53,762 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:53,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473284337] [2019-10-13 21:11:53,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:53,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:53,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:53,924 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:53,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473284337] [2019-10-13 21:11:53,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:53,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:53,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487566454] [2019-10-13 21:11:53,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:53,926 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:53,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:53,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:53,927 INFO L87 Difference]: Start difference. First operand 600 states and 939 transitions. Second operand 5 states. [2019-10-13 21:11:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:54,003 INFO L93 Difference]: Finished difference Result 1170 states and 1850 transitions. [2019-10-13 21:11:54,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:54,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-13 21:11:54,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:54,010 INFO L225 Difference]: With dead ends: 1170 [2019-10-13 21:11:54,010 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 21:11:54,014 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:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 21:11:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-13 21:11:54,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 21:11:54,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 938 transitions. [2019-10-13 21:11:54,041 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 938 transitions. Word has length 99 [2019-10-13 21:11:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:54,042 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 938 transitions. [2019-10-13 21:11:54,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:54,042 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 938 transitions. [2019-10-13 21:11:54,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 21:11:54,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:54,044 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:54,045 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:54,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:54,045 INFO L82 PathProgramCache]: Analyzing trace with hash -460128198, now seen corresponding path program 1 times [2019-10-13 21:11:54,046 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:54,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050840618] [2019-10-13 21:11:54,046 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:54,046 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:54,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:54,182 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:54,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050840618] [2019-10-13 21:11:54,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:54,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:54,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777252154] [2019-10-13 21:11:54,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:54,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:54,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:54,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:54,184 INFO L87 Difference]: Start difference. First operand 600 states and 938 transitions. Second operand 5 states. [2019-10-13 21:11:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:54,260 INFO L93 Difference]: Finished difference Result 1170 states and 1848 transitions. [2019-10-13 21:11:54,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:54,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-13 21:11:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:54,265 INFO L225 Difference]: With dead ends: 1170 [2019-10-13 21:11:54,265 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 21:11:54,268 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:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 21:11:54,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-13 21:11:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 21:11:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 937 transitions. [2019-10-13 21:11:54,289 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 937 transitions. Word has length 100 [2019-10-13 21:11:54,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:54,289 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 937 transitions. [2019-10-13 21:11:54,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 937 transitions. [2019-10-13 21:11:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:11:54,291 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:54,291 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:54,291 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:54,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:54,291 INFO L82 PathProgramCache]: Analyzing trace with hash 406639265, now seen corresponding path program 1 times [2019-10-13 21:11:54,292 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:54,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028896873] [2019-10-13 21:11:54,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:54,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:54,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:54,483 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:54,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028896873] [2019-10-13 21:11:54,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:54,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:11:54,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015605018] [2019-10-13 21:11:54,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:11:54,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:54,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:11:54,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:54,486 INFO L87 Difference]: Start difference. First operand 600 states and 937 transitions. Second operand 9 states. [2019-10-13 21:11:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:54,638 INFO L93 Difference]: Finished difference Result 1172 states and 1847 transitions. [2019-10-13 21:11:54,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:11:54,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-10-13 21:11:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:54,645 INFO L225 Difference]: With dead ends: 1172 [2019-10-13 21:11:54,646 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 21:11:54,650 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:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 21:11:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-13 21:11:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 21:11:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 936 transitions. [2019-10-13 21:11:54,674 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 936 transitions. Word has length 101 [2019-10-13 21:11:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:54,676 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 936 transitions. [2019-10-13 21:11:54,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:11:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 936 transitions. [2019-10-13 21:11:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:11:54,679 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:54,679 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:54,680 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:54,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:54,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1532522781, now seen corresponding path program 1 times [2019-10-13 21:11:54,680 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:54,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107092752] [2019-10-13 21:11:54,681 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:54,681 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:54,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:54,899 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:54,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107092752] [2019-10-13 21:11:54,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:54,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:11:54,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411426249] [2019-10-13 21:11:54,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:11:54,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:54,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:11:54,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:54,902 INFO L87 Difference]: Start difference. First operand 600 states and 936 transitions. Second operand 8 states. [2019-10-13 21:11:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:57,675 INFO L93 Difference]: Finished difference Result 2187 states and 3473 transitions. [2019-10-13 21:11:57,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:11:57,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-10-13 21:11:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:57,688 INFO L225 Difference]: With dead ends: 2187 [2019-10-13 21:11:57,688 INFO L226 Difference]: Without dead ends: 1621 [2019-10-13 21:11:57,692 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:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2019-10-13 21:11:57,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1609. [2019-10-13 21:11:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-10-13 21:11:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2515 transitions. [2019-10-13 21:11:57,760 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2515 transitions. Word has length 101 [2019-10-13 21:11:57,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:57,761 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 2515 transitions. [2019-10-13 21:11:57,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:11:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2515 transitions. [2019-10-13 21:11:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:11:57,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:57,763 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:57,763 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:57,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:57,764 INFO L82 PathProgramCache]: Analyzing trace with hash -756173853, now seen corresponding path program 1 times [2019-10-13 21:11:57,764 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:57,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847326037] [2019-10-13 21:11:57,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:57,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:57,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:57,945 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:57,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847326037] [2019-10-13 21:11:57,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767519568] [2019-10-13 21:11:57,946 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:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:58,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 2951 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:58,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:58,603 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:58,604 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:58,712 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:58,713 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:58,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-13 21:11:58,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818035678] [2019-10-13 21:11:58,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:58,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:58,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:58,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:58,715 INFO L87 Difference]: Start difference. First operand 1609 states and 2515 transitions. Second operand 3 states. [2019-10-13 21:11:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:58,838 INFO L93 Difference]: Finished difference Result 4631 states and 7375 transitions. [2019-10-13 21:11:58,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:58,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-13 21:11:58,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:58,863 INFO L225 Difference]: With dead ends: 4631 [2019-10-13 21:11:58,863 INFO L226 Difference]: Without dead ends: 3056 [2019-10-13 21:11:58,873 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:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2019-10-13 21:11:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 2950. [2019-10-13 21:11:59,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2950 states. [2019-10-13 21:11:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 4676 transitions. [2019-10-13 21:11:59,177 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 4676 transitions. Word has length 101 [2019-10-13 21:11:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:59,178 INFO L462 AbstractCegarLoop]: Abstraction has 2950 states and 4676 transitions. [2019-10-13 21:11:59,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 4676 transitions. [2019-10-13 21:11:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 21:11:59,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:59,181 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:59,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:59,393 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:59,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:59,393 INFO L82 PathProgramCache]: Analyzing trace with hash 217558724, now seen corresponding path program 1 times [2019-10-13 21:11:59,394 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:59,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609410785] [2019-10-13 21:11:59,394 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:59,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:59,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:59,581 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:59,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609410785] [2019-10-13 21:11:59,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:59,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:59,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449794374] [2019-10-13 21:11:59,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:59,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:59,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:59,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:59,584 INFO L87 Difference]: Start difference. First operand 2950 states and 4676 transitions. Second operand 7 states. [2019-10-13 21:12:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:02,205 INFO L93 Difference]: Finished difference Result 8754 states and 14231 transitions. [2019-10-13 21:12:02,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:02,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-10-13 21:12:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:02,249 INFO L225 Difference]: With dead ends: 8754 [2019-10-13 21:12:02,250 INFO L226 Difference]: Without dead ends: 5838 [2019-10-13 21:12:02,267 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:12:02,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5838 states. [2019-10-13 21:12:02,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5838 to 5754. [2019-10-13 21:12:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5754 states. [2019-10-13 21:12:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5754 states to 5754 states and 9284 transitions. [2019-10-13 21:12:02,550 INFO L78 Accepts]: Start accepts. Automaton has 5754 states and 9284 transitions. Word has length 105 [2019-10-13 21:12:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:02,551 INFO L462 AbstractCegarLoop]: Abstraction has 5754 states and 9284 transitions. [2019-10-13 21:12:02,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5754 states and 9284 transitions. [2019-10-13 21:12:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:12:02,554 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:02,555 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, 1] [2019-10-13 21:12:02,555 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:02,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:02,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1974135473, now seen corresponding path program 1 times [2019-10-13 21:12:02,556 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:02,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525852000] [2019-10-13 21:12:02,556 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:02,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:02,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:02,707 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:12:02,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525852000] [2019-10-13 21:12:02,708 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:02,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:02,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507125290] [2019-10-13 21:12:02,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:02,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:02,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:02,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:02,711 INFO L87 Difference]: Start difference. First operand 5754 states and 9284 transitions. Second operand 4 states. [2019-10-13 21:12:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:02,946 INFO L93 Difference]: Finished difference Result 11462 states and 18661 transitions. [2019-10-13 21:12:02,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:12:02,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 21:12:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:02,990 INFO L225 Difference]: With dead ends: 11462 [2019-10-13 21:12:02,991 INFO L226 Difference]: Without dead ends: 5742 [2019-10-13 21:12:03,028 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:12:03,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5742 states. [2019-10-13 21:12:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5742 to 5724. [2019-10-13 21:12:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5724 states. [2019-10-13 21:12:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5724 states to 5724 states and 9196 transitions. [2019-10-13 21:12:03,405 INFO L78 Accepts]: Start accepts. Automaton has 5724 states and 9196 transitions. Word has length 106 [2019-10-13 21:12:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:03,406 INFO L462 AbstractCegarLoop]: Abstraction has 5724 states and 9196 transitions. [2019-10-13 21:12:03,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 5724 states and 9196 transitions. [2019-10-13 21:12:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 21:12:03,409 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:03,410 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:12:03,410 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:03,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:03,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1355747995, now seen corresponding path program 1 times [2019-10-13 21:12:03,411 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:03,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591576141] [2019-10-13 21:12:03,411 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:03,411 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:03,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:03,609 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:12:03,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591576141] [2019-10-13 21:12:03,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776105315] [2019-10-13 21:12:03,610 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:12:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:04,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 2952 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:12:04,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:12:04,289 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:12:04,289 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:12:04,381 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:12:04,381 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:12:04,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-13 21:12:04,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156066025] [2019-10-13 21:12:04,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:12:04,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:04,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:12:04,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:12:04,383 INFO L87 Difference]: Start difference. First operand 5724 states and 9196 transitions. Second operand 3 states. [2019-10-13 21:12:04,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:04,609 INFO L93 Difference]: Finished difference Result 12609 states and 20441 transitions. [2019-10-13 21:12:04,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:12:04,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-13 21:12:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:04,681 INFO L225 Difference]: With dead ends: 12609 [2019-10-13 21:12:04,682 INFO L226 Difference]: Without dead ends: 6919 [2019-10-13 21:12:04,705 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:12:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6919 states. [2019-10-13 21:12:04,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6919 to 6730. [2019-10-13 21:12:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6730 states. [2019-10-13 21:12:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6730 states to 6730 states and 10818 transitions. [2019-10-13 21:12:05,670 INFO L78 Accepts]: Start accepts. Automaton has 6730 states and 10818 transitions. Word has length 102 [2019-10-13 21:12:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:05,671 INFO L462 AbstractCegarLoop]: Abstraction has 6730 states and 10818 transitions. [2019-10-13 21:12:05,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:12:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 6730 states and 10818 transitions. [2019-10-13 21:12:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:12:05,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:05,673 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:12:05,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:12:05,880 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:05,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:05,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1975309189, now seen corresponding path program 1 times [2019-10-13 21:12:05,881 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:05,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378320822] [2019-10-13 21:12:05,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:05,882 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:05,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:06,021 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:12:06,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378320822] [2019-10-13 21:12:06,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:06,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:12:06,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003224976] [2019-10-13 21:12:06,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:12:06,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:06,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:12:06,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:06,024 INFO L87 Difference]: Start difference. First operand 6730 states and 10818 transitions. Second operand 7 states. [2019-10-13 21:12:09,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:09,116 INFO L93 Difference]: Finished difference Result 20144 states and 33268 transitions. [2019-10-13 21:12:09,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:09,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-10-13 21:12:09,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:09,199 INFO L225 Difference]: With dead ends: 20144 [2019-10-13 21:12:09,199 INFO L226 Difference]: Without dead ends: 13448 [2019-10-13 21:12:09,222 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:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13448 states. [2019-10-13 21:12:09,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13448 to 13320. [2019-10-13 21:12:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13320 states. [2019-10-13 21:12:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13320 states to 13320 states and 21889 transitions. [2019-10-13 21:12:09,797 INFO L78 Accepts]: Start accepts. Automaton has 13320 states and 21889 transitions. Word has length 113 [2019-10-13 21:12:09,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:09,799 INFO L462 AbstractCegarLoop]: Abstraction has 13320 states and 21889 transitions. [2019-10-13 21:12:09,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 13320 states and 21889 transitions. [2019-10-13 21:12:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:12:09,801 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:09,802 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:12:09,802 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:09,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:09,803 INFO L82 PathProgramCache]: Analyzing trace with hash -2114200266, now seen corresponding path program 1 times [2019-10-13 21:12:09,803 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:09,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3517644] [2019-10-13 21:12:09,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:09,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:09,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:09,929 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:12:09,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3517644] [2019-10-13 21:12:09,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:09,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:09,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468358233] [2019-10-13 21:12:09,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:09,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:09,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:09,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:09,931 INFO L87 Difference]: Start difference. First operand 13320 states and 21889 transitions. Second operand 4 states. [2019-10-13 21:12:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:10,474 INFO L93 Difference]: Finished difference Result 26668 states and 44300 transitions. [2019-10-13 21:12:10,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:12:10,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 21:12:10,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:10,733 INFO L225 Difference]: With dead ends: 26668 [2019-10-13 21:12:10,733 INFO L226 Difference]: Without dead ends: 13376 [2019-10-13 21:12:10,767 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:12:10,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13376 states. [2019-10-13 21:12:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13376 to 13328. [2019-10-13 21:12:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13328 states. [2019-10-13 21:12:11,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13328 states to 13328 states and 21840 transitions. [2019-10-13 21:12:11,186 INFO L78 Accepts]: Start accepts. Automaton has 13328 states and 21840 transitions. Word has length 114 [2019-10-13 21:12:11,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:11,187 INFO L462 AbstractCegarLoop]: Abstraction has 13328 states and 21840 transitions. [2019-10-13 21:12:11,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 13328 states and 21840 transitions. [2019-10-13 21:12:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-13 21:12:11,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:11,190 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:11,190 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:11,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:11,190 INFO L82 PathProgramCache]: Analyzing trace with hash -927294885, now seen corresponding path program 1 times [2019-10-13 21:12:11,190 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:11,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137194496] [2019-10-13 21:12:11,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:11,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:11,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 21:12:11,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137194496] [2019-10-13 21:12:11,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017370694] [2019-10-13 21:12:11,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:12:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:12,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 3299 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 21:12:12,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:12:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:12:12,287 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:12:12,676 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-10-13 21:12:12,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:12:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 21:12:12,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:12:12,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 9] total 25 [2019-10-13 21:12:12,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703596247] [2019-10-13 21:12:12,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:12:12,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:12,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:12:12,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:12:12,860 INFO L87 Difference]: Start difference. First operand 13328 states and 21840 transitions. Second operand 9 states.