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_spec2_product18.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:09:27,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:09:27,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:09:28,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:09:28,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:09:28,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:09:28,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:09:28,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:09:28,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:09:28,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:09:28,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:09:28,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:09:28,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:09:28,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:09:28,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:09:28,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:09:28,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:09:28,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:09:28,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:09:28,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:09:28,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:09:28,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:09:28,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:09:28,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:09:28,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:09:28,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:09:28,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:09:28,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:09:28,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:09:28,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:09:28,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:09:28,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:09:28,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:09:28,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:09:28,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:09:28,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:09:28,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:09:28,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:09:28,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:09:28,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:09:28,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:09:28,073 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:09:28,091 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:09:28,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:09:28,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:09:28,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:09:28,094 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:09:28,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:09:28,094 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:09:28,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:09:28,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:09:28,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:09:28,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:09:28,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:09:28,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:09:28,096 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:09:28,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:09:28,097 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:09:28,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:09:28,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:09:28,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:09:28,098 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:09:28,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:09:28,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:09:28,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:09:28,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:09:28,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:09:28,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:09:28,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:09:28,099 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:09:28,099 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:09:28,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:09:28,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:09:28,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:09:28,383 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:09:28,383 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:09:28,384 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product18.cil.c [2019-10-15 01:09:28,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a900b985/14ad69c3cc6f487d90699f0c9d6af5c6/FLAG63c2d1b1e [2019-10-15 01:09:29,175 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:09:29,176 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product18.cil.c [2019-10-15 01:09:29,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a900b985/14ad69c3cc6f487d90699f0c9d6af5c6/FLAG63c2d1b1e [2019-10-15 01:09:29,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a900b985/14ad69c3cc6f487d90699f0c9d6af5c6 [2019-10-15 01:09:29,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:09:29,287 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:09:29,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:29,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:09:29,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:09:29,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:29" (1/1) ... [2019-10-15 01:09:29,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5f6572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:29, skipping insertion in model container [2019-10-15 01:09:29,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:29" (1/1) ... [2019-10-15 01:09:29,306 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:09:29,389 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:09:30,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:30,157 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:09:30,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:30,440 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:09:30,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30 WrapperNode [2019-10-15 01:09:30,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:30,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:09:30,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:09:30,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:09:30,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... [2019-10-15 01:09:30,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... [2019-10-15 01:09:30,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... [2019-10-15 01:09:30,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... [2019-10-15 01:09:30,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... [2019-10-15 01:09:30,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... [2019-10-15 01:09:30,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... [2019-10-15 01:09:30,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:09:30,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:09:30,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:09:30,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:09:30,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:09:30,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:09:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:09:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:09:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:09:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:09:30,702 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:09:30,703 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:09:30,703 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:09:30,703 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:09:30,703 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:09:30,704 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:09:30,704 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:09:30,704 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:09:30,704 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:09:30,705 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:09:30,705 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:09:30,705 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:09:30,705 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:09:30,706 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:09:30,706 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:09:30,706 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:09:30,706 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:09:30,707 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:09:30,707 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:09:30,707 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:09:30,707 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:09:30,707 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:09:30,708 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:09:30,708 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:09:30,708 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:09:30,708 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:09:30,708 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:09:30,708 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:09:30,709 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:09:30,709 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:09:30,709 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2019-10-15 01:09:30,709 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:09:30,709 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__weight [2019-10-15 01:09:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:09:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:09:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:09:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:09:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:09:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:09:30,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:09:30,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:09:30,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:09:30,711 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:09:30,711 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:09:30,711 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:09:30,712 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:09:30,712 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:09:30,712 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:09:30,712 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:09:30,712 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:09:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:09:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:09:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:09:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:09:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:09:30,713 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:09:30,714 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:09:30,714 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:09:30,714 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:09:30,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:09:30,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:09:30,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:09:30,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:09:30,715 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:09:30,715 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:09:30,715 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:09:30,716 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:09:30,716 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:09:30,716 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:09:30,716 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:09:30,716 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:09:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:09:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:09:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:09:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:09:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:09:30,717 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:09:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:09:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:09:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:09:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:09:30,718 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:09:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:09:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:09:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:09:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:09:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:09:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:09:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:09:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:09:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:09:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:09:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:09:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:09:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:09:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:09:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:09:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:09:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:09:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:09:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:09:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:09:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:09:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:09:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:09:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:09:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:09:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:09:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:09:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:09:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:09:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:09:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:09:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:09:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:09:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:09:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:09:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:09:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2019-10-15 01:09:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:09:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__weight [2019-10-15 01:09:30,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:09:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:09:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:09:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:09:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:09:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:09:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:09:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:09:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:09:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:09:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:09:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:09:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:09:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:09:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:09:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:09:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:09:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:09:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:09:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:09:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:09:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:09:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:09:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:09:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:09:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:09:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:09:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:09:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:09:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:09:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:09:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:09:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:09:30,732 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:09:30,732 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:09:30,732 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:09:30,732 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:09:30,732 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:09:30,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:09:30,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:09:30,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:09:33,090 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:09:33,090 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:09:33,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:09:33 BoogieIcfgContainer [2019-10-15 01:09:33,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:09:33,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:09:33,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:09:33,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:09:33,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:09:29" (1/3) ... [2019-10-15 01:09:33,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2104c296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:09:33, skipping insertion in model container [2019-10-15 01:09:33,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (2/3) ... [2019-10-15 01:09:33,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2104c296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:09:33, skipping insertion in model container [2019-10-15 01:09:33,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:09:33" (3/3) ... [2019-10-15 01:09:33,100 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product18.cil.c [2019-10-15 01:09:33,109 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:09:33,118 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:09:33,130 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:09:33,160 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:09:33,161 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:09:33,161 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:09:33,161 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:09:33,161 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:09:33,161 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:09:33,161 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:09:33,161 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:09:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states. [2019-10-15 01:09:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-15 01:09:33,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:33,230 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:33,233 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:33,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:33,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1188892362, now seen corresponding path program 1 times [2019-10-15 01:09:33,245 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:33,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457929259] [2019-10-15 01:09:33,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:33,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457929259] [2019-10-15 01:09:33,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:33,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:33,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188970805] [2019-10-15 01:09:33,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:33,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:33,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:33,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:33,877 INFO L87 Difference]: Start difference. First operand 758 states. Second operand 4 states. [2019-10-15 01:09:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:34,117 INFO L93 Difference]: Finished difference Result 1165 states and 1897 transitions. [2019-10-15 01:09:34,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:34,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-15 01:09:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:34,152 INFO L225 Difference]: With dead ends: 1165 [2019-10-15 01:09:34,153 INFO L226 Difference]: Without dead ends: 591 [2019-10-15 01:09:34,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:34,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-15 01:09:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-15 01:09:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-15 01:09:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 950 transitions. [2019-10-15 01:09:34,279 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 950 transitions. Word has length 85 [2019-10-15 01:09:34,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:34,280 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 950 transitions. [2019-10-15 01:09:34,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 950 transitions. [2019-10-15 01:09:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-15 01:09:34,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:34,286 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:34,286 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:34,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:34,287 INFO L82 PathProgramCache]: Analyzing trace with hash -425590234, now seen corresponding path program 1 times [2019-10-15 01:09:34,287 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:34,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438122905] [2019-10-15 01:09:34,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:34,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438122905] [2019-10-15 01:09:34,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:34,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:34,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672809784] [2019-10-15 01:09:34,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:34,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:34,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:34,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:34,453 INFO L87 Difference]: Start difference. First operand 591 states and 950 transitions. Second operand 4 states. [2019-10-15 01:09:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:34,535 INFO L93 Difference]: Finished difference Result 1145 states and 1858 transitions. [2019-10-15 01:09:34,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:34,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-15 01:09:34,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:34,542 INFO L225 Difference]: With dead ends: 1145 [2019-10-15 01:09:34,542 INFO L226 Difference]: Without dead ends: 591 [2019-10-15 01:09:34,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-15 01:09:34,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-15 01:09:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-15 01:09:34,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 949 transitions. [2019-10-15 01:09:34,605 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 949 transitions. Word has length 88 [2019-10-15 01:09:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:34,605 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 949 transitions. [2019-10-15 01:09:34,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 949 transitions. [2019-10-15 01:09:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-15 01:09:34,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:34,613 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:34,613 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:34,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:34,613 INFO L82 PathProgramCache]: Analyzing trace with hash -737262235, now seen corresponding path program 1 times [2019-10-15 01:09:34,614 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:34,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962026220] [2019-10-15 01:09:34,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:34,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962026220] [2019-10-15 01:09:34,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:34,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:34,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249443931] [2019-10-15 01:09:34,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:34,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:34,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:34,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:34,816 INFO L87 Difference]: Start difference. First operand 591 states and 949 transitions. Second operand 4 states. [2019-10-15 01:09:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:34,887 INFO L93 Difference]: Finished difference Result 1145 states and 1857 transitions. [2019-10-15 01:09:34,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:34,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-15 01:09:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:34,895 INFO L225 Difference]: With dead ends: 1145 [2019-10-15 01:09:34,895 INFO L226 Difference]: Without dead ends: 591 [2019-10-15 01:09:34,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:34,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-15 01:09:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-15 01:09:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-15 01:09:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 948 transitions. [2019-10-15 01:09:34,942 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 948 transitions. Word has length 89 [2019-10-15 01:09:34,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:34,942 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 948 transitions. [2019-10-15 01:09:34,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 948 transitions. [2019-10-15 01:09:34,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-15 01:09:34,947 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:34,947 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:34,947 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:34,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1727810174, now seen corresponding path program 1 times [2019-10-15 01:09:34,948 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:34,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247979629] [2019-10-15 01:09:34,949 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,949 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:35,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247979629] [2019-10-15 01:09:35,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:35,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:35,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230092528] [2019-10-15 01:09:35,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:35,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:35,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:35,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:35,090 INFO L87 Difference]: Start difference. First operand 591 states and 948 transitions. Second operand 4 states. [2019-10-15 01:09:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:35,150 INFO L93 Difference]: Finished difference Result 1145 states and 1856 transitions. [2019-10-15 01:09:35,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:35,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-15 01:09:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:35,156 INFO L225 Difference]: With dead ends: 1145 [2019-10-15 01:09:35,156 INFO L226 Difference]: Without dead ends: 591 [2019-10-15 01:09:35,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-15 01:09:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-15 01:09:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-15 01:09:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 947 transitions. [2019-10-15 01:09:35,185 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 947 transitions. Word has length 90 [2019-10-15 01:09:35,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:35,186 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 947 transitions. [2019-10-15 01:09:35,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 947 transitions. [2019-10-15 01:09:35,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 01:09:35,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:35,188 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:35,189 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:35,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2006291585, now seen corresponding path program 1 times [2019-10-15 01:09:35,189 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:35,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285526973] [2019-10-15 01:09:35,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:35,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285526973] [2019-10-15 01:09:35,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:35,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:35,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925201992] [2019-10-15 01:09:35,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:35,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:35,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:35,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:35,325 INFO L87 Difference]: Start difference. First operand 591 states and 947 transitions. Second operand 4 states. [2019-10-15 01:09:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:35,402 INFO L93 Difference]: Finished difference Result 1145 states and 1855 transitions. [2019-10-15 01:09:35,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:35,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-15 01:09:35,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:35,414 INFO L225 Difference]: With dead ends: 1145 [2019-10-15 01:09:35,415 INFO L226 Difference]: Without dead ends: 591 [2019-10-15 01:09:35,419 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:35,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-15 01:09:35,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-15 01:09:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-15 01:09:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 946 transitions. [2019-10-15 01:09:35,496 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 946 transitions. Word has length 91 [2019-10-15 01:09:35,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:35,498 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 946 transitions. [2019-10-15 01:09:35,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 946 transitions. [2019-10-15 01:09:35,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:09:35,501 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:35,501 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:35,502 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:35,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:35,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1880678622, now seen corresponding path program 1 times [2019-10-15 01:09:35,505 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:35,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890616449] [2019-10-15 01:09:35,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:35,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890616449] [2019-10-15 01:09:35,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:35,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:09:35,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084854044] [2019-10-15 01:09:35,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:09:35,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:35,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:09:35,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:09:35,693 INFO L87 Difference]: Start difference. First operand 591 states and 946 transitions. Second operand 10 states. [2019-10-15 01:09:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:35,848 INFO L93 Difference]: Finished difference Result 1103 states and 1775 transitions. [2019-10-15 01:09:35,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:09:35,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-15 01:09:35,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:35,853 INFO L225 Difference]: With dead ends: 1103 [2019-10-15 01:09:35,854 INFO L226 Difference]: Without dead ends: 600 [2019-10-15 01:09:35,856 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:09:35,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-15 01:09:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 598. [2019-10-15 01:09:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:09:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 955 transitions. [2019-10-15 01:09:35,885 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 955 transitions. Word has length 92 [2019-10-15 01:09:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:35,885 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 955 transitions. [2019-10-15 01:09:35,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:09:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 955 transitions. [2019-10-15 01:09:35,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:09:35,888 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:35,889 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:35,889 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:35,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:35,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1901015997, now seen corresponding path program 1 times [2019-10-15 01:09:35,889 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:35,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486980966] [2019-10-15 01:09:35,890 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,890 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:35,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486980966] [2019-10-15 01:09:35,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:35,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:35,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259208292] [2019-10-15 01:09:35,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:35,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:35,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:35,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:35,996 INFO L87 Difference]: Start difference. First operand 598 states and 955 transitions. Second operand 4 states. [2019-10-15 01:09:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:36,056 INFO L93 Difference]: Finished difference Result 1151 states and 1861 transitions. [2019-10-15 01:09:36,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:36,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-15 01:09:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:36,063 INFO L225 Difference]: With dead ends: 1151 [2019-10-15 01:09:36,063 INFO L226 Difference]: Without dead ends: 585 [2019-10-15 01:09:36,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:36,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-15 01:09:36,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-15 01:09:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-15 01:09:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 932 transitions. [2019-10-15 01:09:36,093 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 932 transitions. Word has length 92 [2019-10-15 01:09:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:36,093 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 932 transitions. [2019-10-15 01:09:36,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 932 transitions. [2019-10-15 01:09:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 01:09:36,097 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:36,097 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:36,097 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:36,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:36,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1516088769, now seen corresponding path program 1 times [2019-10-15 01:09:36,098 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:36,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349001584] [2019-10-15 01:09:36,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:36,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349001584] [2019-10-15 01:09:36,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:36,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:36,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083449564] [2019-10-15 01:09:36,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:36,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:36,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:36,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:36,282 INFO L87 Difference]: Start difference. First operand 585 states and 932 transitions. Second operand 6 states. [2019-10-15 01:09:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:36,493 INFO L93 Difference]: Finished difference Result 1091 states and 1753 transitions. [2019-10-15 01:09:36,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:36,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-15 01:09:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:36,498 INFO L225 Difference]: With dead ends: 1091 [2019-10-15 01:09:36,499 INFO L226 Difference]: Without dead ends: 585 [2019-10-15 01:09:36,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:36,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-15 01:09:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-15 01:09:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-15 01:09:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 928 transitions. [2019-10-15 01:09:36,523 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 928 transitions. Word has length 93 [2019-10-15 01:09:36,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:36,524 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 928 transitions. [2019-10-15 01:09:36,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 928 transitions. [2019-10-15 01:09:36,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:09:36,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:36,526 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:36,527 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:36,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:36,527 INFO L82 PathProgramCache]: Analyzing trace with hash 645733217, now seen corresponding path program 1 times [2019-10-15 01:09:36,527 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:36,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826848674] [2019-10-15 01:09:36,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:36,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826848674] [2019-10-15 01:09:36,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:36,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:36,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123894016] [2019-10-15 01:09:36,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:36,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:36,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:36,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:36,646 INFO L87 Difference]: Start difference. First operand 585 states and 928 transitions. Second operand 6 states. [2019-10-15 01:09:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:36,849 INFO L93 Difference]: Finished difference Result 1091 states and 1749 transitions. [2019-10-15 01:09:36,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:36,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-15 01:09:36,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:36,855 INFO L225 Difference]: With dead ends: 1091 [2019-10-15 01:09:36,855 INFO L226 Difference]: Without dead ends: 585 [2019-10-15 01:09:36,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-15 01:09:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-15 01:09:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-15 01:09:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 924 transitions. [2019-10-15 01:09:36,882 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 924 transitions. Word has length 94 [2019-10-15 01:09:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:36,884 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 924 transitions. [2019-10-15 01:09:36,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 924 transitions. [2019-10-15 01:09:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:09:36,886 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:36,886 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:36,887 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:36,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:36,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1096058748, now seen corresponding path program 1 times [2019-10-15 01:09:36,887 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:36,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950350105] [2019-10-15 01:09:36,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:37,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950350105] [2019-10-15 01:09:37,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:37,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:37,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025070849] [2019-10-15 01:09:37,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:37,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:37,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:37,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:37,052 INFO L87 Difference]: Start difference. First operand 585 states and 924 transitions. Second operand 6 states. [2019-10-15 01:09:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:37,293 INFO L93 Difference]: Finished difference Result 1091 states and 1745 transitions. [2019-10-15 01:09:37,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:37,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-15 01:09:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:37,299 INFO L225 Difference]: With dead ends: 1091 [2019-10-15 01:09:37,299 INFO L226 Difference]: Without dead ends: 585 [2019-10-15 01:09:37,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:37,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-15 01:09:37,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-15 01:09:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-15 01:09:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 920 transitions. [2019-10-15 01:09:37,326 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 920 transitions. Word has length 95 [2019-10-15 01:09:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:37,326 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 920 transitions. [2019-10-15 01:09:37,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 920 transitions. [2019-10-15 01:09:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:09:37,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:37,329 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:37,329 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:37,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:37,329 INFO L82 PathProgramCache]: Analyzing trace with hash -48204540, now seen corresponding path program 1 times [2019-10-15 01:09:37,330 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:37,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39669991] [2019-10-15 01:09:37,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:37,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39669991] [2019-10-15 01:09:37,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:37,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:09:37,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118254378] [2019-10-15 01:09:37,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:09:37,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:37,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:09:37,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:09:37,491 INFO L87 Difference]: Start difference. First operand 585 states and 920 transitions. Second operand 7 states. [2019-10-15 01:09:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:37,574 INFO L93 Difference]: Finished difference Result 1091 states and 1741 transitions. [2019-10-15 01:09:37,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:09:37,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-15 01:09:37,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:37,579 INFO L225 Difference]: With dead ends: 1091 [2019-10-15 01:09:37,579 INFO L226 Difference]: Without dead ends: 564 [2019-10-15 01:09:37,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:37,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-15 01:09:37,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-10-15 01:09:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-15 01:09:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 886 transitions. [2019-10-15 01:09:37,602 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 886 transitions. Word has length 95 [2019-10-15 01:09:37,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:37,603 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 886 transitions. [2019-10-15 01:09:37,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:09:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 886 transitions. [2019-10-15 01:09:37,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:09:37,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:37,605 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:37,605 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:37,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:37,606 INFO L82 PathProgramCache]: Analyzing trace with hash 704168390, now seen corresponding path program 1 times [2019-10-15 01:09:37,606 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:37,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860306747] [2019-10-15 01:09:37,606 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,606 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:37,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860306747] [2019-10-15 01:09:37,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:37,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:37,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96813256] [2019-10-15 01:09:37,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:37,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:37,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:37,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:37,714 INFO L87 Difference]: Start difference. First operand 564 states and 886 transitions. Second operand 6 states. [2019-10-15 01:09:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:37,801 INFO L93 Difference]: Finished difference Result 1070 states and 1707 transitions. [2019-10-15 01:09:37,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:37,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-15 01:09:37,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:37,806 INFO L225 Difference]: With dead ends: 1070 [2019-10-15 01:09:37,806 INFO L226 Difference]: Without dead ends: 564 [2019-10-15 01:09:37,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-15 01:09:37,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-10-15 01:09:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-15 01:09:37,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 885 transitions. [2019-10-15 01:09:37,827 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 885 transitions. Word has length 96 [2019-10-15 01:09:37,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:37,828 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 885 transitions. [2019-10-15 01:09:37,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 885 transitions. [2019-10-15 01:09:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:09:37,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:37,830 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:37,830 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:37,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:37,831 INFO L82 PathProgramCache]: Analyzing trace with hash 637838025, now seen corresponding path program 1 times [2019-10-15 01:09:37,831 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:37,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885173862] [2019-10-15 01:09:37,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:38,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885173862] [2019-10-15 01:09:38,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:38,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:38,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113505229] [2019-10-15 01:09:38,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:38,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:38,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:38,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:38,002 INFO L87 Difference]: Start difference. First operand 564 states and 885 transitions. Second operand 6 states. [2019-10-15 01:09:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:38,089 INFO L93 Difference]: Finished difference Result 1070 states and 1706 transitions. [2019-10-15 01:09:38,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:38,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-15 01:09:38,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:38,094 INFO L225 Difference]: With dead ends: 1070 [2019-10-15 01:09:38,094 INFO L226 Difference]: Without dead ends: 564 [2019-10-15 01:09:38,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-15 01:09:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-10-15 01:09:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-15 01:09:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 884 transitions. [2019-10-15 01:09:38,115 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 884 transitions. Word has length 97 [2019-10-15 01:09:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:38,116 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 884 transitions. [2019-10-15 01:09:38,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 884 transitions. [2019-10-15 01:09:38,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:09:38,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:38,118 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:38,118 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:38,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:38,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1457200085, now seen corresponding path program 1 times [2019-10-15 01:09:38,119 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:38,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378293130] [2019-10-15 01:09:38,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:38,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:38,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:38,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378293130] [2019-10-15 01:09:38,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:38,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:09:38,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454620113] [2019-10-15 01:09:38,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:09:38,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:38,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:09:38,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:09:38,297 INFO L87 Difference]: Start difference. First operand 564 states and 884 transitions. Second operand 12 states. [2019-10-15 01:09:38,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:38,532 INFO L93 Difference]: Finished difference Result 1071 states and 1705 transitions. [2019-10-15 01:09:38,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:09:38,533 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-15 01:09:38,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:38,539 INFO L225 Difference]: With dead ends: 1071 [2019-10-15 01:09:38,540 INFO L226 Difference]: Without dead ends: 564 [2019-10-15 01:09:38,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:09:38,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-15 01:09:38,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-10-15 01:09:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-15 01:09:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 883 transitions. [2019-10-15 01:09:38,576 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 883 transitions. Word has length 98 [2019-10-15 01:09:38,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:38,577 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 883 transitions. [2019-10-15 01:09:38,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:09:38,577 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 883 transitions. [2019-10-15 01:09:38,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 01:09:38,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:38,580 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:38,581 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:38,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:38,581 INFO L82 PathProgramCache]: Analyzing trace with hash 910887794, now seen corresponding path program 1 times [2019-10-15 01:09:38,581 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:38,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398217956] [2019-10-15 01:09:38,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:38,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:38,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:38,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398217956] [2019-10-15 01:09:38,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:38,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:38,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105325538] [2019-10-15 01:09:38,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:38,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:38,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:38,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:38,808 INFO L87 Difference]: Start difference. First operand 564 states and 883 transitions. Second operand 6 states. [2019-10-15 01:09:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:42,308 INFO L93 Difference]: Finished difference Result 1670 states and 2699 transitions. [2019-10-15 01:09:42,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:42,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-15 01:09:42,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:42,317 INFO L225 Difference]: With dead ends: 1670 [2019-10-15 01:09:42,317 INFO L226 Difference]: Without dead ends: 1172 [2019-10-15 01:09:42,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:42,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2019-10-15 01:09:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1047. [2019-10-15 01:09:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-10-15 01:09:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1686 transitions. [2019-10-15 01:09:42,374 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1686 transitions. Word has length 99 [2019-10-15 01:09:42,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:42,374 INFO L462 AbstractCegarLoop]: Abstraction has 1047 states and 1686 transitions. [2019-10-15 01:09:42,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1686 transitions. [2019-10-15 01:09:42,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-15 01:09:42,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:42,379 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:42,379 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:42,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:42,380 INFO L82 PathProgramCache]: Analyzing trace with hash 728641115, now seen corresponding path program 1 times [2019-10-15 01:09:42,380 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:42,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439054080] [2019-10-15 01:09:42,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:42,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:42,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:42,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439054080] [2019-10-15 01:09:42,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:42,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:09:42,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714943686] [2019-10-15 01:09:42,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:09:42,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:42,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:09:42,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:09:42,610 INFO L87 Difference]: Start difference. First operand 1047 states and 1686 transitions. Second operand 12 states. [2019-10-15 01:09:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:52,894 INFO L93 Difference]: Finished difference Result 3352 states and 5434 transitions. [2019-10-15 01:09:52,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-15 01:09:52,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 131 [2019-10-15 01:09:52,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:52,910 INFO L225 Difference]: With dead ends: 3352 [2019-10-15 01:09:52,911 INFO L226 Difference]: Without dead ends: 2371 [2019-10-15 01:09:52,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-15 01:09:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2019-10-15 01:09:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2313. [2019-10-15 01:09:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2313 states. [2019-10-15 01:09:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3713 transitions. [2019-10-15 01:09:53,054 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3713 transitions. Word has length 131 [2019-10-15 01:09:53,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:53,055 INFO L462 AbstractCegarLoop]: Abstraction has 2313 states and 3713 transitions. [2019-10-15 01:09:53,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:09:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3713 transitions. [2019-10-15 01:09:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 01:09:53,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:53,060 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:53,060 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:53,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:53,060 INFO L82 PathProgramCache]: Analyzing trace with hash 552853337, now seen corresponding path program 1 times [2019-10-15 01:09:53,061 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:53,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458229956] [2019-10-15 01:09:53,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:53,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:53,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:53,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458229956] [2019-10-15 01:09:53,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:53,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:09:53,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224735388] [2019-10-15 01:09:53,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:09:53,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:53,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:09:53,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:09:53,231 INFO L87 Difference]: Start difference. First operand 2313 states and 3713 transitions. Second operand 9 states. [2019-10-15 01:09:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:57,045 INFO L93 Difference]: Finished difference Result 4600 states and 7543 transitions. [2019-10-15 01:09:57,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:09:57,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-10-15 01:09:57,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:57,065 INFO L225 Difference]: With dead ends: 4600 [2019-10-15 01:09:57,065 INFO L226 Difference]: Without dead ends: 2353 [2019-10-15 01:09:57,089 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:09:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-10-15 01:09:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2337. [2019-10-15 01:09:57,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-10-15 01:09:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3797 transitions. [2019-10-15 01:09:57,218 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3797 transitions. Word has length 132 [2019-10-15 01:09:57,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:57,219 INFO L462 AbstractCegarLoop]: Abstraction has 2337 states and 3797 transitions. [2019-10-15 01:09:57,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:09:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3797 transitions. [2019-10-15 01:09:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:09:57,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:57,223 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:57,224 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:57,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2055663078, now seen corresponding path program 1 times [2019-10-15 01:09:57,224 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:57,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196434494] [2019-10-15 01:09:57,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:57,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:57,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:57,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196434494] [2019-10-15 01:09:57,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:57,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:09:57,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699634880] [2019-10-15 01:09:57,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:09:57,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:57,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:09:57,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:57,433 INFO L87 Difference]: Start difference. First operand 2337 states and 3797 transitions. Second operand 8 states. [2019-10-15 01:10:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:03,731 INFO L93 Difference]: Finished difference Result 7919 states and 13290 transitions. [2019-10-15 01:10:03,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:10:03,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2019-10-15 01:10:03,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:03,772 INFO L225 Difference]: With dead ends: 7919 [2019-10-15 01:10:03,772 INFO L226 Difference]: Without dead ends: 5648 [2019-10-15 01:10:03,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:10:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5648 states. [2019-10-15 01:10:04,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5648 to 5600. [2019-10-15 01:10:04,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5600 states. [2019-10-15 01:10:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5600 states to 5600 states and 8993 transitions. [2019-10-15 01:10:04,159 INFO L78 Accepts]: Start accepts. Automaton has 5600 states and 8993 transitions. Word has length 133 [2019-10-15 01:10:04,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:04,160 INFO L462 AbstractCegarLoop]: Abstraction has 5600 states and 8993 transitions. [2019-10-15 01:10:04,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:10:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 5600 states and 8993 transitions. [2019-10-15 01:10:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:10:04,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:04,168 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:04,168 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:04,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:04,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2071050646, now seen corresponding path program 1 times [2019-10-15 01:10:04,169 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:04,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391291248] [2019-10-15 01:10:04,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:04,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:04,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:04,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391291248] [2019-10-15 01:10:04,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:04,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:10:04,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29135217] [2019-10-15 01:10:04,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:10:04,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:04,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:10:04,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:10:04,427 INFO L87 Difference]: Start difference. First operand 5600 states and 8993 transitions. Second operand 9 states.