java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product24.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:09:57,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:09:57,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:09:57,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:09:57,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:09:57,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:09:57,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:09:57,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:09:57,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:09:57,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:09:57,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:09:57,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:09:57,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:09:57,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:09:57,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:09:57,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:09:57,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:09:57,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:09:57,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:09:57,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:09:57,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:09:57,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:09:57,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:09:57,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:09:57,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:09:57,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:09:57,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:09:57,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:09:57,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:09:57,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:09:57,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:09:57,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:09:57,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:09:57,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:09:57,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:09:57,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:09:57,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:09:57,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:09:57,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:09:57,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:09:57,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:09:57,572 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:09:57,596 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:09:57,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:09:57,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:09:57,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:09:57,599 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:09:57,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:09:57,600 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:09:57,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:09:57,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:09:57,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:09:57,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:09:57,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:09:57,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:09:57,601 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:09:57,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:09:57,603 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:09:57,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:09:57,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:09:57,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:09:57,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:09:57,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:09:57,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:09:57,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:09:57,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:09:57,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:09:57,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:09:57,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:09:57,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:09:57,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:09:57,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:09:57,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:09:57,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:09:57,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:09:57,877 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:09:57,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product24.cil.c [2019-10-15 01:09:57,953 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d0f5266/845c193e8a8f4d219cd67c4f8d50fa0e/FLAG1f84e80bc [2019-10-15 01:09:58,576 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:09:58,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product24.cil.c [2019-10-15 01:09:58,622 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d0f5266/845c193e8a8f4d219cd67c4f8d50fa0e/FLAG1f84e80bc [2019-10-15 01:09:58,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d0f5266/845c193e8a8f4d219cd67c4f8d50fa0e [2019-10-15 01:09:58,826 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:09:58,827 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:09:58,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:58,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:09:58,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:09:58,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:58" (1/1) ... [2019-10-15 01:09:58,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fac7d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:58, skipping insertion in model container [2019-10-15 01:09:58,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:58" (1/1) ... [2019-10-15 01:09:58,841 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:09:58,932 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:09:59,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:59,662 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:09:59,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:59,912 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:09:59,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:59 WrapperNode [2019-10-15 01:09:59,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:59,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:09:59,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:09:59,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:09:59,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:59" (1/1) ... [2019-10-15 01:09:59,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:59" (1/1) ... [2019-10-15 01:09:59,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:59" (1/1) ... [2019-10-15 01:09:59,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:59" (1/1) ... [2019-10-15 01:10:00,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:59" (1/1) ... [2019-10-15 01:10:00,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:59" (1/1) ... [2019-10-15 01:10:00,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:59" (1/1) ... [2019-10-15 01:10:00,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:10:00,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:10:00,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:10:00,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:10:00,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:59" (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:10:00,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:10:00,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:10:00,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:00,202 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:10:00,202 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:10:00,203 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:10:00,203 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:10:00,204 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:10:00,204 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:10:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:10:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:10:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:10:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:10:00,206 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:10:00,206 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:10:00,207 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:10:00,209 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:10:00,209 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:10:00,209 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:10:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:10:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:10:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:10:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:10:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:10:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:10:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:10:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:10:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-15 01:10:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-15 01:10:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:10:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:10:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:10:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-15 01:10:00,213 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-15 01:10:00,213 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:00,213 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:10:00,213 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:10:00,214 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-15 01:10:00,214 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:10:00,214 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-15 01:10:00,214 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:10:00,214 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:10:00,215 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-15 01:10:00,215 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-15 01:10:00,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:10:00,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:10:00,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:10:00,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:10:00,216 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:10:00,216 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:10:00,216 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:10:00,216 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:10:00,216 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:10:00,216 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:10:00,217 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:10:00,217 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:10:00,217 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:10:00,217 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:10:00,217 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:10:00,217 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:10:00,218 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:10:00,218 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:10:00,218 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:10:00,219 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:10:00,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:10:00,219 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:10:00,219 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:10:00,219 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:10:00,220 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:10:00,220 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:10:00,220 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:10:00,220 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:10:00,220 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:10:00,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:10:00,221 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:10:00,222 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:10:00,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:00,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:00,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:00,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:10:00,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:10:00,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:10:00,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:10:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:10:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:10:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:10:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:10:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:10:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:10:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:10:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:10:00,228 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:10:00,228 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:10:00,228 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:10:00,228 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:10:00,228 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:10:00,229 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:10:00,229 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:10:00,229 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:10:00,229 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:10:00,229 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:10:00,229 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:10:00,230 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:10:00,230 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:10:00,230 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:10:00,230 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:10:00,230 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:10:00,231 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-15 01:10:00,231 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-15 01:10:00,231 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:10:00,231 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:10:00,231 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:10:00,231 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:10:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:10:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:10:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:10:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:10:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-15 01:10:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-15 01:10:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:10:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:10:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-15 01:10:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-15 01:10:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:00,236 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:10:00,236 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:10:00,236 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-15 01:10:00,236 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:10:00,236 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-15 01:10:00,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:10:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:10:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:10:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:10:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:10:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:10:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:10:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:10:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:10:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:10:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:10:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:10:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:10:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:10:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:10:00,251 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:10:00,251 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:10:00,252 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:10:00,252 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:10:00,252 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:10:00,252 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:10:00,252 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:10:00,252 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:10:00,252 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:10:00,252 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:10:00,253 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:10:00,253 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:10:00,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:10:00,253 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:10:00,254 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:10:00,254 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:10:00,254 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:10:00,254 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:10:00,255 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:10:00,255 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:00,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:10:00,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:10:00,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:10:00,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:10:00,255 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:00,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:10:00,256 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:00,256 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:00,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:10:00,256 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:10:00,256 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:10:00,256 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:10:00,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:10:00,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:10:00,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:10:02,838 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:10:02,839 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:10:02,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:02 BoogieIcfgContainer [2019-10-15 01:10:02,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:10:02,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:10:02,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:10:02,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:10:02,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:09:58" (1/3) ... [2019-10-15 01:10:02,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7020dd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:02, skipping insertion in model container [2019-10-15 01:10:02,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:59" (2/3) ... [2019-10-15 01:10:02,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7020dd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:02, skipping insertion in model container [2019-10-15 01:10:02,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:02" (3/3) ... [2019-10-15 01:10:02,858 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product24.cil.c [2019-10-15 01:10:02,871 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:10:02,885 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:10:02,901 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:10:02,959 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:10:02,959 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:10:02,960 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:10:02,960 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:10:02,960 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:10:02,960 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:10:02,960 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:10:02,961 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:10:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states. [2019-10-15 01:10:03,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-15 01:10:03,053 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:03,055 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:03,060 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:03,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:03,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1311658421, now seen corresponding path program 1 times [2019-10-15 01:10:03,081 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:03,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788196513] [2019-10-15 01:10:03,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:03,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:03,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:03,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788196513] [2019-10-15 01:10:03,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:03,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:03,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208133815] [2019-10-15 01:10:03,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:03,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:03,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:03,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:03,853 INFO L87 Difference]: Start difference. First operand 817 states. Second operand 4 states. [2019-10-15 01:10:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:04,068 INFO L93 Difference]: Finished difference Result 1283 states and 2055 transitions. [2019-10-15 01:10:04,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:04,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-15 01:10:04,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:04,116 INFO L225 Difference]: With dead ends: 1283 [2019-10-15 01:10:04,116 INFO L226 Difference]: Without dead ends: 650 [2019-10-15 01:10:04,125 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:10:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-15 01:10:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-15 01:10:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-15 01:10:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1029 transitions. [2019-10-15 01:10:04,256 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1029 transitions. Word has length 85 [2019-10-15 01:10:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:04,257 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 1029 transitions. [2019-10-15 01:10:04,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:04,257 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1029 transitions. [2019-10-15 01:10:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-15 01:10:04,262 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:04,262 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:04,262 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:04,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:04,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1025593736, now seen corresponding path program 1 times [2019-10-15 01:10:04,263 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:04,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88984451] [2019-10-15 01:10:04,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:04,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:04,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:04,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88984451] [2019-10-15 01:10:04,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:04,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:04,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745053727] [2019-10-15 01:10:04,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:04,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:04,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:04,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:04,487 INFO L87 Difference]: Start difference. First operand 650 states and 1029 transitions. Second operand 4 states. [2019-10-15 01:10:04,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:04,590 INFO L93 Difference]: Finished difference Result 1263 states and 2016 transitions. [2019-10-15 01:10:04,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:04,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-15 01:10:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:04,599 INFO L225 Difference]: With dead ends: 1263 [2019-10-15 01:10:04,599 INFO L226 Difference]: Without dead ends: 650 [2019-10-15 01:10:04,609 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:10:04,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-15 01:10:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-15 01:10:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-15 01:10:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1028 transitions. [2019-10-15 01:10:04,655 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1028 transitions. Word has length 88 [2019-10-15 01:10:04,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:04,655 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 1028 transitions. [2019-10-15 01:10:04,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:04,655 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1028 transitions. [2019-10-15 01:10:04,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-15 01:10:04,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:04,698 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:04,699 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:04,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:04,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1118647296, now seen corresponding path program 1 times [2019-10-15 01:10:04,699 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:04,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217519952] [2019-10-15 01:10:04,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:04,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:04,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:04,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217519952] [2019-10-15 01:10:04,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:04,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:04,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905906969] [2019-10-15 01:10:04,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:04,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:04,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:04,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:04,924 INFO L87 Difference]: Start difference. First operand 650 states and 1028 transitions. Second operand 4 states. [2019-10-15 01:10:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:04,999 INFO L93 Difference]: Finished difference Result 1263 states and 2015 transitions. [2019-10-15 01:10:05,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:05,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-15 01:10:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:05,006 INFO L225 Difference]: With dead ends: 1263 [2019-10-15 01:10:05,006 INFO L226 Difference]: Without dead ends: 650 [2019-10-15 01:10:05,010 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:10:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-15 01:10:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-15 01:10:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-15 01:10:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1027 transitions. [2019-10-15 01:10:05,039 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1027 transitions. Word has length 89 [2019-10-15 01:10:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:05,040 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 1027 transitions. [2019-10-15 01:10:05,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1027 transitions. [2019-10-15 01:10:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-15 01:10:05,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:05,042 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:05,043 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:05,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:05,043 INFO L82 PathProgramCache]: Analyzing trace with hash -210310140, now seen corresponding path program 1 times [2019-10-15 01:10:05,043 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:05,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952047808] [2019-10-15 01:10:05,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:05,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952047808] [2019-10-15 01:10:05,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:05,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:05,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95829780] [2019-10-15 01:10:05,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:05,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:05,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:05,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:05,167 INFO L87 Difference]: Start difference. First operand 650 states and 1027 transitions. Second operand 4 states. [2019-10-15 01:10:05,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:05,223 INFO L93 Difference]: Finished difference Result 1263 states and 2014 transitions. [2019-10-15 01:10:05,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:05,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-15 01:10:05,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:05,229 INFO L225 Difference]: With dead ends: 1263 [2019-10-15 01:10:05,229 INFO L226 Difference]: Without dead ends: 650 [2019-10-15 01:10:05,233 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:10:05,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-15 01:10:05,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-15 01:10:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-15 01:10:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1026 transitions. [2019-10-15 01:10:05,258 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1026 transitions. Word has length 90 [2019-10-15 01:10:05,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:05,259 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 1026 transitions. [2019-10-15 01:10:05,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:05,259 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1026 transitions. [2019-10-15 01:10:05,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 01:10:05,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:05,261 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:05,261 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:05,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:05,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1623031804, now seen corresponding path program 1 times [2019-10-15 01:10:05,262 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:05,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701876727] [2019-10-15 01:10:05,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:05,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701876727] [2019-10-15 01:10:05,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:05,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:05,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069972237] [2019-10-15 01:10:05,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:05,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:05,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:05,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:05,381 INFO L87 Difference]: Start difference. First operand 650 states and 1026 transitions. Second operand 4 states. [2019-10-15 01:10:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:05,443 INFO L93 Difference]: Finished difference Result 1263 states and 2013 transitions. [2019-10-15 01:10:05,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:05,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-15 01:10:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:05,458 INFO L225 Difference]: With dead ends: 1263 [2019-10-15 01:10:05,458 INFO L226 Difference]: Without dead ends: 650 [2019-10-15 01:10:05,462 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:10:05,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-15 01:10:05,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-15 01:10:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-15 01:10:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1025 transitions. [2019-10-15 01:10:05,543 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1025 transitions. Word has length 91 [2019-10-15 01:10:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:05,544 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 1025 transitions. [2019-10-15 01:10:05,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1025 transitions. [2019-10-15 01:10:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:10:05,545 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:05,546 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:05,546 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:05,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:05,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1591560576, now seen corresponding path program 1 times [2019-10-15 01:10:05,547 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:05,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448167279] [2019-10-15 01:10:05,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:05,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448167279] [2019-10-15 01:10:05,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:05,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:10:05,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513256948] [2019-10-15 01:10:05,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:10:05,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:05,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:10:05,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:10:05,745 INFO L87 Difference]: Start difference. First operand 650 states and 1025 transitions. Second operand 10 states. [2019-10-15 01:10:05,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:05,917 INFO L93 Difference]: Finished difference Result 1221 states and 1933 transitions. [2019-10-15 01:10:05,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:10:05,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-15 01:10:05,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:05,923 INFO L225 Difference]: With dead ends: 1221 [2019-10-15 01:10:05,923 INFO L226 Difference]: Without dead ends: 659 [2019-10-15 01:10:05,927 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:10:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-15 01:10:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2019-10-15 01:10:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-15 01:10:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1034 transitions. [2019-10-15 01:10:05,955 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1034 transitions. Word has length 92 [2019-10-15 01:10:05,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:05,956 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1034 transitions. [2019-10-15 01:10:05,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:10:05,956 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1034 transitions. [2019-10-15 01:10:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:10:05,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:05,959 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:05,959 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:05,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:05,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1571223201, now seen corresponding path program 1 times [2019-10-15 01:10:05,960 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:05,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004826433] [2019-10-15 01:10:05,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:06,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004826433] [2019-10-15 01:10:06,053 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:06,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:06,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100356398] [2019-10-15 01:10:06,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:06,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:06,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:06,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:06,055 INFO L87 Difference]: Start difference. First operand 657 states and 1034 transitions. Second operand 4 states. [2019-10-15 01:10:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:06,111 INFO L93 Difference]: Finished difference Result 1269 states and 2019 transitions. [2019-10-15 01:10:06,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:06,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-15 01:10:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:06,117 INFO L225 Difference]: With dead ends: 1269 [2019-10-15 01:10:06,117 INFO L226 Difference]: Without dead ends: 644 [2019-10-15 01:10:06,120 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:10:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-15 01:10:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-10-15 01:10:06,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-15 01:10:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1011 transitions. [2019-10-15 01:10:06,144 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1011 transitions. Word has length 92 [2019-10-15 01:10:06,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:06,144 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 1011 transitions. [2019-10-15 01:10:06,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1011 transitions. [2019-10-15 01:10:06,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 01:10:06,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:06,146 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:06,147 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:06,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:06,147 INFO L82 PathProgramCache]: Analyzing trace with hash -120264268, now seen corresponding path program 1 times [2019-10-15 01:10:06,148 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:06,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353236598] [2019-10-15 01:10:06,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:06,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:06,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:06,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353236598] [2019-10-15 01:10:06,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:06,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:06,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415276415] [2019-10-15 01:10:06,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:06,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:06,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:06,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:06,346 INFO L87 Difference]: Start difference. First operand 644 states and 1011 transitions. Second operand 6 states. [2019-10-15 01:10:06,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:06,603 INFO L93 Difference]: Finished difference Result 1209 states and 1911 transitions. [2019-10-15 01:10:06,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:06,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-15 01:10:06,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:06,610 INFO L225 Difference]: With dead ends: 1209 [2019-10-15 01:10:06,611 INFO L226 Difference]: Without dead ends: 644 [2019-10-15 01:10:06,615 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:10:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-15 01:10:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-10-15 01:10:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-15 01:10:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1007 transitions. [2019-10-15 01:10:06,646 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1007 transitions. Word has length 93 [2019-10-15 01:10:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:06,646 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 1007 transitions. [2019-10-15 01:10:06,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1007 transitions. [2019-10-15 01:10:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:10:06,651 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:06,651 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:06,652 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:06,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:06,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1667290269, now seen corresponding path program 1 times [2019-10-15 01:10:06,652 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:06,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395281048] [2019-10-15 01:10:06,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:06,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:06,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:06,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395281048] [2019-10-15 01:10:06,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:06,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:06,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504934458] [2019-10-15 01:10:06,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:06,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:06,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:06,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:06,783 INFO L87 Difference]: Start difference. First operand 644 states and 1007 transitions. Second operand 6 states. [2019-10-15 01:10:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:06,978 INFO L93 Difference]: Finished difference Result 1209 states and 1907 transitions. [2019-10-15 01:10:06,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:06,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-15 01:10:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:06,984 INFO L225 Difference]: With dead ends: 1209 [2019-10-15 01:10:06,984 INFO L226 Difference]: Without dead ends: 644 [2019-10-15 01:10:06,988 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:10:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-15 01:10:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-10-15 01:10:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-15 01:10:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1003 transitions. [2019-10-15 01:10:07,010 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1003 transitions. Word has length 94 [2019-10-15 01:10:07,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:07,011 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 1003 transitions. [2019-10-15 01:10:07,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:07,011 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1003 transitions. [2019-10-15 01:10:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:10:07,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:07,013 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:07,013 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:07,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:07,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1875714457, now seen corresponding path program 1 times [2019-10-15 01:10:07,014 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:07,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748763153] [2019-10-15 01:10:07,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:07,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748763153] [2019-10-15 01:10:07,136 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:07,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:07,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195196886] [2019-10-15 01:10:07,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:07,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:07,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:07,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:07,138 INFO L87 Difference]: Start difference. First operand 644 states and 1003 transitions. Second operand 6 states. [2019-10-15 01:10:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:07,385 INFO L93 Difference]: Finished difference Result 1209 states and 1903 transitions. [2019-10-15 01:10:07,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:07,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-15 01:10:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:07,391 INFO L225 Difference]: With dead ends: 1209 [2019-10-15 01:10:07,392 INFO L226 Difference]: Without dead ends: 644 [2019-10-15 01:10:07,399 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:10:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-15 01:10:07,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-10-15 01:10:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-15 01:10:07,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 999 transitions. [2019-10-15 01:10:07,419 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 999 transitions. Word has length 95 [2019-10-15 01:10:07,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:07,419 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 999 transitions. [2019-10-15 01:10:07,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 999 transitions. [2019-10-15 01:10:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:10:07,421 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:07,421 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:07,421 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:07,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1371398631, now seen corresponding path program 1 times [2019-10-15 01:10:07,422 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:07,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022703545] [2019-10-15 01:10:07,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:07,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022703545] [2019-10-15 01:10:07,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:07,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:07,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196384787] [2019-10-15 01:10:07,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:07,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:07,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:07,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:07,563 INFO L87 Difference]: Start difference. First operand 644 states and 999 transitions. Second operand 7 states. [2019-10-15 01:10:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:07,660 INFO L93 Difference]: Finished difference Result 1209 states and 1899 transitions. [2019-10-15 01:10:07,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:07,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-15 01:10:07,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:07,666 INFO L225 Difference]: With dead ends: 1209 [2019-10-15 01:10:07,667 INFO L226 Difference]: Without dead ends: 623 [2019-10-15 01:10:07,670 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:10:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-15 01:10:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-15 01:10:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-15 01:10:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 965 transitions. [2019-10-15 01:10:07,696 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 965 transitions. Word has length 95 [2019-10-15 01:10:07,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:07,696 INFO L462 AbstractCegarLoop]: Abstraction has 623 states and 965 transitions. [2019-10-15 01:10:07,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 965 transitions. [2019-10-15 01:10:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:10:07,698 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:07,698 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:07,698 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:07,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:07,699 INFO L82 PathProgramCache]: Analyzing trace with hash 914472, now seen corresponding path program 1 times [2019-10-15 01:10:07,699 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:07,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223393073] [2019-10-15 01:10:07,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:07,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223393073] [2019-10-15 01:10:07,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:07,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:07,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493097464] [2019-10-15 01:10:07,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:07,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:07,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:07,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:07,845 INFO L87 Difference]: Start difference. First operand 623 states and 965 transitions. Second operand 6 states. [2019-10-15 01:10:07,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:07,960 INFO L93 Difference]: Finished difference Result 1188 states and 1865 transitions. [2019-10-15 01:10:07,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:07,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-15 01:10:07,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:07,966 INFO L225 Difference]: With dead ends: 1188 [2019-10-15 01:10:07,966 INFO L226 Difference]: Without dead ends: 623 [2019-10-15 01:10:07,969 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:10:07,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-15 01:10:07,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-15 01:10:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-15 01:10:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 964 transitions. [2019-10-15 01:10:07,997 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 964 transitions. Word has length 96 [2019-10-15 01:10:07,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:07,998 INFO L462 AbstractCegarLoop]: Abstraction has 623 states and 964 transitions. [2019-10-15 01:10:07,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 964 transitions. [2019-10-15 01:10:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:10:08,001 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:08,001 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:08,001 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:08,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:08,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1972860286, now seen corresponding path program 1 times [2019-10-15 01:10:08,002 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:08,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399026413] [2019-10-15 01:10:08,002 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,002 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:08,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399026413] [2019-10-15 01:10:08,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:08,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:08,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494043730] [2019-10-15 01:10:08,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:08,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:08,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:08,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:08,125 INFO L87 Difference]: Start difference. First operand 623 states and 964 transitions. Second operand 6 states. [2019-10-15 01:10:08,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:08,220 INFO L93 Difference]: Finished difference Result 1188 states and 1864 transitions. [2019-10-15 01:10:08,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:08,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-15 01:10:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:08,250 INFO L225 Difference]: With dead ends: 1188 [2019-10-15 01:10:08,251 INFO L226 Difference]: Without dead ends: 623 [2019-10-15 01:10:08,254 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:10:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-15 01:10:08,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-15 01:10:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-15 01:10:08,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 963 transitions. [2019-10-15 01:10:08,281 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 963 transitions. Word has length 97 [2019-10-15 01:10:08,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:08,281 INFO L462 AbstractCegarLoop]: Abstraction has 623 states and 963 transitions. [2019-10-15 01:10:08,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 963 transitions. [2019-10-15 01:10:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:10:08,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:08,283 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:08,284 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:08,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:08,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1360125715, now seen corresponding path program 1 times [2019-10-15 01:10:08,284 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:08,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015939109] [2019-10-15 01:10:08,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:08,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015939109] [2019-10-15 01:10:08,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:08,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:10:08,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549598053] [2019-10-15 01:10:08,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:10:08,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:08,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:10:08,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:08,463 INFO L87 Difference]: Start difference. First operand 623 states and 963 transitions. Second operand 12 states. [2019-10-15 01:10:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:08,645 INFO L93 Difference]: Finished difference Result 1189 states and 1863 transitions. [2019-10-15 01:10:08,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:10:08,646 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-15 01:10:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:08,651 INFO L225 Difference]: With dead ends: 1189 [2019-10-15 01:10:08,651 INFO L226 Difference]: Without dead ends: 623 [2019-10-15 01:10:08,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:10:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-15 01:10:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-15 01:10:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-15 01:10:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 962 transitions. [2019-10-15 01:10:08,674 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 962 transitions. Word has length 98 [2019-10-15 01:10:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:08,674 INFO L462 AbstractCegarLoop]: Abstraction has 623 states and 962 transitions. [2019-10-15 01:10:08,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:10:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 962 transitions. [2019-10-15 01:10:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 01:10:08,676 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:08,676 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:08,677 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:08,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:08,677 INFO L82 PathProgramCache]: Analyzing trace with hash 372702175, now seen corresponding path program 1 times [2019-10-15 01:10:08,677 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:08,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302451187] [2019-10-15 01:10:08,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:08,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302451187] [2019-10-15 01:10:08,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:08,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:08,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712048859] [2019-10-15 01:10:08,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:08,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:08,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:08,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:08,847 INFO L87 Difference]: Start difference. First operand 623 states and 962 transitions. Second operand 6 states. [2019-10-15 01:10:12,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:12,912 INFO L93 Difference]: Finished difference Result 1847 states and 2936 transitions. [2019-10-15 01:10:12,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:12,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-15 01:10:12,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:12,923 INFO L225 Difference]: With dead ends: 1847 [2019-10-15 01:10:12,924 INFO L226 Difference]: Without dead ends: 1290 [2019-10-15 01:10:12,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:12,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-10-15 01:10:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1165. [2019-10-15 01:10:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2019-10-15 01:10:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1844 transitions. [2019-10-15 01:10:12,995 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1844 transitions. Word has length 99 [2019-10-15 01:10:12,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:12,996 INFO L462 AbstractCegarLoop]: Abstraction has 1165 states and 1844 transitions. [2019-10-15 01:10:12,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:12,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1844 transitions. [2019-10-15 01:10:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:10:13,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:13,003 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:13,004 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:13,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:13,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1417866634, now seen corresponding path program 1 times [2019-10-15 01:10:13,004 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:13,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442586439] [2019-10-15 01:10:13,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:13,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442586439] [2019-10-15 01:10:13,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253752197] [2019-10-15 01:10:13,193 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:10:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:13,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 3053 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:10:13,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:13,933 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:14,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:10:14,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-15 01:10:14,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311910006] [2019-10-15 01:10:14,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:14,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:14,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:14,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:10:14,886 INFO L87 Difference]: Start difference. First operand 1165 states and 1844 transitions. Second operand 5 states. [2019-10-15 01:10:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:15,925 INFO L93 Difference]: Finished difference Result 2280 states and 3703 transitions. [2019-10-15 01:10:15,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:15,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-15 01:10:15,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:15,938 INFO L225 Difference]: With dead ends: 2280 [2019-10-15 01:10:15,938 INFO L226 Difference]: Without dead ends: 1181 [2019-10-15 01:10:15,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 302 SyntacticMatches, 8 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:10:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-10-15 01:10:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1181. [2019-10-15 01:10:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-10-15 01:10:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1870 transitions. [2019-10-15 01:10:16,008 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1870 transitions. Word has length 158 [2019-10-15 01:10:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:16,008 INFO L462 AbstractCegarLoop]: Abstraction has 1181 states and 1870 transitions. [2019-10-15 01:10:16,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1870 transitions. [2019-10-15 01:10:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-15 01:10:16,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:16,014 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:16,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:16,231 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:16,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:16,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1476873735, now seen corresponding path program 1 times [2019-10-15 01:10:16,232 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:16,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326950904] [2019-10-15 01:10:16,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:16,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:16,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:10:16,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326950904] [2019-10-15 01:10:16,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:16,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:10:16,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114503578] [2019-10-15 01:10:16,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:10:16,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:16,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:10:16,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:16,438 INFO L87 Difference]: Start difference. First operand 1181 states and 1870 transitions. Second operand 12 states. [2019-10-15 01:10:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:27,804 INFO L93 Difference]: Finished difference Result 3914 states and 6204 transitions. [2019-10-15 01:10:27,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-15 01:10:27,805 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 159 [2019-10-15 01:10:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:27,826 INFO L225 Difference]: With dead ends: 3914 [2019-10-15 01:10:27,826 INFO L226 Difference]: Without dead ends: 2799 [2019-10-15 01:10:27,833 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-15 01:10:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-10-15 01:10:28,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2741. [2019-10-15 01:10:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2741 states. [2019-10-15 01:10:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4299 transitions. [2019-10-15 01:10:28,026 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4299 transitions. Word has length 159 [2019-10-15 01:10:28,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:28,027 INFO L462 AbstractCegarLoop]: Abstraction has 2741 states and 4299 transitions. [2019-10-15 01:10:28,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:10:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4299 transitions. [2019-10-15 01:10:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-15 01:10:28,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:28,033 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:28,033 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:28,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:28,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1813348040, now seen corresponding path program 1 times [2019-10-15 01:10:28,034 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:28,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740217533] [2019-10-15 01:10:28,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:28,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:28,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:28,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740217533] [2019-10-15 01:10:28,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68326550] [2019-10-15 01:10:28,174 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:10:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:28,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 3055 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:10:28,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:28,926 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:29,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:10:29,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-15 01:10:29,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269484598] [2019-10-15 01:10:29,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:29,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:29,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:29,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:10:29,759 INFO L87 Difference]: Start difference. First operand 2741 states and 4299 transitions. Second operand 5 states. [2019-10-15 01:10:30,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:30,921 INFO L93 Difference]: Finished difference Result 5480 states and 8805 transitions. [2019-10-15 01:10:30,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:30,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-15 01:10:30,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:30,939 INFO L225 Difference]: With dead ends: 5480 [2019-10-15 01:10:30,939 INFO L226 Difference]: Without dead ends: 2805 [2019-10-15 01:10:30,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 306 SyntacticMatches, 8 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:10:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2019-10-15 01:10:31,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2805. [2019-10-15 01:10:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2805 states. [2019-10-15 01:10:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 4401 transitions. [2019-10-15 01:10:31,084 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 4401 transitions. Word has length 160 [2019-10-15 01:10:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:31,086 INFO L462 AbstractCegarLoop]: Abstraction has 2805 states and 4401 transitions. [2019-10-15 01:10:31,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:31,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 4401 transitions. [2019-10-15 01:10:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-15 01:10:31,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:31,092 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:31,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:31,305 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:31,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:31,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1353207926, now seen corresponding path program 1 times [2019-10-15 01:10:31,305 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:31,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622952528] [2019-10-15 01:10:31,305 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:31,305 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:31,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:31,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622952528] [2019-10-15 01:10:31,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071776424] [2019-10-15 01:10:31,445 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:10:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:32,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 3057 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:10:32,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:32,215 INFO L321 TraceCheckSpWp]: Computing backward predicates...