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_product19.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:09:28,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:09:28,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:09:28,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:09:28,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:09:28,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:09:28,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:09:28,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:09:28,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:09:28,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:09:28,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:09:28,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:09:28,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:09:28,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:09:28,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:09:28,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:09:28,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:09:28,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:09:28,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:09:28,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:09:28,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:09:28,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:09:28,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:09:28,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:09:28,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:09:28,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:09:28,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:09:28,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:09:28,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:09:28,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:09:28,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:09:28,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:09:28,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:09:28,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:09:28,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:09:28,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:09:28,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:09:28,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:09:28,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:09:28,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:09:28,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:09:28,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:09:28,584 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:09:28,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:09:28,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:09:28,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:09:28,588 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:09:28,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:09:28,589 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:09:28,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:09:28,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:09:28,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:09:28,592 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:09:28,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:09:28,592 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:09:28,593 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:09:28,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:09:28,593 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:09:28,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:09:28,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:09:28,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:09:28,596 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:09:28,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:09:28,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:09:28,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:09:28,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:09:28,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:09:28,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:09:28,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:09:28,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:09:28,600 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:09:28,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:09:28,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:09:28,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:09:28,898 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:09:28,899 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:09:28,899 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product19.cil.c [2019-10-15 01:09:28,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176e7f3e6/1fce77c2d8184cc898025b8529661a80/FLAGc7040215d [2019-10-15 01:09:29,604 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:09:29,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product19.cil.c [2019-10-15 01:09:29,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176e7f3e6/1fce77c2d8184cc898025b8529661a80/FLAGc7040215d [2019-10-15 01:09:29,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176e7f3e6/1fce77c2d8184cc898025b8529661a80 [2019-10-15 01:09:29,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:09:29,768 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:09:29,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:29,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:09:29,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:09:29,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:29" (1/1) ... [2019-10-15 01:09:29,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364b9967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:29, skipping insertion in model container [2019-10-15 01:09:29,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:29" (1/1) ... [2019-10-15 01:09:29,781 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:09:29,861 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:09:30,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:30,621 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:09:30,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:30,823 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:09:30,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30 WrapperNode [2019-10-15 01:09:30,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:30,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:09:30,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:09:30,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:09:30,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... [2019-10-15 01:09:30,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... [2019-10-15 01:09:30,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... [2019-10-15 01:09:30,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... [2019-10-15 01:09:30,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... [2019-10-15 01:09:31,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... [2019-10-15 01:09:31,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... [2019-10-15 01:09:31,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:09:31,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:09:31,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:09:31,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:09:31,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:09:31,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:09:31,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:09:31,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:09:31,140 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:09:31,140 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:09:31,141 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:09:31,142 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:09:31,142 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:09:31,142 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:09:31,143 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:09:31,143 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:09:31,143 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:09:31,144 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:09:31,145 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:09:31,145 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:09:31,145 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:09:31,148 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:09:31,148 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:09:31,149 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:09:31,149 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-15 01:09:31,149 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:09:31,150 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:09:31,150 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:09:31,151 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-15 01:09:31,151 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:09:31,151 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:09:31,151 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:09:31,152 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:09:31,152 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:09:31,152 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:09:31,152 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-15 01:09:31,152 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-15 01:09:31,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:09:31,153 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:09:31,153 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:09:31,153 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:09:31,154 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:09:31,154 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:09:31,155 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:09:31,155 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:09:31,155 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:09:31,155 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:09:31,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:09:31,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:09:31,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:09:31,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:09:31,156 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:09:31,156 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:09:31,157 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:09:31,157 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:09:31,157 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:09:31,157 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:09:31,157 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:09:31,159 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:09:31,159 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:09:31,159 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:09:31,159 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:09:31,160 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:09:31,160 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:09:31,160 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:09:31,160 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:09:31,160 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:09:31,161 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:09:31,162 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:09:31,162 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:09:31,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:09:31,162 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:09:31,163 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:09:31,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:09:31,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:09:31,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:09:31,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:09:31,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:09:31,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:09:31,165 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:09:31,165 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:09:31,166 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:09:31,166 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:09:31,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:09:31,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:09:31,167 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:09:31,168 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:09:31,168 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:09:31,168 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:09:31,168 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:09:31,169 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:09:31,170 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:09:31,170 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:09:31,170 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:09:31,170 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:09:31,170 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:09:31,171 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:09:31,171 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:09:31,171 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:09:31,171 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:09:31,171 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:09:31,171 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:09:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:09:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:09:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:09:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:09:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-15 01:09:31,173 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-15 01:09:31,173 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:09:31,173 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:09:31,173 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:09:31,173 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:09:31,174 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:09:31,174 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:09:31,174 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:09:31,174 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:09:31,174 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-15 01:09:31,174 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:09:31,175 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:09:31,175 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-15 01:09:31,175 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:09:31,175 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:09:31,176 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:09:31,176 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:09:31,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:09:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:09:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:09:31,178 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:09:31,178 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:09:31,179 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:09:31,179 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:09:31,179 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:09:31,180 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:09:31,180 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:09:31,180 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:09:31,180 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:09:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:09:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:09:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:09:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:09:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:09:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:09:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:09:31,186 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:09:31,186 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:09:31,186 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:09:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:09:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:09:31,188 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:09:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:09:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:09:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:09:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:09:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:09:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:09:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:09:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:09:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:09:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:09:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:09:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:09:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:09:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:09:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:09:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:09:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:09:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:09:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:09:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:09:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:09:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:09:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:09:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:09:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:09:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:09:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:09:33,821 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:09:33,822 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:09:33,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:09:33 BoogieIcfgContainer [2019-10-15 01:09:33,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:09:33,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:09:33,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:09:33,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:09:33,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:09:29" (1/3) ... [2019-10-15 01:09:33,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1b379f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:09:33, skipping insertion in model container [2019-10-15 01:09:33,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:30" (2/3) ... [2019-10-15 01:09:33,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1b379f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:09:33, skipping insertion in model container [2019-10-15 01:09:33,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:09:33" (3/3) ... [2019-10-15 01:09:33,835 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product19.cil.c [2019-10-15 01:09:33,846 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:09:33,860 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:09:33,873 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:09:33,922 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:09:33,923 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:09:33,923 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:09:33,923 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:09:33,923 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:09:33,923 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:09:33,923 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:09:33,923 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:09:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states. [2019-10-15 01:09:34,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:09:34,004 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:34,006 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] [2019-10-15 01:09:34,011 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:34,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:34,018 INFO L82 PathProgramCache]: Analyzing trace with hash 707688551, now seen corresponding path program 1 times [2019-10-15 01:09:34,028 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:34,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941368254] [2019-10-15 01:09:34,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:34,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941368254] [2019-10-15 01:09:34,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:34,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:34,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784267230] [2019-10-15 01:09:34,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:34,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:34,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:34,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:34,793 INFO L87 Difference]: Start difference. First operand 770 states. Second operand 4 states. [2019-10-15 01:09:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:35,011 INFO L93 Difference]: Finished difference Result 1203 states and 1943 transitions. [2019-10-15 01:09:35,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:35,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-15 01:09:35,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:35,040 INFO L225 Difference]: With dead ends: 1203 [2019-10-15 01:09:35,041 INFO L226 Difference]: Without dead ends: 610 [2019-10-15 01:09:35,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-15 01:09:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-10-15 01:09:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-15 01:09:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 973 transitions. [2019-10-15 01:09:35,172 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 973 transitions. Word has length 133 [2019-10-15 01:09:35,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:35,173 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 973 transitions. [2019-10-15 01:09:35,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:35,175 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 973 transitions. [2019-10-15 01:09:35,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 01:09:35,186 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:35,187 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] [2019-10-15 01:09:35,187 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:35,188 INFO L82 PathProgramCache]: Analyzing trace with hash -373174512, now seen corresponding path program 1 times [2019-10-15 01:09:35,188 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:35,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713438290] [2019-10-15 01:09:35,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:35,381 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:35,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713438290] [2019-10-15 01:09:35,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:35,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:35,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904429946] [2019-10-15 01:09:35,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:35,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:35,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:35,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:35,392 INFO L87 Difference]: Start difference. First operand 610 states and 973 transitions. Second operand 4 states. [2019-10-15 01:09:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:35,528 INFO L93 Difference]: Finished difference Result 1183 states and 1904 transitions. [2019-10-15 01:09:35,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:35,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-15 01:09:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:35,535 INFO L225 Difference]: With dead ends: 1183 [2019-10-15 01:09:35,535 INFO L226 Difference]: Without dead ends: 610 [2019-10-15 01:09:35,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-15 01:09:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-10-15 01:09:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-15 01:09:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 972 transitions. [2019-10-15 01:09:35,590 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 972 transitions. Word has length 136 [2019-10-15 01:09:35,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:35,591 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 972 transitions. [2019-10-15 01:09:35,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:35,591 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 972 transitions. [2019-10-15 01:09:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 01:09:35,604 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:35,604 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] [2019-10-15 01:09:35,604 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:35,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1239600746, now seen corresponding path program 1 times [2019-10-15 01:09:35,605 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:35,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938681755] [2019-10-15 01:09:35,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:35,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938681755] [2019-10-15 01:09:35,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:35,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:35,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568582454] [2019-10-15 01:09:35,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:35,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:35,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:35,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:35,815 INFO L87 Difference]: Start difference. First operand 610 states and 972 transitions. Second operand 4 states. [2019-10-15 01:09:35,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:35,897 INFO L93 Difference]: Finished difference Result 1183 states and 1903 transitions. [2019-10-15 01:09:35,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:35,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-15 01:09:35,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:35,906 INFO L225 Difference]: With dead ends: 1183 [2019-10-15 01:09:35,907 INFO L226 Difference]: Without dead ends: 610 [2019-10-15 01:09:35,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-15 01:09:35,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-10-15 01:09:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-15 01:09:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 971 transitions. [2019-10-15 01:09:35,954 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 971 transitions. Word has length 137 [2019-10-15 01:09:35,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:35,955 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 971 transitions. [2019-10-15 01:09:35,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 971 transitions. [2019-10-15 01:09:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:09:35,960 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:35,960 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] [2019-10-15 01:09:35,961 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:35,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:35,961 INFO L82 PathProgramCache]: Analyzing trace with hash 449577804, now seen corresponding path program 1 times [2019-10-15 01:09:35,962 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:35,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982719205] [2019-10-15 01:09:35,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:36,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982719205] [2019-10-15 01:09:36,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:36,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:36,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006950727] [2019-10-15 01:09:36,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:36,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:36,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:36,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:36,162 INFO L87 Difference]: Start difference. First operand 610 states and 971 transitions. Second operand 4 states. [2019-10-15 01:09:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:36,239 INFO L93 Difference]: Finished difference Result 1183 states and 1902 transitions. [2019-10-15 01:09:36,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:36,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-15 01:09:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:36,248 INFO L225 Difference]: With dead ends: 1183 [2019-10-15 01:09:36,248 INFO L226 Difference]: Without dead ends: 610 [2019-10-15 01:09:36,251 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-15 01:09:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-10-15 01:09:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-15 01:09:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 970 transitions. [2019-10-15 01:09:36,288 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 970 transitions. Word has length 138 [2019-10-15 01:09:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:36,290 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 970 transitions. [2019-10-15 01:09:36,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 970 transitions. [2019-10-15 01:09:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:09:36,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:36,297 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] [2019-10-15 01:09:36,298 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:36,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:36,298 INFO L82 PathProgramCache]: Analyzing trace with hash -241873966, now seen corresponding path program 1 times [2019-10-15 01:09:36,298 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:36,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511533485] [2019-10-15 01:09:36,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:36,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511533485] [2019-10-15 01:09:36,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:36,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:36,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825884366] [2019-10-15 01:09:36,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:36,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:36,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:36,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:36,531 INFO L87 Difference]: Start difference. First operand 610 states and 970 transitions. Second operand 4 states. [2019-10-15 01:09:36,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:36,604 INFO L93 Difference]: Finished difference Result 1183 states and 1901 transitions. [2019-10-15 01:09:36,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:36,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-15 01:09:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:36,618 INFO L225 Difference]: With dead ends: 1183 [2019-10-15 01:09:36,619 INFO L226 Difference]: Without dead ends: 610 [2019-10-15 01:09:36,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-15 01:09:36,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-10-15 01:09:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-15 01:09:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 969 transitions. [2019-10-15 01:09:36,654 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 969 transitions. Word has length 139 [2019-10-15 01:09:36,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:36,655 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 969 transitions. [2019-10-15 01:09:36,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:36,655 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 969 transitions. [2019-10-15 01:09:36,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:09:36,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:36,660 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] [2019-10-15 01:09:36,660 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:36,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:36,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1718421624, now seen corresponding path program 1 times [2019-10-15 01:09:36,662 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:36,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456425771] [2019-10-15 01:09:36,663 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:36,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456425771] [2019-10-15 01:09:36,866 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:36,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:09:36,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118030618] [2019-10-15 01:09:36,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:09:36,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:36,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:09:36,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:09:36,868 INFO L87 Difference]: Start difference. First operand 610 states and 969 transitions. Second operand 10 states. [2019-10-15 01:09:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:37,031 INFO L93 Difference]: Finished difference Result 1141 states and 1821 transitions. [2019-10-15 01:09:37,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:09:37,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-15 01:09:37,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:37,037 INFO L225 Difference]: With dead ends: 1141 [2019-10-15 01:09:37,037 INFO L226 Difference]: Without dead ends: 619 [2019-10-15 01:09:37,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:09:37,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-15 01:09:37,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2019-10-15 01:09:37,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-15 01:09:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 978 transitions. [2019-10-15 01:09:37,076 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 978 transitions. Word has length 140 [2019-10-15 01:09:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:37,077 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 978 transitions. [2019-10-15 01:09:37,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:09:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 978 transitions. [2019-10-15 01:09:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:09:37,084 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:37,084 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] [2019-10-15 01:09:37,084 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:37,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:37,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1023774617, now seen corresponding path program 1 times [2019-10-15 01:09:37,085 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:37,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989284631] [2019-10-15 01:09:37,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:37,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989284631] [2019-10-15 01:09:37,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:37,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:37,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239838152] [2019-10-15 01:09:37,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:37,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:37,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:37,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:37,253 INFO L87 Difference]: Start difference. First operand 617 states and 978 transitions. Second operand 4 states. [2019-10-15 01:09:37,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:37,304 INFO L93 Difference]: Finished difference Result 1189 states and 1907 transitions. [2019-10-15 01:09:37,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:37,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-15 01:09:37,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:37,310 INFO L225 Difference]: With dead ends: 1189 [2019-10-15 01:09:37,310 INFO L226 Difference]: Without dead ends: 604 [2019-10-15 01:09:37,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:37,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-15 01:09:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-10-15 01:09:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-15 01:09:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 955 transitions. [2019-10-15 01:09:37,336 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 955 transitions. Word has length 140 [2019-10-15 01:09:37,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:37,337 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 955 transitions. [2019-10-15 01:09:37,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 955 transitions. [2019-10-15 01:09:37,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:09:37,341 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:37,342 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] [2019-10-15 01:09:37,342 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:37,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:37,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1404962230, now seen corresponding path program 1 times [2019-10-15 01:09:37,343 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:37,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613692706] [2019-10-15 01:09:37,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:37,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613692706] [2019-10-15 01:09:37,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:37,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:37,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323209701] [2019-10-15 01:09:37,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:37,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:37,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:37,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:37,498 INFO L87 Difference]: Start difference. First operand 604 states and 955 transitions. Second operand 6 states. [2019-10-15 01:09:37,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:37,732 INFO L93 Difference]: Finished difference Result 1129 states and 1799 transitions. [2019-10-15 01:09:37,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:37,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-15 01:09:37,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:37,738 INFO L225 Difference]: With dead ends: 1129 [2019-10-15 01:09:37,739 INFO L226 Difference]: Without dead ends: 604 [2019-10-15 01:09:37,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-15 01:09:37,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-10-15 01:09:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-15 01:09:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 951 transitions. [2019-10-15 01:09:37,767 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 951 transitions. Word has length 141 [2019-10-15 01:09:37,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:37,767 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 951 transitions. [2019-10-15 01:09:37,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:37,767 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 951 transitions. [2019-10-15 01:09:37,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:09:37,772 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:37,772 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] [2019-10-15 01:09:37,772 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:37,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:37,773 INFO L82 PathProgramCache]: Analyzing trace with hash -917771221, now seen corresponding path program 1 times [2019-10-15 01:09:37,773 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:37,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954847361] [2019-10-15 01:09:37,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:37,955 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:37,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954847361] [2019-10-15 01:09:37,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:37,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:37,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652573360] [2019-10-15 01:09:37,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:37,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:37,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:37,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:37,958 INFO L87 Difference]: Start difference. First operand 604 states and 951 transitions. Second operand 6 states. [2019-10-15 01:09:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:38,190 INFO L93 Difference]: Finished difference Result 1129 states and 1795 transitions. [2019-10-15 01:09:38,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:38,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-15 01:09:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:38,196 INFO L225 Difference]: With dead ends: 1129 [2019-10-15 01:09:38,196 INFO L226 Difference]: Without dead ends: 604 [2019-10-15 01:09:38,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-15 01:09:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-10-15 01:09:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-15 01:09:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 947 transitions. [2019-10-15 01:09:38,225 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 947 transitions. Word has length 142 [2019-10-15 01:09:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:38,225 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 947 transitions. [2019-10-15 01:09:38,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 947 transitions. [2019-10-15 01:09:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:09:38,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:38,230 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] [2019-10-15 01:09:38,230 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:38,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1007958639, now seen corresponding path program 1 times [2019-10-15 01:09:38,231 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:38,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898617286] [2019-10-15 01:09:38,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:38,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:38,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:38,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898617286] [2019-10-15 01:09:38,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:38,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:38,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537439551] [2019-10-15 01:09:38,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:38,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:38,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:38,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:38,365 INFO L87 Difference]: Start difference. First operand 604 states and 947 transitions. Second operand 6 states. [2019-10-15 01:09:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:38,535 INFO L93 Difference]: Finished difference Result 1129 states and 1791 transitions. [2019-10-15 01:09:38,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:38,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-15 01:09:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:38,541 INFO L225 Difference]: With dead ends: 1129 [2019-10-15 01:09:38,541 INFO L226 Difference]: Without dead ends: 604 [2019-10-15 01:09:38,544 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-15 01:09:38,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-10-15 01:09:38,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-15 01:09:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 943 transitions. [2019-10-15 01:09:38,565 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 943 transitions. Word has length 143 [2019-10-15 01:09:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:38,565 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 943 transitions. [2019-10-15 01:09:38,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 943 transitions. [2019-10-15 01:09:38,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:09:38,569 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:38,569 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] [2019-10-15 01:09:38,570 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:38,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:38,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2062431983, now seen corresponding path program 1 times [2019-10-15 01:09:38,570 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:38,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095196088] [2019-10-15 01:09:38,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:38,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:38,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:38,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095196088] [2019-10-15 01:09:38,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:38,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:09:38,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515626294] [2019-10-15 01:09:38,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:09:38,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:38,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:09:38,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:09:38,706 INFO L87 Difference]: Start difference. First operand 604 states and 943 transitions. Second operand 7 states. [2019-10-15 01:09:38,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:38,813 INFO L93 Difference]: Finished difference Result 1129 states and 1787 transitions. [2019-10-15 01:09:38,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:09:38,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-15 01:09:38,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:38,818 INFO L225 Difference]: With dead ends: 1129 [2019-10-15 01:09:38,819 INFO L226 Difference]: Without dead ends: 583 [2019-10-15 01:09:38,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-15 01:09:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-15 01:09:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-15 01:09:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 909 transitions. [2019-10-15 01:09:38,841 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 909 transitions. Word has length 143 [2019-10-15 01:09:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:38,842 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 909 transitions. [2019-10-15 01:09:38,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:09:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 909 transitions. [2019-10-15 01:09:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:09:38,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:38,846 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] [2019-10-15 01:09:38,846 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:38,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:38,847 INFO L82 PathProgramCache]: Analyzing trace with hash 283752624, now seen corresponding path program 1 times [2019-10-15 01:09:38,847 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:38,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425363363] [2019-10-15 01:09:38,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:38,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:38,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:38,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425363363] [2019-10-15 01:09:38,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:38,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:38,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561013318] [2019-10-15 01:09:38,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:38,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:38,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:38,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:38,983 INFO L87 Difference]: Start difference. First operand 583 states and 909 transitions. Second operand 6 states. [2019-10-15 01:09:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:39,108 INFO L93 Difference]: Finished difference Result 1108 states and 1753 transitions. [2019-10-15 01:09:39,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:39,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-15 01:09:39,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:39,114 INFO L225 Difference]: With dead ends: 1108 [2019-10-15 01:09:39,115 INFO L226 Difference]: Without dead ends: 583 [2019-10-15 01:09:39,117 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:39,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-15 01:09:39,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-15 01:09:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-15 01:09:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 908 transitions. [2019-10-15 01:09:39,145 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 908 transitions. Word has length 144 [2019-10-15 01:09:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:39,145 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 908 transitions. [2019-10-15 01:09:39,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 908 transitions. [2019-10-15 01:09:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:09:39,151 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:39,151 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] [2019-10-15 01:09:39,151 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:39,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:39,152 INFO L82 PathProgramCache]: Analyzing trace with hash -984086892, now seen corresponding path program 1 times [2019-10-15 01:09:39,152 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:39,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356458671] [2019-10-15 01:09:39,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:39,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:39,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:39,335 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:39,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356458671] [2019-10-15 01:09:39,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:39,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:39,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491387269] [2019-10-15 01:09:39,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:39,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:39,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:39,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:39,338 INFO L87 Difference]: Start difference. First operand 583 states and 908 transitions. Second operand 6 states. [2019-10-15 01:09:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:39,448 INFO L93 Difference]: Finished difference Result 1108 states and 1752 transitions. [2019-10-15 01:09:39,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:39,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-15 01:09:39,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:39,454 INFO L225 Difference]: With dead ends: 1108 [2019-10-15 01:09:39,454 INFO L226 Difference]: Without dead ends: 583 [2019-10-15 01:09:39,458 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-15 01:09:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-15 01:09:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-15 01:09:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 907 transitions. [2019-10-15 01:09:39,477 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 907 transitions. Word has length 145 [2019-10-15 01:09:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:39,477 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 907 transitions. [2019-10-15 01:09:39,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 907 transitions. [2019-10-15 01:09:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 01:09:39,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:39,485 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] [2019-10-15 01:09:39,485 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:39,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1924695755, now seen corresponding path program 1 times [2019-10-15 01:09:39,485 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:39,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219020576] [2019-10-15 01:09:39,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:39,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:39,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:39,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219020576] [2019-10-15 01:09:39,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:39,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:09:39,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134689421] [2019-10-15 01:09:39,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:09:39,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:39,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:09:39,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:09:39,698 INFO L87 Difference]: Start difference. First operand 583 states and 907 transitions. Second operand 12 states. [2019-10-15 01:09:39,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:39,896 INFO L93 Difference]: Finished difference Result 1109 states and 1751 transitions. [2019-10-15 01:09:39,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:09:39,896 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-15 01:09:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:39,901 INFO L225 Difference]: With dead ends: 1109 [2019-10-15 01:09:39,901 INFO L226 Difference]: Without dead ends: 583 [2019-10-15 01:09:39,904 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:09:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-15 01:09:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-15 01:09:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-15 01:09:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 906 transitions. [2019-10-15 01:09:39,923 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 906 transitions. Word has length 146 [2019-10-15 01:09:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:39,924 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 906 transitions. [2019-10-15 01:09:39,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:09:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 906 transitions. [2019-10-15 01:09:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:09:39,927 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:39,928 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] [2019-10-15 01:09:39,928 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:39,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:39,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1180012259, now seen corresponding path program 1 times [2019-10-15 01:09:39,929 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:39,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759714065] [2019-10-15 01:09:39,929 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:39,929 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:39,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-15 01:09:40,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759714065] [2019-10-15 01:09:40,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004343274] [2019-10-15 01:09:40,118 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:09:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:40,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 2771 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:09:40,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:09:40,821 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:09:40,822 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:09:41,675 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:09:41,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:09:41,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 18 [2019-10-15 01:09:41,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42439762] [2019-10-15 01:09:41,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:09:41,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:41,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:09:41,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:09:41,679 INFO L87 Difference]: Start difference. First operand 583 states and 906 transitions. Second operand 5 states. [2019-10-15 01:09:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:42,489 INFO L93 Difference]: Finished difference Result 1108 states and 1776 transitions. [2019-10-15 01:09:42,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:42,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-15 01:09:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:42,495 INFO L225 Difference]: With dead ends: 1108 [2019-10-15 01:09:42,495 INFO L226 Difference]: Without dead ends: 591 [2019-10-15 01:09:42,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 293 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:09:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-15 01:09:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-15 01:09:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-15 01:09:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 919 transitions. [2019-10-15 01:09:42,523 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 919 transitions. Word has length 147 [2019-10-15 01:09:42,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:42,523 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 919 transitions. [2019-10-15 01:09:42,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:09:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 919 transitions. [2019-10-15 01:09:42,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:09:42,527 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:42,527 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] [2019-10-15 01:09:42,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:42,745 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:42,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:42,746 INFO L82 PathProgramCache]: Analyzing trace with hash -407821049, now seen corresponding path program 1 times [2019-10-15 01:09:42,747 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:42,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833895431] [2019-10-15 01:09:42,747 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:42,747 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:42,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:43,031 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:09:43,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833895431] [2019-10-15 01:09:43,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:43,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:43,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136654816] [2019-10-15 01:09:43,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:43,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:43,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:43,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:43,034 INFO L87 Difference]: Start difference. First operand 591 states and 919 transitions. Second operand 6 states. [2019-10-15 01:09:43,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:43,734 INFO L93 Difference]: Finished difference Result 1123 states and 1800 transitions. [2019-10-15 01:09:43,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:43,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-10-15 01:09:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:43,740 INFO L225 Difference]: With dead ends: 1123 [2019-10-15 01:09:43,740 INFO L226 Difference]: Without dead ends: 596 [2019-10-15 01:09:43,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:09:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-15 01:09:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-15 01:09:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-15 01:09:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 923 transitions. [2019-10-15 01:09:43,770 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 923 transitions. Word has length 149 [2019-10-15 01:09:43,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:43,770 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 923 transitions. [2019-10-15 01:09:43,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 923 transitions. [2019-10-15 01:09:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:09:43,774 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:43,775 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] [2019-10-15 01:09:43,775 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:43,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:43,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1564587875, now seen corresponding path program 1 times [2019-10-15 01:09:43,776 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:43,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514769246] [2019-10-15 01:09:43,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:43,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:43,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 01:09:43,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514769246] [2019-10-15 01:09:43,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605624836] [2019-10-15 01:09:43,969 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:09:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:44,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 2775 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:09:44,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:09:44,630 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:09:44,630 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:09:45,370 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:09:45,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:09:45,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 18 [2019-10-15 01:09:45,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169027228] [2019-10-15 01:09:45,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:09:45,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:45,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:09:45,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:09:45,373 INFO L87 Difference]: Start difference. First operand 596 states and 923 transitions. Second operand 5 states. [2019-10-15 01:09:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:46,230 INFO L93 Difference]: Finished difference Result 1134 states and 1804 transitions. [2019-10-15 01:09:46,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:46,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-10-15 01:09:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:46,236 INFO L225 Difference]: With dead ends: 1134 [2019-10-15 01:09:46,237 INFO L226 Difference]: Without dead ends: 604 [2019-10-15 01:09:46,240 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 301 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:09:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-15 01:09:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-10-15 01:09:46,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-15 01:09:46,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 936 transitions. [2019-10-15 01:09:46,264 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 936 transitions. Word has length 151 [2019-10-15 01:09:46,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:46,264 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 936 transitions. [2019-10-15 01:09:46,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:09:46,265 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 936 transitions. [2019-10-15 01:09:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:09:46,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:46,269 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:46,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:46,477 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:46,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:46,478 INFO L82 PathProgramCache]: Analyzing trace with hash 915558911, now seen corresponding path program 1 times [2019-10-15 01:09:46,478 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:46,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481923027] [2019-10-15 01:09:46,478 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:46,479 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:46,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:09:46,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481923027] [2019-10-15 01:09:46,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601274357] [2019-10-15 01:09:46,656 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:09:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:47,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 2777 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:09:47,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:09:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:09:47,314 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:09:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:09:47,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:09:47,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 17 [2019-10-15 01:09:47,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704553544] [2019-10-15 01:09:47,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:09:47,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:47,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:09:47,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:09:47,994 INFO L87 Difference]: Start difference. First operand 604 states and 936 transitions. Second operand 5 states. [2019-10-15 01:09:48,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:48,842 INFO L93 Difference]: Finished difference Result 1150 states and 1827 transitions. [2019-10-15 01:09:48,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:48,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-15 01:09:48,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:48,847 INFO L225 Difference]: With dead ends: 1150 [2019-10-15 01:09:48,847 INFO L226 Difference]: Without dead ends: 612 [2019-10-15 01:09:48,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 305 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:09:48,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-15 01:09:48,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-15 01:09:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-15 01:09:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 949 transitions. [2019-10-15 01:09:48,873 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 949 transitions. Word has length 153 [2019-10-15 01:09:48,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:48,874 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 949 transitions. [2019-10-15 01:09:48,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:09:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 949 transitions. [2019-10-15 01:09:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 01:09:48,877 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:48,878 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:49,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:49,090 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:49,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:49,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2063753757, now seen corresponding path program 1 times [2019-10-15 01:09:49,091 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:49,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939570057] [2019-10-15 01:09:49,091 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:49,091 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:49,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:09:49,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939570057] [2019-10-15 01:09:49,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451932554] [2019-10-15 01:09:49,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:50,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 2779 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:09:50,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:09:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:09:50,212 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:09:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:09:50,545 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:09:50,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [11] total 18 [2019-10-15 01:09:50,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258178072] [2019-10-15 01:09:50,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:09:50,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:50,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:09:50,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:09:50,550 INFO L87 Difference]: Start difference. First operand 612 states and 949 transitions. Second operand 9 states. [2019-10-15 01:09:51,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:51,905 INFO L93 Difference]: Finished difference Result 657 states and 1009 transitions. [2019-10-15 01:09:51,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:09:51,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-10-15 01:09:51,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:51,912 INFO L225 Difference]: With dead ends: 657 [2019-10-15 01:09:51,912 INFO L226 Difference]: Without dead ends: 640 [2019-10-15 01:09:51,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 313 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-10-15 01:09:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-10-15 01:09:51,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 626. [2019-10-15 01:09:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-15 01:09:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 968 transitions. [2019-10-15 01:09:51,937 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 968 transitions. Word has length 155 [2019-10-15 01:09:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:51,938 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 968 transitions. [2019-10-15 01:09:51,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:09:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 968 transitions. [2019-10-15 01:09:51,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:09:51,943 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:51,943 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:52,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:52,150 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:52,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:52,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1623669378, now seen corresponding path program 1 times [2019-10-15 01:09:52,151 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:52,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559806234] [2019-10-15 01:09:52,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:52,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:52,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:09:52,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559806234] [2019-10-15 01:09:52,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016737473] [2019-10-15 01:09:52,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:53,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-15 01:09:53,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:09:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:09:53,356 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:09:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:09:53,708 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:09:53,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [11] total 14 [2019-10-15 01:09:53,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293980257] [2019-10-15 01:09:53,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:09:53,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:53,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:09:53,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:09:53,711 INFO L87 Difference]: Start difference. First operand 626 states and 968 transitions. Second operand 5 states. [2019-10-15 01:09:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:53,750 INFO L93 Difference]: Finished difference Result 643 states and 988 transitions. [2019-10-15 01:09:53,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:53,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-10-15 01:09:53,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:53,754 INFO L225 Difference]: With dead ends: 643 [2019-10-15 01:09:53,755 INFO L226 Difference]: Without dead ends: 626 [2019-10-15 01:09:53,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 329 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:09:53,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-15 01:09:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-15 01:09:53,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-15 01:09:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 966 transitions. [2019-10-15 01:09:53,779 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 966 transitions. Word has length 161 [2019-10-15 01:09:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:53,780 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 966 transitions. [2019-10-15 01:09:53,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:09:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 966 transitions. [2019-10-15 01:09:53,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-15 01:09:53,785 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:53,786 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:53,992 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:53,993 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:53,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:53,994 INFO L82 PathProgramCache]: Analyzing trace with hash 428135790, now seen corresponding path program 1 times [2019-10-15 01:09:53,994 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:53,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043749190] [2019-10-15 01:09:53,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:53,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:53,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:54,176 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:09:54,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043749190] [2019-10-15 01:09:54,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944106256] [2019-10-15 01:09:54,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:54,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 2845 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 01:09:54,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:09:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:09:54,899 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:09:55,323 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:09:55,324 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:09:55,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [11] total 18 [2019-10-15 01:09:55,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170063135] [2019-10-15 01:09:55,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:09:55,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:55,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:09:55,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:09:55,327 INFO L87 Difference]: Start difference. First operand 626 states and 966 transitions. Second operand 9 states. [2019-10-15 01:10:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:00,146 INFO L93 Difference]: Finished difference Result 1831 states and 2908 transitions. [2019-10-15 01:10:00,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:10:00,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2019-10-15 01:10:00,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:00,158 INFO L225 Difference]: With dead ends: 1831 [2019-10-15 01:10:00,159 INFO L226 Difference]: Without dead ends: 1271 [2019-10-15 01:10:00,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2019-10-15 01:10:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2019-10-15 01:10:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1228. [2019-10-15 01:10:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2019-10-15 01:10:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1939 transitions. [2019-10-15 01:10:00,306 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1939 transitions. Word has length 179 [2019-10-15 01:10:00,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:00,309 INFO L462 AbstractCegarLoop]: Abstraction has 1228 states and 1939 transitions. [2019-10-15 01:10:00,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:10:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1939 transitions. [2019-10-15 01:10:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-15 01:10:00,318 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:00,319 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:00,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:00,530 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:00,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:00,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1186257159, now seen corresponding path program 1 times [2019-10-15 01:10:00,531 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:00,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390166646] [2019-10-15 01:10:00,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:00,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:00,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:10:00,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390166646] [2019-10-15 01:10:00,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440984297] [2019-10-15 01:10:00,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:01,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 2861 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-15 01:10:01,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-15 01:10:01,617 INFO L321 TraceCheckSpWp]: Computing backward predicates...