java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:11:12,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:11:12,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:11:12,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:11:12,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:11:12,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:11:12,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:11:12,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:11:12,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:11:12,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:11:12,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:11:12,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:11:12,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:11:12,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:11:12,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:11:12,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:11:12,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:11:12,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:11:12,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:11:12,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:11:12,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:11:12,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:11:12,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:11:12,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:11:12,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:11:12,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:11:12,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:11:12,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:11:12,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:11:12,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:11:12,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:11:12,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:11:12,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:11:12,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:11:12,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:11:12,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:11:12,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:11:12,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:11:12,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:11:12,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:11:12,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:11:12,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:11:12,743 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:11:12,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:11:12,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:11:12,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:11:12,745 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:11:12,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:11:12,745 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:11:12,746 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:11:12,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:11:12,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:11:12,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:11:12,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:11:12,747 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:11:12,747 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:11:12,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:11:12,747 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:11:12,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:11:12,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:11:12,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:11:12,748 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:11:12,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:11:12,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:11:12,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:11:12,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:11:12,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:11:12,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:11:12,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:11:12,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:11:12,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:11:13,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:11:13,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:11:13,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:11:13,063 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:11:13,064 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:11:13,064 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product25.cil.c [2019-10-15 01:11:13,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5bc3523d/fb07dd6bf3ef494c87557c2da731a47e/FLAGdcfe3bdd5 [2019-10-15 01:11:13,792 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:11:13,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product25.cil.c [2019-10-15 01:11:13,826 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5bc3523d/fb07dd6bf3ef494c87557c2da731a47e/FLAGdcfe3bdd5 [2019-10-15 01:11:13,932 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5bc3523d/fb07dd6bf3ef494c87557c2da731a47e [2019-10-15 01:11:13,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:11:13,947 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:11:13,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:11:13,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:11:13,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:11:13,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:11:13" (1/1) ... [2019-10-15 01:11:13,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6886fec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:13, skipping insertion in model container [2019-10-15 01:11:13,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:11:13" (1/1) ... [2019-10-15 01:11:13,968 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:11:14,051 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:11:14,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:11:14,723 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:11:14,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:11:14,920 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:11:14,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:14 WrapperNode [2019-10-15 01:11:14,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:11:14,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:11:14,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:11:14,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:11:14,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:14" (1/1) ... [2019-10-15 01:11:14,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:14" (1/1) ... [2019-10-15 01:11:14,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:14" (1/1) ... [2019-10-15 01:11:14,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:14" (1/1) ... [2019-10-15 01:11:15,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:14" (1/1) ... [2019-10-15 01:11:15,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:14" (1/1) ... [2019-10-15 01:11:15,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:14" (1/1) ... [2019-10-15 01:11:15,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:11:15,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:11:15,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:11:15,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:11:15,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:11:15,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:11:15,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:11:15,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:11:15,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-15 01:11:15,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-15 01:11:15,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-15 01:11:15,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-15 01:11:15,236 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:11:15,236 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:11:15,237 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:11:15,237 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:11:15,237 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:11:15,238 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:11:15,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:11:15,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:11:15,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:11:15,241 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:11:15,241 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:11:15,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:11:15,242 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:11:15,243 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:11:15,243 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:11:15,244 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:11:15,244 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:11:15,244 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:11:15,244 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:11:15,244 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:11:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:11:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:11:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:11:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:11:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:11:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:11:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:11:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:11:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:11:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:11:15,247 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:11:15,247 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:11:15,247 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:11:15,248 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:11:15,248 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:11:15,248 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:11:15,248 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:11:15,248 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:11:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:11:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:11:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:11:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:11:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:11:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:11:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:11:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:11:15,251 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:11:15,251 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:11:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-15 01:11:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:11:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:11:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:11:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:11:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:11:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:11:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:11:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:11:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:11:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:11:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:11:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:11:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:11:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:11:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:11:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:11:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:11:15,256 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:11:15,256 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:11:15,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:11:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:11:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:11:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:11:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:11:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:11:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-15 01:11:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-15 01:11:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-15 01:11:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-15 01:11:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:11:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:11:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:11:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:11:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:11:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:11:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:11:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:11:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:11:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:11:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:11:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:11:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:11:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:11:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:11:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:11:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:11:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:11:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:11:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:11:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:11:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:11:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:11:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:11:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:11:15,265 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:11:15,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:11:15,265 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:11:15,265 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:11:15,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:11:15,265 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:11:15,266 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:11:15,266 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:11:15,266 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:11:15,267 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:11:15,267 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:11:15,267 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:11:15,268 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:11:15,268 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:11:15,269 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:11:15,269 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:11:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:11:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:11:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:11:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:11:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:11:15,271 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:11:15,271 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:11:15,271 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:11:15,271 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:11:15,272 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:11:15,272 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:11:15,275 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:11:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:11:15,279 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:11:15,280 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:11:15,280 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:11:15,280 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:11:15,281 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:11:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:11:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:11:15,287 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:11:15,287 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:11:15,287 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:11:15,287 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:11:15,287 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-15 01:11:15,287 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:11:15,288 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:11:15,288 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:11:15,288 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:11:15,288 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:11:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:11:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:11:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:11:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:11:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:11:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:11:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:11:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:11:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:11:17,514 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:11:17,515 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:11:17,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:11:17 BoogieIcfgContainer [2019-10-15 01:11:17,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:11:17,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:11:17,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:11:17,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:11:17,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:11:13" (1/3) ... [2019-10-15 01:11:17,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd2da59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:11:17, skipping insertion in model container [2019-10-15 01:11:17,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:14" (2/3) ... [2019-10-15 01:11:17,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd2da59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:11:17, skipping insertion in model container [2019-10-15 01:11:17,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:11:17" (3/3) ... [2019-10-15 01:11:17,525 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product25.cil.c [2019-10-15 01:11:17,535 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:11:17,545 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:11:17,555 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:11:17,597 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:11:17,597 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:11:17,597 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:11:17,597 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:11:17,598 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:11:17,598 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:11:17,598 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:11:17,598 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:11:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2019-10-15 01:11:17,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 01:11:17,667 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:17,668 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] [2019-10-15 01:11:17,670 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:17,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:17,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1728086077, now seen corresponding path program 1 times [2019-10-15 01:11:17,685 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:17,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135770324] [2019-10-15 01:11:17,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:18,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135770324] [2019-10-15 01:11:18,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:18,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:18,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649295627] [2019-10-15 01:11:18,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:18,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:18,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:18,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:18,379 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 4 states. [2019-10-15 01:11:18,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:18,596 INFO L93 Difference]: Finished difference Result 1161 states and 1887 transitions. [2019-10-15 01:11:18,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:18,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-15 01:11:18,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:18,630 INFO L225 Difference]: With dead ends: 1161 [2019-10-15 01:11:18,630 INFO L226 Difference]: Without dead ends: 589 [2019-10-15 01:11:18,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-15 01:11:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-15 01:11:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-15 01:11:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 945 transitions. [2019-10-15 01:11:18,743 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 945 transitions. Word has length 109 [2019-10-15 01:11:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:18,744 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 945 transitions. [2019-10-15 01:11:18,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 945 transitions. [2019-10-15 01:11:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:11:18,756 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:18,756 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] [2019-10-15 01:11:18,757 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:18,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:18,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1757589142, now seen corresponding path program 1 times [2019-10-15 01:11:18,758 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:18,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214050699] [2019-10-15 01:11:18,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:18,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:18,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:18,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214050699] [2019-10-15 01:11:18,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:18,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:18,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343322687] [2019-10-15 01:11:18,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:18,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:18,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:18,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:18,981 INFO L87 Difference]: Start difference. First operand 589 states and 945 transitions. Second operand 4 states. [2019-10-15 01:11:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:19,058 INFO L93 Difference]: Finished difference Result 1141 states and 1848 transitions. [2019-10-15 01:11:19,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:19,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-15 01:11:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:19,064 INFO L225 Difference]: With dead ends: 1141 [2019-10-15 01:11:19,065 INFO L226 Difference]: Without dead ends: 589 [2019-10-15 01:11:19,068 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-15 01:11:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-15 01:11:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-15 01:11:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 944 transitions. [2019-10-15 01:11:19,113 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 944 transitions. Word has length 112 [2019-10-15 01:11:19,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:19,114 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 944 transitions. [2019-10-15 01:11:19,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:19,114 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 944 transitions. [2019-10-15 01:11:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:11:19,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:19,119 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] [2019-10-15 01:11:19,119 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:19,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:19,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1080658030, now seen corresponding path program 1 times [2019-10-15 01:11:19,120 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:19,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570896487] [2019-10-15 01:11:19,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:19,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570896487] [2019-10-15 01:11:19,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:19,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:19,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115452509] [2019-10-15 01:11:19,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:19,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:19,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:19,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:19,326 INFO L87 Difference]: Start difference. First operand 589 states and 944 transitions. Second operand 4 states. [2019-10-15 01:11:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:19,394 INFO L93 Difference]: Finished difference Result 1141 states and 1847 transitions. [2019-10-15 01:11:19,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:19,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-15 01:11:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:19,401 INFO L225 Difference]: With dead ends: 1141 [2019-10-15 01:11:19,402 INFO L226 Difference]: Without dead ends: 589 [2019-10-15 01:11:19,405 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:19,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-15 01:11:19,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-15 01:11:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-15 01:11:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 943 transitions. [2019-10-15 01:11:19,447 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 943 transitions. Word has length 113 [2019-10-15 01:11:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:19,448 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 943 transitions. [2019-10-15 01:11:19,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 943 transitions. [2019-10-15 01:11:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:11:19,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:19,456 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] [2019-10-15 01:11:19,456 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:19,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:19,457 INFO L82 PathProgramCache]: Analyzing trace with hash -714374894, now seen corresponding path program 1 times [2019-10-15 01:11:19,457 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:19,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724919810] [2019-10-15 01:11:19,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:19,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724919810] [2019-10-15 01:11:19,633 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:19,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:19,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024096091] [2019-10-15 01:11:19,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:19,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:19,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:19,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:19,636 INFO L87 Difference]: Start difference. First operand 589 states and 943 transitions. Second operand 4 states. [2019-10-15 01:11:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:19,705 INFO L93 Difference]: Finished difference Result 1141 states and 1846 transitions. [2019-10-15 01:11:19,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:19,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:11:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:19,712 INFO L225 Difference]: With dead ends: 1141 [2019-10-15 01:11:19,712 INFO L226 Difference]: Without dead ends: 589 [2019-10-15 01:11:19,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-15 01:11:19,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-15 01:11:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-15 01:11:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 942 transitions. [2019-10-15 01:11:19,746 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 942 transitions. Word has length 114 [2019-10-15 01:11:19,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:19,747 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 942 transitions. [2019-10-15 01:11:19,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 942 transitions. [2019-10-15 01:11:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 01:11:19,752 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:19,752 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] [2019-10-15 01:11:19,752 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:19,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:19,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1484141674, now seen corresponding path program 1 times [2019-10-15 01:11:19,753 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:19,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231924239] [2019-10-15 01:11:19,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:19,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231924239] [2019-10-15 01:11:19,892 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:19,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:19,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703456568] [2019-10-15 01:11:19,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:19,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:19,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:19,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:19,895 INFO L87 Difference]: Start difference. First operand 589 states and 942 transitions. Second operand 4 states. [2019-10-15 01:11:19,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:19,953 INFO L93 Difference]: Finished difference Result 1141 states and 1845 transitions. [2019-10-15 01:11:19,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:19,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-15 01:11:19,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:19,959 INFO L225 Difference]: With dead ends: 1141 [2019-10-15 01:11:19,959 INFO L226 Difference]: Without dead ends: 589 [2019-10-15 01:11:19,962 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:19,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-15 01:11:19,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-15 01:11:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-15 01:11:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 941 transitions. [2019-10-15 01:11:19,986 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 941 transitions. Word has length 115 [2019-10-15 01:11:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:19,988 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 941 transitions. [2019-10-15 01:11:19,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 941 transitions. [2019-10-15 01:11:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:11:19,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:19,994 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] [2019-10-15 01:11:19,994 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:19,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:19,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1366326386, now seen corresponding path program 1 times [2019-10-15 01:11:19,995 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:19,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98655197] [2019-10-15 01:11:19,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:20,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98655197] [2019-10-15 01:11:20,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:20,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:11:20,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089583458] [2019-10-15 01:11:20,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:11:20,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:20,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:11:20,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:11:20,243 INFO L87 Difference]: Start difference. First operand 589 states and 941 transitions. Second operand 10 states. [2019-10-15 01:11:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:20,403 INFO L93 Difference]: Finished difference Result 1099 states and 1765 transitions. [2019-10-15 01:11:20,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:11:20,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2019-10-15 01:11:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:20,409 INFO L225 Difference]: With dead ends: 1099 [2019-10-15 01:11:20,409 INFO L226 Difference]: Without dead ends: 598 [2019-10-15 01:11:20,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:11:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-15 01:11:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-10-15 01:11:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-15 01:11:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 950 transitions. [2019-10-15 01:11:20,440 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 950 transitions. Word has length 116 [2019-10-15 01:11:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:20,444 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 950 transitions. [2019-10-15 01:11:20,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:11:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 950 transitions. [2019-10-15 01:11:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:11:20,449 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:20,449 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] [2019-10-15 01:11:20,449 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:20,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:20,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1937577619, now seen corresponding path program 1 times [2019-10-15 01:11:20,450 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:20,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799303442] [2019-10-15 01:11:20,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:20,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:20,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:20,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799303442] [2019-10-15 01:11:20,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:20,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:20,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655323223] [2019-10-15 01:11:20,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:20,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:20,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:20,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:20,575 INFO L87 Difference]: Start difference. First operand 596 states and 950 transitions. Second operand 4 states. [2019-10-15 01:11:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:20,636 INFO L93 Difference]: Finished difference Result 1147 states and 1851 transitions. [2019-10-15 01:11:20,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:20,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-15 01:11:20,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:20,646 INFO L225 Difference]: With dead ends: 1147 [2019-10-15 01:11:20,647 INFO L226 Difference]: Without dead ends: 583 [2019-10-15 01:11:20,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-15 01:11:20,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-15 01:11:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-15 01:11:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 927 transitions. [2019-10-15 01:11:20,679 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 927 transitions. Word has length 116 [2019-10-15 01:11:20,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:20,680 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 927 transitions. [2019-10-15 01:11:20,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 927 transitions. [2019-10-15 01:11:20,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:11:20,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:20,686 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] [2019-10-15 01:11:20,687 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:20,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:20,687 INFO L82 PathProgramCache]: Analyzing trace with hash 13298972, now seen corresponding path program 1 times [2019-10-15 01:11:20,687 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:20,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643559590] [2019-10-15 01:11:20,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:20,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:20,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:20,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643559590] [2019-10-15 01:11:20,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:20,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:20,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721739871] [2019-10-15 01:11:20,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:20,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:20,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:20,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:20,839 INFO L87 Difference]: Start difference. First operand 583 states and 927 transitions. Second operand 6 states. [2019-10-15 01:11:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:21,042 INFO L93 Difference]: Finished difference Result 1087 states and 1743 transitions. [2019-10-15 01:11:21,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:21,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-15 01:11:21,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:21,048 INFO L225 Difference]: With dead ends: 1087 [2019-10-15 01:11:21,048 INFO L226 Difference]: Without dead ends: 583 [2019-10-15 01:11:21,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-15 01:11:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-15 01:11:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-15 01:11:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 923 transitions. [2019-10-15 01:11:21,071 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 923 transitions. Word has length 117 [2019-10-15 01:11:21,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:21,071 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 923 transitions. [2019-10-15 01:11:21,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 923 transitions. [2019-10-15 01:11:21,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-15 01:11:21,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:21,075 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] [2019-10-15 01:11:21,075 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:21,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:21,076 INFO L82 PathProgramCache]: Analyzing trace with hash -65631567, now seen corresponding path program 1 times [2019-10-15 01:11:21,076 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:21,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495368305] [2019-10-15 01:11:21,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:21,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:21,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:21,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495368305] [2019-10-15 01:11:21,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:21,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:21,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157002278] [2019-10-15 01:11:21,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:21,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:21,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:21,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:21,239 INFO L87 Difference]: Start difference. First operand 583 states and 923 transitions. Second operand 6 states. [2019-10-15 01:11:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:21,414 INFO L93 Difference]: Finished difference Result 1087 states and 1739 transitions. [2019-10-15 01:11:21,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:21,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-15 01:11:21,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:21,419 INFO L225 Difference]: With dead ends: 1087 [2019-10-15 01:11:21,419 INFO L226 Difference]: Without dead ends: 583 [2019-10-15 01:11:21,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-15 01:11:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-15 01:11:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-15 01:11:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 919 transitions. [2019-10-15 01:11:21,443 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 919 transitions. Word has length 118 [2019-10-15 01:11:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:21,444 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 919 transitions. [2019-10-15 01:11:21,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 919 transitions. [2019-10-15 01:11:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 01:11:21,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:21,448 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] [2019-10-15 01:11:21,448 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:21,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:21,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1299849921, now seen corresponding path program 1 times [2019-10-15 01:11:21,448 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:21,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458634592] [2019-10-15 01:11:21,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:21,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:21,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:21,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458634592] [2019-10-15 01:11:21,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:21,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:21,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775394204] [2019-10-15 01:11:21,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:21,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:21,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:21,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:21,564 INFO L87 Difference]: Start difference. First operand 583 states and 919 transitions. Second operand 6 states. [2019-10-15 01:11:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:21,728 INFO L93 Difference]: Finished difference Result 1087 states and 1735 transitions. [2019-10-15 01:11:21,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:21,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-15 01:11:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:21,733 INFO L225 Difference]: With dead ends: 1087 [2019-10-15 01:11:21,734 INFO L226 Difference]: Without dead ends: 583 [2019-10-15 01:11:21,736 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-15 01:11:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-15 01:11:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-15 01:11:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 915 transitions. [2019-10-15 01:11:21,756 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 915 transitions. Word has length 119 [2019-10-15 01:11:21,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:21,756 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 915 transitions. [2019-10-15 01:11:21,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 915 transitions. [2019-10-15 01:11:21,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 01:11:21,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:21,760 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] [2019-10-15 01:11:21,760 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:21,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:21,761 INFO L82 PathProgramCache]: Analyzing trace with hash 333553473, now seen corresponding path program 1 times [2019-10-15 01:11:21,761 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:21,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024260916] [2019-10-15 01:11:21,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:21,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:21,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:21,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024260916] [2019-10-15 01:11:21,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:21,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:21,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272818643] [2019-10-15 01:11:21,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:21,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:21,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:21,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:21,897 INFO L87 Difference]: Start difference. First operand 583 states and 915 transitions. Second operand 7 states. [2019-10-15 01:11:21,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:21,976 INFO L93 Difference]: Finished difference Result 1087 states and 1731 transitions. [2019-10-15 01:11:21,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:21,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2019-10-15 01:11:21,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:21,981 INFO L225 Difference]: With dead ends: 1087 [2019-10-15 01:11:21,982 INFO L226 Difference]: Without dead ends: 562 [2019-10-15 01:11:21,985 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-15 01:11:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-15 01:11:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-15 01:11:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 881 transitions. [2019-10-15 01:11:22,005 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 881 transitions. Word has length 119 [2019-10-15 01:11:22,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:22,006 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 881 transitions. [2019-10-15 01:11:22,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:22,006 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 881 transitions. [2019-10-15 01:11:22,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:11:22,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:22,039 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] [2019-10-15 01:11:22,039 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:22,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:22,040 INFO L82 PathProgramCache]: Analyzing trace with hash 197463990, now seen corresponding path program 1 times [2019-10-15 01:11:22,040 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:22,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078997155] [2019-10-15 01:11:22,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:22,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078997155] [2019-10-15 01:11:22,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:22,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:22,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750591873] [2019-10-15 01:11:22,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:22,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:22,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:22,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:22,174 INFO L87 Difference]: Start difference. First operand 562 states and 881 transitions. Second operand 6 states. [2019-10-15 01:11:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:22,270 INFO L93 Difference]: Finished difference Result 1066 states and 1697 transitions. [2019-10-15 01:11:22,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:22,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-15 01:11:22,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:22,275 INFO L225 Difference]: With dead ends: 1066 [2019-10-15 01:11:22,276 INFO L226 Difference]: Without dead ends: 562 [2019-10-15 01:11:22,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:22,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-15 01:11:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-15 01:11:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-15 01:11:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 880 transitions. [2019-10-15 01:11:22,296 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 880 transitions. Word has length 120 [2019-10-15 01:11:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:22,297 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 880 transitions. [2019-10-15 01:11:22,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 880 transitions. [2019-10-15 01:11:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:11:22,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:22,301 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] [2019-10-15 01:11:22,301 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:22,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:22,301 INFO L82 PathProgramCache]: Analyzing trace with hash -99400602, now seen corresponding path program 1 times [2019-10-15 01:11:22,302 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:22,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088750219] [2019-10-15 01:11:22,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:22,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088750219] [2019-10-15 01:11:22,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:22,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:22,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951151185] [2019-10-15 01:11:22,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:22,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:22,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:22,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:22,417 INFO L87 Difference]: Start difference. First operand 562 states and 880 transitions. Second operand 6 states. [2019-10-15 01:11:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:22,510 INFO L93 Difference]: Finished difference Result 1066 states and 1696 transitions. [2019-10-15 01:11:22,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:22,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-10-15 01:11:22,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:22,515 INFO L225 Difference]: With dead ends: 1066 [2019-10-15 01:11:22,515 INFO L226 Difference]: Without dead ends: 562 [2019-10-15 01:11:22,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:22,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-15 01:11:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-15 01:11:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-15 01:11:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 879 transitions. [2019-10-15 01:11:22,536 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 879 transitions. Word has length 121 [2019-10-15 01:11:22,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:22,536 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 879 transitions. [2019-10-15 01:11:22,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 879 transitions. [2019-10-15 01:11:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:11:22,540 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:22,540 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] [2019-10-15 01:11:22,541 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:22,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:22,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1189017277, now seen corresponding path program 1 times [2019-10-15 01:11:22,541 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:22,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231229468] [2019-10-15 01:11:22,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:22,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231229468] [2019-10-15 01:11:22,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:22,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:22,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632945511] [2019-10-15 01:11:22,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:22,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:22,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:22,641 INFO L87 Difference]: Start difference. First operand 562 states and 879 transitions. Second operand 4 states. [2019-10-15 01:11:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:22,685 INFO L93 Difference]: Finished difference Result 1066 states and 1695 transitions. [2019-10-15 01:11:22,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:22,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-15 01:11:22,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:22,690 INFO L225 Difference]: With dead ends: 1066 [2019-10-15 01:11:22,690 INFO L226 Difference]: Without dead ends: 562 [2019-10-15 01:11:22,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-15 01:11:22,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-15 01:11:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-15 01:11:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 878 transitions. [2019-10-15 01:11:22,710 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 878 transitions. Word has length 122 [2019-10-15 01:11:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:22,710 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 878 transitions. [2019-10-15 01:11:22,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 878 transitions. [2019-10-15 01:11:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:11:22,714 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:22,714 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] [2019-10-15 01:11:22,714 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:22,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:22,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1194907461, now seen corresponding path program 1 times [2019-10-15 01:11:22,715 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:22,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500779861] [2019-10-15 01:11:22,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:22,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500779861] [2019-10-15 01:11:22,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:22,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:11:22,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222277881] [2019-10-15 01:11:22,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:11:22,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:22,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:11:22,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:11:22,939 INFO L87 Difference]: Start difference. First operand 562 states and 878 transitions. Second operand 12 states. [2019-10-15 01:11:23,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:23,107 INFO L93 Difference]: Finished difference Result 1067 states and 1694 transitions. [2019-10-15 01:11:23,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:11:23,107 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-10-15 01:11:23,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:23,112 INFO L225 Difference]: With dead ends: 1067 [2019-10-15 01:11:23,112 INFO L226 Difference]: Without dead ends: 562 [2019-10-15 01:11:23,116 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:11:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-15 01:11:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-15 01:11:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-15 01:11:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 877 transitions. [2019-10-15 01:11:23,141 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 877 transitions. Word has length 122 [2019-10-15 01:11:23,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:23,142 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 877 transitions. [2019-10-15 01:11:23,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:11:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 877 transitions. [2019-10-15 01:11:23,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-15 01:11:23,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:23,146 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] [2019-10-15 01:11:23,146 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:23,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:23,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1301394887, now seen corresponding path program 1 times [2019-10-15 01:11:23,147 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:23,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104239569] [2019-10-15 01:11:23,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:23,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104239569] [2019-10-15 01:11:23,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:23,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:11:23,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148760562] [2019-10-15 01:11:23,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:11:23,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:23,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:11:23,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:11:23,378 INFO L87 Difference]: Start difference. First operand 562 states and 877 transitions. Second operand 9 states. [2019-10-15 01:11:26,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:26,693 INFO L93 Difference]: Finished difference Result 1064 states and 1708 transitions. [2019-10-15 01:11:26,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:11:26,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-10-15 01:11:26,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:26,698 INFO L225 Difference]: With dead ends: 1064 [2019-10-15 01:11:26,699 INFO L226 Difference]: Without dead ends: 568 [2019-10-15 01:11:26,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:11:26,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-15 01:11:26,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2019-10-15 01:11:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-15 01:11:26,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 896 transitions. [2019-10-15 01:11:26,726 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 896 transitions. Word has length 123 [2019-10-15 01:11:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:26,727 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 896 transitions. [2019-10-15 01:11:26,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:11:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 896 transitions. [2019-10-15 01:11:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-15 01:11:26,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:26,730 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] [2019-10-15 01:11:26,731 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:26,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:26,731 INFO L82 PathProgramCache]: Analyzing trace with hash -613976497, now seen corresponding path program 1 times [2019-10-15 01:11:26,731 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:26,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362028052] [2019-10-15 01:11:26,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:26,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362028052] [2019-10-15 01:11:26,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:26,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:11:26,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140894742] [2019-10-15 01:11:26,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:11:26,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:26,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:11:26,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:26,870 INFO L87 Difference]: Start difference. First operand 566 states and 896 transitions. Second operand 8 states. [2019-10-15 01:11:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:32,540 INFO L93 Difference]: Finished difference Result 1990 states and 3279 transitions. [2019-10-15 01:11:32,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:11:32,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 124 [2019-10-15 01:11:32,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:32,559 INFO L225 Difference]: With dead ends: 1990 [2019-10-15 01:11:32,560 INFO L226 Difference]: Without dead ends: 1490 [2019-10-15 01:11:32,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:11:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2019-10-15 01:11:32,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1451. [2019-10-15 01:11:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-10-15 01:11:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2319 transitions. [2019-10-15 01:11:32,675 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2319 transitions. Word has length 124 [2019-10-15 01:11:32,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:32,676 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 2319 transitions. [2019-10-15 01:11:32,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:11:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2319 transitions. [2019-10-15 01:11:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 01:11:32,681 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:32,682 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] [2019-10-15 01:11:32,682 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:32,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:32,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1563620061, now seen corresponding path program 1 times [2019-10-15 01:11:32,683 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:32,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860126970] [2019-10-15 01:11:32,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:32,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:32,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:32,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:32,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860126970] [2019-10-15 01:11:32,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:32,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:11:32,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179978418] [2019-10-15 01:11:32,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:11:32,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:32,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:11:32,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:11:32,907 INFO L87 Difference]: Start difference. First operand 1451 states and 2319 transitions. Second operand 9 states. [2019-10-15 01:11:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:39,971 INFO L93 Difference]: Finished difference Result 4654 states and 7664 transitions. [2019-10-15 01:11:39,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:11:39,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-10-15 01:11:39,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:39,997 INFO L225 Difference]: With dead ends: 4654 [2019-10-15 01:11:39,997 INFO L226 Difference]: Without dead ends: 3269 [2019-10-15 01:11:40,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:11:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-10-15 01:11:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3046. [2019-10-15 01:11:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3046 states. [2019-10-15 01:11:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 4929 transitions. [2019-10-15 01:11:40,157 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 4929 transitions. Word has length 130 [2019-10-15 01:11:40,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:40,157 INFO L462 AbstractCegarLoop]: Abstraction has 3046 states and 4929 transitions. [2019-10-15 01:11:40,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:11:40,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 4929 transitions. [2019-10-15 01:11:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 01:11:40,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:40,161 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] [2019-10-15 01:11:40,161 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:40,162 INFO L82 PathProgramCache]: Analyzing trace with hash -430429468, now seen corresponding path program 1 times [2019-10-15 01:11:40,162 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:40,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181081058] [2019-10-15 01:11:40,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:40,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:40,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:40,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181081058] [2019-10-15 01:11:40,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:40,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:11:40,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949373273] [2019-10-15 01:11:40,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:11:40,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:40,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:11:40,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:40,298 INFO L87 Difference]: Start difference. First operand 3046 states and 4929 transitions. Second operand 5 states. [2019-10-15 01:11:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:42,534 INFO L93 Difference]: Finished difference Result 6665 states and 10769 transitions. [2019-10-15 01:11:42,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:42,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-15 01:11:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:42,564 INFO L225 Difference]: With dead ends: 6665 [2019-10-15 01:11:42,564 INFO L226 Difference]: Without dead ends: 4471 [2019-10-15 01:11:42,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:42,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4471 states. [2019-10-15 01:11:42,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4471 to 4444. [2019-10-15 01:11:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4444 states. [2019-10-15 01:11:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 7119 transitions. [2019-10-15 01:11:42,791 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 7119 transitions. Word has length 130 [2019-10-15 01:11:42,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:42,792 INFO L462 AbstractCegarLoop]: Abstraction has 4444 states and 7119 transitions. [2019-10-15 01:11:42,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:11:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 7119 transitions. [2019-10-15 01:11:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 01:11:42,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:42,795 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] [2019-10-15 01:11:42,796 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:42,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:42,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1936265126, now seen corresponding path program 1 times [2019-10-15 01:11:42,796 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:42,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213708889] [2019-10-15 01:11:42,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:42,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:42,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:42,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213708889] [2019-10-15 01:11:42,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:42,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:42,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910541081] [2019-10-15 01:11:42,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:42,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:42,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:42,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:42,974 INFO L87 Difference]: Start difference. First operand 4444 states and 7119 transitions. Second operand 7 states.