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_spec14_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:08:15,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:08:15,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:08:15,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:08:15,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:08:15,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:08:15,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:08:15,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:08:15,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:08:15,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:08:15,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:08:15,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:08:15,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:08:15,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:08:15,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:08:15,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:08:15,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:08:15,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:08:15,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:08:15,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:08:15,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:08:15,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:08:15,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:08:15,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:08:15,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:08:15,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:08:15,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:08:15,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:08:15,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:08:15,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:08:15,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:08:15,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:08:15,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:08:15,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:08:15,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:08:15,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:08:15,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:08:15,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:08:15,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:08:15,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:08:15,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:08:15,289 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:08:15,318 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:08:15,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:08:15,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:08:15,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:08:15,323 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:08:15,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:08:15,324 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:08:15,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:08:15,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:08:15,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:08:15,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:08:15,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:08:15,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:08:15,326 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:08:15,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:08:15,327 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:08:15,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:08:15,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:08:15,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:08:15,328 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:08:15,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:08:15,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:08:15,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:08:15,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:08:15,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:08:15,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:08:15,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:08:15,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:08:15,329 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:08:15,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:08:15,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:08:15,628 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:08:15,629 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:08:15,630 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:08:15,630 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_productSimulator.cil.c [2019-10-15 01:08:15,693 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f0b75d46/46f9c3c3fc914946aa45b3efa7c43345/FLAG7a491963c [2019-10-15 01:08:16,407 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:08:16,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_productSimulator.cil.c [2019-10-15 01:08:16,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f0b75d46/46f9c3c3fc914946aa45b3efa7c43345/FLAG7a491963c [2019-10-15 01:08:16,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f0b75d46/46f9c3c3fc914946aa45b3efa7c43345 [2019-10-15 01:08:16,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:08:16,555 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:08:16,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:08:16,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:08:16,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:08:16,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:08:16" (1/1) ... [2019-10-15 01:08:16,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7e2ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:16, skipping insertion in model container [2019-10-15 01:08:16,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:08:16" (1/1) ... [2019-10-15 01:08:16,574 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:08:16,665 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:08:17,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:08:17,451 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:08:17,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:08:17,762 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:08:17,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:17 WrapperNode [2019-10-15 01:08:17,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:08:17,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:08:17,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:08:17,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:08:17,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:17" (1/1) ... [2019-10-15 01:08:17,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:17" (1/1) ... [2019-10-15 01:08:17,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:17" (1/1) ... [2019-10-15 01:08:17,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:17" (1/1) ... [2019-10-15 01:08:17,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:17" (1/1) ... [2019-10-15 01:08:18,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:17" (1/1) ... [2019-10-15 01:08:18,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:17" (1/1) ... [2019-10-15 01:08:18,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:08:18,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:08:18,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:08:18,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:08:18,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:17" (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:08:18,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:08:18,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:08:18,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:08:18,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-15 01:08:18,112 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:08:18,112 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:08:18,112 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:08:18,113 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:08:18,113 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:08:18,113 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:08:18,113 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:08:18,113 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:08:18,114 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:08:18,114 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:08:18,114 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:08:18,114 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:08:18,114 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:08:18,115 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:08:18,115 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:08:18,115 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:08:18,115 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:08:18,115 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:08:18,116 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:08:18,116 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:08:18,116 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:08:18,116 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:08:18,116 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:08:18,116 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:08:18,117 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:08:18,117 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:08:18,117 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:08:18,117 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:08:18,117 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:08:18,117 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:08:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:08:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:08:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:08:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:08:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:08:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:08:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:08:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__before__overloaded [2019-10-15 01:08:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__role__overloaded [2019-10-15 01:08:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:08:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__before__weight [2019-10-15 01:08:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__role__weight [2019-10-15 01:08:18,120 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:08:18,120 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__weight [2019-10-15 01:08:18,120 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__weight [2019-10-15 01:08:18,120 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__empty [2019-10-15 01:08:18,120 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__empty [2019-10-15 01:08:18,120 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:08:18,120 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:08:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:08:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:08:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:08:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:08:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:08:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:08:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:08:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:08:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-15 01:08:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-15 01:08:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__executivefloor [2019-10-15 01:08:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__executivefloor [2019-10-15 01:08:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:08:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:08:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:08:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-15 01:08:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-15 01:08:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-15 01:08:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-15 01:08:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:08:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:08:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:08:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__before__overloaded [2019-10-15 01:08:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__role__overloaded [2019-10-15 01:08:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:08:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__before__overloaded [2019-10-15 01:08:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__role__overloaded [2019-10-15 01:08:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:08:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:08:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-15 01:08:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-15 01:08:18,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:08:18,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:08:18,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:08:18,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:08:18,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:08:18,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:08:18,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:08:18,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:08:18,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:08:18,126 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:08:18,126 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:08:18,126 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:08:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-15 01:08:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-15 01:08:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-15 01:08:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:08:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:08:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:08:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:08:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:08:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:08:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:08:18,129 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:08:18,129 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:08:18,129 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:08:18,129 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:08:18,130 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:08:18,130 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:08:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:08:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:08:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:08:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:08:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:08:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:08:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:08:18,132 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:08:18,132 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:08:18,132 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:08:18,132 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:08:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:08:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:08:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:08:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:08:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:08:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:08:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:08:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:08:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:08:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:08:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:08:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:08:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:08:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__before__overloaded [2019-10-15 01:08:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__role__overloaded [2019-10-15 01:08:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__before__weight [2019-10-15 01:08:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__role__weight [2019-10-15 01:08:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__weight [2019-10-15 01:08:18,136 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__weight [2019-10-15 01:08:18,136 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__empty [2019-10-15 01:08:18,136 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__empty [2019-10-15 01:08:18,136 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:08:18,136 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:08:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:08:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:08:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:08:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-15 01:08:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-15 01:08:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__executivefloor [2019-10-15 01:08:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__executivefloor [2019-10-15 01:08:18,138 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:08:18,138 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:08:18,138 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-15 01:08:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-15 01:08:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-15 01:08:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-15 01:08:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:08:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:08:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:08:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__before__overloaded [2019-10-15 01:08:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__role__overloaded [2019-10-15 01:08:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure printState__before__overloaded [2019-10-15 01:08:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:08:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure printState__role__overloaded [2019-10-15 01:08:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:08:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:08:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:08:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:08:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:08:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:08:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:08:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:08:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:08:18,142 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:08:18,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:08:18,142 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:08:18,142 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:08:18,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:08:18,142 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:08:18,143 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:08:18,143 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:08:18,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:08:18,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:08:18,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:08:20,712 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:08:20,712 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:08:20,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:08:20 BoogieIcfgContainer [2019-10-15 01:08:20,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:08:20,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:08:20,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:08:20,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:08:20,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:08:16" (1/3) ... [2019-10-15 01:08:20,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f82985d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:08:20, skipping insertion in model container [2019-10-15 01:08:20,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:17" (2/3) ... [2019-10-15 01:08:20,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f82985d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:08:20, skipping insertion in model container [2019-10-15 01:08:20,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:08:20" (3/3) ... [2019-10-15 01:08:20,725 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_productSimulator.cil.c [2019-10-15 01:08:20,736 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:08:20,749 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:08:20,764 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:08:20,814 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:08:20,814 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:08:20,815 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:08:20,815 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:08:20,815 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:08:20,815 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:08:20,815 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:08:20,816 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:08:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states. [2019-10-15 01:08:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:08:20,930 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:20,932 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:20,936 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2107990238, now seen corresponding path program 1 times [2019-10-15 01:08:20,952 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:20,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880768587] [2019-10-15 01:08:20,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:20,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:20,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:21,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880768587] [2019-10-15 01:08:21,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:21,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:21,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696753464] [2019-10-15 01:08:21,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:21,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:21,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:21,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:21,785 INFO L87 Difference]: Start difference. First operand 890 states. Second operand 6 states. [2019-10-15 01:08:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:22,056 INFO L93 Difference]: Finished difference Result 1446 states and 2245 transitions. [2019-10-15 01:08:22,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:22,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-15 01:08:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:22,096 INFO L225 Difference]: With dead ends: 1446 [2019-10-15 01:08:22,096 INFO L226 Difference]: Without dead ends: 726 [2019-10-15 01:08:22,111 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:08:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-10-15 01:08:22,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2019-10-15 01:08:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-10-15 01:08:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1115 transitions. [2019-10-15 01:08:22,270 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1115 transitions. Word has length 120 [2019-10-15 01:08:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:22,278 INFO L462 AbstractCegarLoop]: Abstraction has 726 states and 1115 transitions. [2019-10-15 01:08:22,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1115 transitions. [2019-10-15 01:08:22,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:08:22,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:22,294 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:22,295 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:22,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2135919125, now seen corresponding path program 1 times [2019-10-15 01:08:22,298 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:22,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566156807] [2019-10-15 01:08:22,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:22,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:22,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:22,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566156807] [2019-10-15 01:08:22,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:22,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:22,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130719396] [2019-10-15 01:08:22,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:22,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:22,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:22,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:22,593 INFO L87 Difference]: Start difference. First operand 726 states and 1115 transitions. Second operand 4 states. [2019-10-15 01:08:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:22,723 INFO L93 Difference]: Finished difference Result 1410 states and 2184 transitions. [2019-10-15 01:08:22,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:08:22,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-10-15 01:08:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:22,734 INFO L225 Difference]: With dead ends: 1410 [2019-10-15 01:08:22,734 INFO L226 Difference]: Without dead ends: 730 [2019-10-15 01:08:22,739 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:08:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-15 01:08:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-10-15 01:08:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-15 01:08:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1118 transitions. [2019-10-15 01:08:22,794 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1118 transitions. Word has length 121 [2019-10-15 01:08:22,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:22,795 INFO L462 AbstractCegarLoop]: Abstraction has 730 states and 1118 transitions. [2019-10-15 01:08:22,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1118 transitions. [2019-10-15 01:08:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:08:22,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:22,799 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:22,799 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:22,799 INFO L82 PathProgramCache]: Analyzing trace with hash -542373665, now seen corresponding path program 1 times [2019-10-15 01:08:22,800 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:22,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880434544] [2019-10-15 01:08:22,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:22,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:22,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:22,980 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:22,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880434544] [2019-10-15 01:08:22,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:22,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:22,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777181914] [2019-10-15 01:08:22,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:22,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:22,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:22,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:22,984 INFO L87 Difference]: Start difference. First operand 730 states and 1118 transitions. Second operand 4 states. [2019-10-15 01:08:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:23,070 INFO L93 Difference]: Finished difference Result 1407 states and 2171 transitions. [2019-10-15 01:08:23,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:23,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-15 01:08:23,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:23,077 INFO L225 Difference]: With dead ends: 1407 [2019-10-15 01:08:23,077 INFO L226 Difference]: Without dead ends: 730 [2019-10-15 01:08:23,081 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:08:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-15 01:08:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-10-15 01:08:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-15 01:08:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1117 transitions. [2019-10-15 01:08:23,106 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1117 transitions. Word has length 122 [2019-10-15 01:08:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:23,107 INFO L462 AbstractCegarLoop]: Abstraction has 730 states and 1117 transitions. [2019-10-15 01:08:23,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:23,107 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1117 transitions. [2019-10-15 01:08:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-15 01:08:23,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:23,110 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:23,110 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:23,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:23,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2073857327, now seen corresponding path program 1 times [2019-10-15 01:08:23,111 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:23,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43069241] [2019-10-15 01:08:23,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:23,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43069241] [2019-10-15 01:08:23,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:23,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:23,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772082182] [2019-10-15 01:08:23,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:23,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:23,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:23,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:23,331 INFO L87 Difference]: Start difference. First operand 730 states and 1117 transitions. Second operand 4 states. [2019-10-15 01:08:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:23,432 INFO L93 Difference]: Finished difference Result 1407 states and 2170 transitions. [2019-10-15 01:08:23,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:23,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-10-15 01:08:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:23,448 INFO L225 Difference]: With dead ends: 1407 [2019-10-15 01:08:23,448 INFO L226 Difference]: Without dead ends: 730 [2019-10-15 01:08:23,452 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:08:23,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-15 01:08:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-10-15 01:08:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-15 01:08:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1116 transitions. [2019-10-15 01:08:23,484 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1116 transitions. Word has length 123 [2019-10-15 01:08:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:23,485 INFO L462 AbstractCegarLoop]: Abstraction has 730 states and 1116 transitions. [2019-10-15 01:08:23,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1116 transitions. [2019-10-15 01:08:23,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-15 01:08:23,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:23,488 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:23,488 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:23,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:23,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1880970907, now seen corresponding path program 1 times [2019-10-15 01:08:23,488 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:23,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112943510] [2019-10-15 01:08:23,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:23,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112943510] [2019-10-15 01:08:23,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:23,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:23,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772802933] [2019-10-15 01:08:23,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:23,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:23,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:23,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:23,688 INFO L87 Difference]: Start difference. First operand 730 states and 1116 transitions. Second operand 4 states. [2019-10-15 01:08:23,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:23,764 INFO L93 Difference]: Finished difference Result 1407 states and 2169 transitions. [2019-10-15 01:08:23,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:23,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-15 01:08:23,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:23,781 INFO L225 Difference]: With dead ends: 1407 [2019-10-15 01:08:23,782 INFO L226 Difference]: Without dead ends: 730 [2019-10-15 01:08:23,791 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:08:23,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-15 01:08:23,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-10-15 01:08:23,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-15 01:08:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1115 transitions. [2019-10-15 01:08:23,831 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1115 transitions. Word has length 124 [2019-10-15 01:08:23,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:23,832 INFO L462 AbstractCegarLoop]: Abstraction has 730 states and 1115 transitions. [2019-10-15 01:08:23,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1115 transitions. [2019-10-15 01:08:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-15 01:08:23,837 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:23,837 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:23,838 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:23,838 INFO L82 PathProgramCache]: Analyzing trace with hash -182191219, now seen corresponding path program 1 times [2019-10-15 01:08:23,839 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:23,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037054619] [2019-10-15 01:08:23,839 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,839 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:24,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037054619] [2019-10-15 01:08:24,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:24,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:24,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112752781] [2019-10-15 01:08:24,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:24,005 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:24,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:24,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:24,005 INFO L87 Difference]: Start difference. First operand 730 states and 1115 transitions. Second operand 4 states. [2019-10-15 01:08:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:24,131 INFO L93 Difference]: Finished difference Result 1407 states and 2168 transitions. [2019-10-15 01:08:24,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:24,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-10-15 01:08:24,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:24,138 INFO L225 Difference]: With dead ends: 1407 [2019-10-15 01:08:24,138 INFO L226 Difference]: Without dead ends: 730 [2019-10-15 01:08:24,142 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:08:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-15 01:08:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-10-15 01:08:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-15 01:08:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1114 transitions. [2019-10-15 01:08:24,172 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1114 transitions. Word has length 125 [2019-10-15 01:08:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:24,172 INFO L462 AbstractCegarLoop]: Abstraction has 730 states and 1114 transitions. [2019-10-15 01:08:24,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1114 transitions. [2019-10-15 01:08:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-15 01:08:24,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:24,175 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:24,175 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:24,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:24,176 INFO L82 PathProgramCache]: Analyzing trace with hash 175506519, now seen corresponding path program 1 times [2019-10-15 01:08:24,176 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:24,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771358861] [2019-10-15 01:08:24,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:24,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:24,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:24,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771358861] [2019-10-15 01:08:24,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:24,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:08:24,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686458144] [2019-10-15 01:08:24,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:08:24,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:24,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:08:24,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:08:24,395 INFO L87 Difference]: Start difference. First operand 730 states and 1114 transitions. Second operand 11 states. [2019-10-15 01:08:24,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:24,597 INFO L93 Difference]: Finished difference Result 1412 states and 2175 transitions. [2019-10-15 01:08:24,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:08:24,598 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2019-10-15 01:08:24,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:24,604 INFO L225 Difference]: With dead ends: 1412 [2019-10-15 01:08:24,604 INFO L226 Difference]: Without dead ends: 739 [2019-10-15 01:08:24,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:08:24,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-10-15 01:08:24,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2019-10-15 01:08:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-10-15 01:08:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1124 transitions. [2019-10-15 01:08:24,641 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1124 transitions. Word has length 126 [2019-10-15 01:08:24,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:24,642 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1124 transitions. [2019-10-15 01:08:24,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:08:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1124 transitions. [2019-10-15 01:08:24,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-15 01:08:24,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:24,645 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:24,645 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:24,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:24,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1999173578, now seen corresponding path program 1 times [2019-10-15 01:08:24,646 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:24,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128446101] [2019-10-15 01:08:24,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:24,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:24,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:24,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128446101] [2019-10-15 01:08:24,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:24,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:24,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224890830] [2019-10-15 01:08:24,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:24,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:24,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:24,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:24,788 INFO L87 Difference]: Start difference. First operand 737 states and 1124 transitions. Second operand 4 states. [2019-10-15 01:08:24,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:24,855 INFO L93 Difference]: Finished difference Result 1413 states and 2176 transitions. [2019-10-15 01:08:24,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:08:24,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-10-15 01:08:24,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:24,861 INFO L225 Difference]: With dead ends: 1413 [2019-10-15 01:08:24,861 INFO L226 Difference]: Without dead ends: 733 [2019-10-15 01:08:24,866 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:08:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-10-15 01:08:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2019-10-15 01:08:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-10-15 01:08:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1117 transitions. [2019-10-15 01:08:24,893 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1117 transitions. Word has length 126 [2019-10-15 01:08:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:24,893 INFO L462 AbstractCegarLoop]: Abstraction has 733 states and 1117 transitions. [2019-10-15 01:08:24,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1117 transitions. [2019-10-15 01:08:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 01:08:24,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:24,896 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:24,896 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:24,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:24,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1624055113, now seen corresponding path program 1 times [2019-10-15 01:08:24,897 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:24,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873771910] [2019-10-15 01:08:24,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:24,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:24,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:25,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873771910] [2019-10-15 01:08:25,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:25,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:25,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068248197] [2019-10-15 01:08:25,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:25,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:25,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:25,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:25,096 INFO L87 Difference]: Start difference. First operand 733 states and 1117 transitions. Second operand 6 states. [2019-10-15 01:08:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:25,406 INFO L93 Difference]: Finished difference Result 1426 states and 2200 transitions. [2019-10-15 01:08:25,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:08:25,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-10-15 01:08:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:25,413 INFO L225 Difference]: With dead ends: 1426 [2019-10-15 01:08:25,414 INFO L226 Difference]: Without dead ends: 741 [2019-10-15 01:08:25,418 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:08:25,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-10-15 01:08:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 738. [2019-10-15 01:08:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-10-15 01:08:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1118 transitions. [2019-10-15 01:08:25,456 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1118 transitions. Word has length 127 [2019-10-15 01:08:25,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:25,457 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1118 transitions. [2019-10-15 01:08:25,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1118 transitions. [2019-10-15 01:08:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:08:25,459 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:25,460 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:25,460 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:25,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:25,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1494752762, now seen corresponding path program 1 times [2019-10-15 01:08:25,461 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:25,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293232565] [2019-10-15 01:08:25,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:25,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:25,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:25,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293232565] [2019-10-15 01:08:25,613 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:25,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:25,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084439923] [2019-10-15 01:08:25,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:25,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:25,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:25,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:25,616 INFO L87 Difference]: Start difference. First operand 738 states and 1118 transitions. Second operand 6 states. [2019-10-15 01:08:25,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:25,942 INFO L93 Difference]: Finished difference Result 1389 states and 2115 transitions. [2019-10-15 01:08:25,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:25,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-10-15 01:08:25,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:25,950 INFO L225 Difference]: With dead ends: 1389 [2019-10-15 01:08:25,950 INFO L226 Difference]: Without dead ends: 738 [2019-10-15 01:08:25,962 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:08:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-10-15 01:08:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-10-15 01:08:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-10-15 01:08:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1114 transitions. [2019-10-15 01:08:26,011 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1114 transitions. Word has length 128 [2019-10-15 01:08:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:26,012 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1114 transitions. [2019-10-15 01:08:26,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1114 transitions. [2019-10-15 01:08:26,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-15 01:08:26,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:26,017 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:26,017 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:26,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:26,017 INFO L82 PathProgramCache]: Analyzing trace with hash 638673006, now seen corresponding path program 1 times [2019-10-15 01:08:26,018 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:26,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096321348] [2019-10-15 01:08:26,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:26,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:26,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:26,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096321348] [2019-10-15 01:08:26,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:26,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:26,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424408932] [2019-10-15 01:08:26,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:26,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:26,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:26,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:26,241 INFO L87 Difference]: Start difference. First operand 738 states and 1114 transitions. Second operand 6 states. [2019-10-15 01:08:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:26,466 INFO L93 Difference]: Finished difference Result 1389 states and 2111 transitions. [2019-10-15 01:08:26,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:26,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-10-15 01:08:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:26,473 INFO L225 Difference]: With dead ends: 1389 [2019-10-15 01:08:26,474 INFO L226 Difference]: Without dead ends: 738 [2019-10-15 01:08:26,478 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:08:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-10-15 01:08:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-10-15 01:08:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-10-15 01:08:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1110 transitions. [2019-10-15 01:08:26,511 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1110 transitions. Word has length 129 [2019-10-15 01:08:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:26,513 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1110 transitions. [2019-10-15 01:08:26,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1110 transitions. [2019-10-15 01:08:26,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-15 01:08:26,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:26,516 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:26,516 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:26,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:26,517 INFO L82 PathProgramCache]: Analyzing trace with hash 805428462, now seen corresponding path program 1 times [2019-10-15 01:08:26,517 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:26,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245192014] [2019-10-15 01:08:26,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:26,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:26,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:26,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245192014] [2019-10-15 01:08:26,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:26,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:08:26,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144893057] [2019-10-15 01:08:26,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:08:26,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:26,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:08:26,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:08:26,684 INFO L87 Difference]: Start difference. First operand 738 states and 1110 transitions. Second operand 7 states. [2019-10-15 01:08:26,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:26,826 INFO L93 Difference]: Finished difference Result 1392 states and 2111 transitions. [2019-10-15 01:08:26,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:08:26,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2019-10-15 01:08:26,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:26,839 INFO L225 Difference]: With dead ends: 1392 [2019-10-15 01:08:26,839 INFO L226 Difference]: Without dead ends: 720 [2019-10-15 01:08:26,845 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:08:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-10-15 01:08:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 717. [2019-10-15 01:08:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-15 01:08:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1073 transitions. [2019-10-15 01:08:26,878 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1073 transitions. Word has length 129 [2019-10-15 01:08:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:26,879 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1073 transitions. [2019-10-15 01:08:26,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:08:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1073 transitions. [2019-10-15 01:08:26,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 01:08:26,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:26,885 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:26,885 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:26,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:26,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1272669825, now seen corresponding path program 1 times [2019-10-15 01:08:26,886 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:26,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089325043] [2019-10-15 01:08:26,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:26,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:26,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:27,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089325043] [2019-10-15 01:08:27,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:27,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:27,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781705574] [2019-10-15 01:08:27,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:27,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:27,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:27,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:27,100 INFO L87 Difference]: Start difference. First operand 717 states and 1073 transitions. Second operand 6 states. [2019-10-15 01:08:27,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:27,250 INFO L93 Difference]: Finished difference Result 1368 states and 2070 transitions. [2019-10-15 01:08:27,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:27,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-10-15 01:08:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:27,257 INFO L225 Difference]: With dead ends: 1368 [2019-10-15 01:08:27,258 INFO L226 Difference]: Without dead ends: 717 [2019-10-15 01:08:27,262 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:08:27,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-15 01:08:27,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-10-15 01:08:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-15 01:08:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1072 transitions. [2019-10-15 01:08:27,296 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1072 transitions. Word has length 130 [2019-10-15 01:08:27,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:27,297 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1072 transitions. [2019-10-15 01:08:27,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:27,297 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1072 transitions. [2019-10-15 01:08:27,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-15 01:08:27,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:27,301 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:27,301 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:27,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:27,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1537429613, now seen corresponding path program 1 times [2019-10-15 01:08:27,302 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:27,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782025507] [2019-10-15 01:08:27,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:27,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:27,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:27,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782025507] [2019-10-15 01:08:27,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:27,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:27,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196992622] [2019-10-15 01:08:27,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:27,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:27,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:27,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:27,479 INFO L87 Difference]: Start difference. First operand 717 states and 1072 transitions. Second operand 6 states. [2019-10-15 01:08:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:27,616 INFO L93 Difference]: Finished difference Result 1368 states and 2069 transitions. [2019-10-15 01:08:27,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:27,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-10-15 01:08:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:27,623 INFO L225 Difference]: With dead ends: 1368 [2019-10-15 01:08:27,623 INFO L226 Difference]: Without dead ends: 717 [2019-10-15 01:08:27,628 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:08:27,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-15 01:08:27,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-10-15 01:08:27,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-15 01:08:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1071 transitions. [2019-10-15 01:08:27,653 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1071 transitions. Word has length 131 [2019-10-15 01:08:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:27,654 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1071 transitions. [2019-10-15 01:08:27,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1071 transitions. [2019-10-15 01:08:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 01:08:27,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:27,657 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:27,657 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:27,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:27,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1036805370, now seen corresponding path program 1 times [2019-10-15 01:08:27,658 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:27,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931210467] [2019-10-15 01:08:27,658 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:27,658 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:27,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:27,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931210467] [2019-10-15 01:08:27,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:27,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:27,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173056551] [2019-10-15 01:08:27,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:27,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:27,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:27,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:27,776 INFO L87 Difference]: Start difference. First operand 717 states and 1071 transitions. Second operand 4 states. [2019-10-15 01:08:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:27,859 INFO L93 Difference]: Finished difference Result 1368 states and 2068 transitions. [2019-10-15 01:08:27,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:08:27,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-10-15 01:08:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:27,865 INFO L225 Difference]: With dead ends: 1368 [2019-10-15 01:08:27,866 INFO L226 Difference]: Without dead ends: 717 [2019-10-15 01:08:27,870 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:08:27,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-15 01:08:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-10-15 01:08:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-15 01:08:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1070 transitions. [2019-10-15 01:08:27,893 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1070 transitions. Word has length 132 [2019-10-15 01:08:27,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:27,893 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1070 transitions. [2019-10-15 01:08:27,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1070 transitions. [2019-10-15 01:08:27,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 01:08:27,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:27,896 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:27,896 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:27,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:27,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1997244676, now seen corresponding path program 1 times [2019-10-15 01:08:27,897 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:27,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929078287] [2019-10-15 01:08:27,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:27,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:27,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:28,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929078287] [2019-10-15 01:08:28,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:28,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 01:08:28,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371553047] [2019-10-15 01:08:28,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:08:28,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:28,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:08:28,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:08:28,092 INFO L87 Difference]: Start difference. First operand 717 states and 1070 transitions. Second operand 13 states. [2019-10-15 01:08:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:28,393 INFO L93 Difference]: Finished difference Result 1374 states and 2078 transitions. [2019-10-15 01:08:28,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:08:28,394 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2019-10-15 01:08:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:28,401 INFO L225 Difference]: With dead ends: 1374 [2019-10-15 01:08:28,402 INFO L226 Difference]: Without dead ends: 724 [2019-10-15 01:08:28,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-10-15 01:08:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-10-15 01:08:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 722. [2019-10-15 01:08:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-10-15 01:08:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1076 transitions. [2019-10-15 01:08:28,435 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1076 transitions. Word has length 132 [2019-10-15 01:08:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:28,436 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1076 transitions. [2019-10-15 01:08:28,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:08:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1076 transitions. [2019-10-15 01:08:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:08:28,439 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:28,439 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:28,439 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:28,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:28,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2064235796, now seen corresponding path program 1 times [2019-10-15 01:08:28,440 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:28,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290228891] [2019-10-15 01:08:28,440 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:28,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:28,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:28,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290228891] [2019-10-15 01:08:28,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:28,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:08:28,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434444532] [2019-10-15 01:08:28,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:08:28,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:28,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:08:28,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:08:28,589 INFO L87 Difference]: Start difference. First operand 722 states and 1076 transitions. Second operand 3 states. [2019-10-15 01:08:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:28,683 INFO L93 Difference]: Finished difference Result 2040 states and 3094 transitions. [2019-10-15 01:08:28,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:08:28,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-10-15 01:08:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:28,699 INFO L225 Difference]: With dead ends: 2040 [2019-10-15 01:08:28,700 INFO L226 Difference]: Without dead ends: 1391 [2019-10-15 01:08:28,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:08:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2019-10-15 01:08:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1388. [2019-10-15 01:08:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2019-10-15 01:08:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2089 transitions. [2019-10-15 01:08:28,775 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2089 transitions. Word has length 133 [2019-10-15 01:08:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:28,776 INFO L462 AbstractCegarLoop]: Abstraction has 1388 states and 2089 transitions. [2019-10-15 01:08:28,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:08:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2089 transitions. [2019-10-15 01:08:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-15 01:08:28,781 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:28,782 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:28,782 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:28,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:28,783 INFO L82 PathProgramCache]: Analyzing trace with hash 565322765, now seen corresponding path program 1 times [2019-10-15 01:08:28,783 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:28,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611700768] [2019-10-15 01:08:28,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:28,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:28,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 01:08:28,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611700768] [2019-10-15 01:08:28,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:28,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:08:28,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533087216] [2019-10-15 01:08:28,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:28,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:28,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:28,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:08:28,999 INFO L87 Difference]: Start difference. First operand 1388 states and 2089 transitions. Second operand 5 states. [2019-10-15 01:08:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:32,915 INFO L93 Difference]: Finished difference Result 4171 states and 6512 transitions. [2019-10-15 01:08:32,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:32,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-10-15 01:08:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:32,937 INFO L225 Difference]: With dead ends: 4171 [2019-10-15 01:08:32,938 INFO L226 Difference]: Without dead ends: 2900 [2019-10-15 01:08:32,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2019-10-15 01:08:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2797. [2019-10-15 01:08:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-10-15 01:08:33,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4393 transitions. [2019-10-15 01:08:33,089 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4393 transitions. Word has length 134 [2019-10-15 01:08:33,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:33,090 INFO L462 AbstractCegarLoop]: Abstraction has 2797 states and 4393 transitions. [2019-10-15 01:08:33,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4393 transitions. [2019-10-15 01:08:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-15 01:08:33,100 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:33,100 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:33,100 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:33,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:33,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1763835588, now seen corresponding path program 1 times [2019-10-15 01:08:33,101 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:33,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454444856] [2019-10-15 01:08:33,101 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:33,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:33,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-15 01:08:33,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454444856] [2019-10-15 01:08:33,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:33,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:08:33,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873699424] [2019-10-15 01:08:33,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:08:33,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:33,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:08:33,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:08:33,337 INFO L87 Difference]: Start difference. First operand 2797 states and 4393 transitions. Second operand 9 states. [2019-10-15 01:08:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:34,948 INFO L93 Difference]: Finished difference Result 5465 states and 8713 transitions. [2019-10-15 01:08:34,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:08:34,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2019-10-15 01:08:34,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:34,978 INFO L225 Difference]: With dead ends: 5465 [2019-10-15 01:08:34,978 INFO L226 Difference]: Without dead ends: 2784 [2019-10-15 01:08:35,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:08:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2019-10-15 01:08:35,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2784. [2019-10-15 01:08:35,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2784 states. [2019-10-15 01:08:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4363 transitions. [2019-10-15 01:08:35,228 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4363 transitions. Word has length 179 [2019-10-15 01:08:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:35,228 INFO L462 AbstractCegarLoop]: Abstraction has 2784 states and 4363 transitions. [2019-10-15 01:08:35,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:08:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4363 transitions. [2019-10-15 01:08:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-15 01:08:35,240 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:35,240 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:35,241 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:35,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:35,241 INFO L82 PathProgramCache]: Analyzing trace with hash 679769725, now seen corresponding path program 1 times [2019-10-15 01:08:35,241 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:35,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948218290] [2019-10-15 01:08:35,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:35,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:35,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-15 01:08:35,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948218290] [2019-10-15 01:08:35,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:35,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:08:35,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952627317] [2019-10-15 01:08:35,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:08:35,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:35,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:08:35,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:08:35,415 INFO L87 Difference]: Start difference. First operand 2784 states and 4363 transitions. Second operand 3 states. [2019-10-15 01:08:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:35,649 INFO L93 Difference]: Finished difference Result 4111 states and 6451 transitions. [2019-10-15 01:08:35,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:08:35,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-15 01:08:35,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:35,678 INFO L225 Difference]: With dead ends: 4111 [2019-10-15 01:08:35,678 INFO L226 Difference]: Without dead ends: 2787 [2019-10-15 01:08:35,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:08:35,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2787 states. [2019-10-15 01:08:35,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2787 to 2784. [2019-10-15 01:08:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2784 states. [2019-10-15 01:08:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4337 transitions. [2019-10-15 01:08:35,829 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4337 transitions. Word has length 194 [2019-10-15 01:08:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:35,830 INFO L462 AbstractCegarLoop]: Abstraction has 2784 states and 4337 transitions. [2019-10-15 01:08:35,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:08:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4337 transitions. [2019-10-15 01:08:35,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-15 01:08:35,842 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:35,842 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:35,842 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:35,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:35,843 INFO L82 PathProgramCache]: Analyzing trace with hash -485595940, now seen corresponding path program 1 times [2019-10-15 01:08:35,843 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:35,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198717571] [2019-10-15 01:08:35,843 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:35,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:35,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-15 01:08:36,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198717571] [2019-10-15 01:08:36,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144010405] [2019-10-15 01:08:36,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:36,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 3110 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:36,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-15 01:08:36,855 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-15 01:08:37,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:37,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-15 01:08:37,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333952743] [2019-10-15 01:08:37,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:37,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:37,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:37,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:08:37,487 INFO L87 Difference]: Start difference. First operand 2784 states and 4337 transitions. Second operand 5 states. [2019-10-15 01:08:38,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:38,747 INFO L93 Difference]: Finished difference Result 5481 states and 8767 transitions. [2019-10-15 01:08:38,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:38,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-10-15 01:08:38,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:38,778 INFO L225 Difference]: With dead ends: 5481 [2019-10-15 01:08:38,778 INFO L226 Difference]: Without dead ends: 2816 [2019-10-15 01:08:38,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 374 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:08:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2019-10-15 01:08:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2816. [2019-10-15 01:08:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2816 states. [2019-10-15 01:08:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 4389 transitions. [2019-10-15 01:08:38,947 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 4389 transitions. Word has length 193 [2019-10-15 01:08:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:38,947 INFO L462 AbstractCegarLoop]: Abstraction has 2816 states and 4389 transitions. [2019-10-15 01:08:38,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 4389 transitions. [2019-10-15 01:08:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-15 01:08:38,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:38,959 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:39,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:39,176 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:39,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:39,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1227005091, now seen corresponding path program 1 times [2019-10-15 01:08:39,177 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:39,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211358458] [2019-10-15 01:08:39,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:39,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:39,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-15 01:08:39,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211358458] [2019-10-15 01:08:39,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5956441] [2019-10-15 01:08:39,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:40,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 3113 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:40,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-15 01:08:40,308 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-15 01:08:40,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:40,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-15 01:08:40,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837158508] [2019-10-15 01:08:40,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:40,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:40,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:40,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:08:40,864 INFO L87 Difference]: Start difference. First operand 2816 states and 4389 transitions. Second operand 5 states. [2019-10-15 01:08:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:42,164 INFO L93 Difference]: Finished difference Result 5545 states and 8859 transitions. [2019-10-15 01:08:42,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:42,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 196 [2019-10-15 01:08:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:42,199 INFO L225 Difference]: With dead ends: 5545 [2019-10-15 01:08:42,199 INFO L226 Difference]: Without dead ends: 2848 [2019-10-15 01:08:42,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 380 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:08:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2019-10-15 01:08:42,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2848. [2019-10-15 01:08:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2848 states. [2019-10-15 01:08:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 4441 transitions. [2019-10-15 01:08:42,360 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 4441 transitions. Word has length 196 [2019-10-15 01:08:42,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:42,360 INFO L462 AbstractCegarLoop]: Abstraction has 2848 states and 4441 transitions. [2019-10-15 01:08:42,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 4441 transitions. [2019-10-15 01:08:42,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-15 01:08:42,373 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:42,374 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:42,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:42,578 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:42,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:42,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1959931264, now seen corresponding path program 1 times [2019-10-15 01:08:42,579 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:42,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393953986] [2019-10-15 01:08:42,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:42,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:42,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-15 01:08:42,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393953986] [2019-10-15 01:08:42,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486956043] [2019-10-15 01:08:42,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:43,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 3116 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:43,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:43,509 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-15 01:08:43,510 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-15 01:08:44,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:44,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-15 01:08:44,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855814065] [2019-10-15 01:08:44,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:44,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:44,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:44,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:08:44,088 INFO L87 Difference]: Start difference. First operand 2848 states and 4441 transitions. Second operand 5 states. [2019-10-15 01:08:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:45,387 INFO L93 Difference]: Finished difference Result 5609 states and 8951 transitions. [2019-10-15 01:08:45,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:45,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 199 [2019-10-15 01:08:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:45,403 INFO L225 Difference]: With dead ends: 5609 [2019-10-15 01:08:45,404 INFO L226 Difference]: Without dead ends: 2880 [2019-10-15 01:08:45,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 386 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:08:45,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2019-10-15 01:08:45,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2880. [2019-10-15 01:08:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2019-10-15 01:08:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 4493 transitions. [2019-10-15 01:08:45,534 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 4493 transitions. Word has length 199 [2019-10-15 01:08:45,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:45,535 INFO L462 AbstractCegarLoop]: Abstraction has 2880 states and 4493 transitions. [2019-10-15 01:08:45,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 4493 transitions. [2019-10-15 01:08:45,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-15 01:08:45,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:45,546 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:45,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:45,763 INFO L410 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:45,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:45,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1815863567, now seen corresponding path program 1 times [2019-10-15 01:08:45,764 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:45,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578546735] [2019-10-15 01:08:45,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:45,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:45,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-15 01:08:45,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578546735] [2019-10-15 01:08:45,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740530187] [2019-10-15 01:08:45,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:46,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 3119 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:46,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-15 01:08:46,574 INFO L321 TraceCheckSpWp]: Computing backward predicates...